Explain linear programming problems with redundant constrain


Explain linear programming problems with redundant constraints.

Consider the subsequent linear programming problem:

Maximize Subject to:

10X + 30Y

X + 2Y ≤ 80

8X + 16Y ≤ 640

4X 2Y ≥ 100

X,Y ≥ 0

A) This is a special case of a linear programming problem in which

B) There is no feasible solution.

C) There is a redundant constraint.

D) There are multiple optimal solutions.

E) This cannot be solved graphically

F) None of these.

Request for Solution File

Ask an Expert for Answer!!
Basic Statistics: Explain linear programming problems with redundant constrain
Reference No:- TGS023420

Expected delivery within 24 Hours