In linear programming. a solution that does not simultaneously satisfy all constraints is called an

in linear programming, a solution that does not simultaneously satisfy all constraints is called?

a. impossible solution

b. infeasible solution

c. intermediate solution

d. illogical solution

Answer

in linear programming, a solution that does not simultaneously satisfy all constraints is called?

b. infeasible solution.

In some cases, there is no feasible solution area, i.e., there are no points that satisfy all constraints of the problem. An infeasible LP problem with two decision variables can be identified through its graph. For example, let us consider the following linear programming problem.

Minimize z = 200x1 + 300x2

subject to

2x1 + 3x2 ≥ 1200
x1 + x2 ≤ 400
2x1 + 1.5x2 ≥ 900

x1, x2 ≥ 0

Infeasible Problem 5002x1.52-900 400 300 200 1001 X1 + X2= 400 2x1 + 3x2-1200 0 100 200 300 400 450 500 600 -

The region located on the right of PQR includes all solutions, which satisfy the first and the third constraints. The region located on the left of ST includes all solutions, which satisfy the second constraint. Thus, the problem is infeasible because there is no set of points that satisfy all the three constraints.

Hottest videos

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Posts