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 = 200x _{1} +
300x_{2}**

subject to

2x_{1} + 3x_{2} ≥ 1200

x_{1} + x_{2} ≤ 400

2x_{1} + 1.5x_{2} ≥ 900

x_{1}, x_{2} ≥ 0

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**