Question

A linear programming problem is shown below.

Maximize 3x + 7y

Subject to 3x+ 7y $\leq$ 10

                 4x + 6y $\leq$ 8

                 x, y $\geq$ 0

It has…………                                                                        

      (a) an unbounded objective function

      (b) exactly one optimal solution

      (c) exactly two optimal solutions

      (d) infinitely many optimal solutions

Answer 1

 

 

If we remove the second constraint ( 4x + 6y ≤ 8 ) from the problem, then therewill be infinitely many optimal solutions possible as the constraint is same as objective term. Every point which satisfies the constraint will be an optimal solution