Fundamental Theorems Theorem 1 Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or ...

A linear programming problem whose feasible region is unbounded does not have an optimal solution. Q: 8 The objective function of a linear programming problem is given by Z = ax + by; where a and ...