In problem 27 we provide example of linear programs that res

In problem 27, we provide example of linear programs that result in one for more of the following situation: Optical solution Infeasible solution Unbounded solution Alternative optimal solutions Degenerate solution For each linear program, determine the solution situation that exists, and indicate how you identified each situation using the simplex method.

Solution

The given linear program has optimal solution. with x1= 10 and x2=0

		x1	x2
		10	0	z
	c	2	4	20
				TOTAL		b
		1	0.5	10	<=	10
	A	1	0.5	10	=	12
		1	1.5	10	<=	18