determine the maximum number of basic feasible solution in the linear program with the following constraints :
x1+x2<=6
x2<=3
x1,x2>=0
note that you will have to introduce two slack variables to the above constraints
using x1 as x and x2 as y :
plotting the constraints :
x+y<=6
y<=3
x>=0
y>=0
the solutions are the corners of the region that has all the regions overalpping :
the 4 corners are :
therefore,
the possible feasible solutions are :
(0,0), (6,0), (0,3), (3,3)
so, the maximum number of basic feasible solution in the linear program with the given constraints = 4
(please UPVOTE)
Get Answers For Free
Most questions answered within 1 hours.