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 objective function z = 2 x - 2 y

A. A unique solution at C

B. A unique solutions at D

C. An alternative solution at a line segment between A and B

D. An unbounded solution​

Answer 1

putting the value of c in form of z=2x-2y

then 2*0-2*1=0-2=-2 it's a solution of questions a

b)

Answer 2

Answer:

The correct answer of this question is A unique solutions at D.

Step-by-step explanation:

Given - The feasible region of a linear programming problem has four extreme points.

To Find - Choose the correct option.

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) is  A unique solutions at D.

A region that satisfies a set of inequality rules is referred to as a viable region. The area complies with all requirements set out by a linear programming scenario. The idea is an approach to optimization. If a viable solution cannot be expressed as a convex combination of other feasible solutions, it is an extreme point. We now provide a theorem regarding extreme points. Extreme points are significant because, on occasion, they offer advantageous structural characteristics that we may take advantage of to round LP solutions. The area of the graph that contains every point that satisfies every inequality in a system is known as the feasible region. First, graph each inequality in the system before drawing the reachable region.

#SPJ3