Question: The feasible region of a linear programming problem has four extreme points: A(0,0), B(1,1), C(0,1), and D(1,0). Identify an optimal solution for minimization problem with
The feasible region of a linear programming problem has four extreme points: A(0,0), B(1,1), C(0,1), and D(1,0). Identify an optimal solution for minimization problem with the objective function
z = 2 x - 2 y
- A unique solution at C
- A unique solutions at D
- An alternative solution at a line segment between A and B
- An unbounded solution
Step by Step Solution
3.44 Rating (157 Votes )
There are 3 Steps involved in it
Correct Option is A ie A unique solution at C EXPLANATION ... View full answer
Get step-by-step solutions from verified subject matter experts
