Consider the following linear programming problem:

Maximize Z = 20X1 + 30X2

Subject to:       X1 + X2 =< 80

8X1 + 9X2 =< 600

3X1 + 2X2 => 400

X1,X2 => 0

This is a special case of a linear programming problem in which:

1. 1. there is no feasible solution.
   2. there is a redundant constraint.
   3. there are multiple optimal solutions.
   4. this cannot be solved graphically.
   5. none of the above.

 

Answer:a.

Step-by-step explanation

Solution

The answer to this question is (a).

Consider the plots of the constraint functions below.

?x2?=80−x1??

?x2?=9600−8x1???

?x2?=2400−3x1???

It is clear from the diagram that there are zero relationships among the lines. In a linear programming problem, if non of the constraint functions intersect with the other, there can be no feasible solution.

please use this google drive link to download the answer file.

https://drive.google.com/file/d/1XGgQsBYClJO4Zx76cDm_IL8wi5XPLnl1/view?usp=sharing

note: if you have any trouble in viewing/downloading the answer from the given link, please use this below guide to understand the whole process.

https://helpinhomework.org/blog/how-to-obtain-answer-through-google-drive-link