Following is an infeassible solution for the linear programming model given below:
Maximize,
Subject to constraint
Constraint 2
As we learnt in
Corner Point Method -
This method of solving a LPP graphically is based on the principle of extreme points theorem.
-
At (1,3), it is maximum
Option 1)
Correct
Option 2)
Incorrect
Option 3)
Incorrect
Option 4)
Incorrect