Dual simplex method


Use the dual simplex method to show that this problem is infeasible.

Maximize z= -8x1 - x2 -x3

s.t.

2x1 + x2 >= 20

-2x1 + x2 - x3 >= 12

x1 + x3 <= 7

x1 - x2 + x3 >= 5

x1, x2, x3 >= 0

Request for Solution File

Ask an Expert for Answer!!
Basic Statistics: Dual simplex method
Reference No:- TGS0873264

Expected delivery within 24 Hours