maximization problem

Project Description:

max z = 4 x1 + 4x2 + x3
s.t. x1+x2+x3 _=8
-2x1- x2 _= -5
2x1 + 2x2 + 3x3 =6
x1, x2, x3 _= 0
find optimal solution ;

a) use cj – zj row index method;
b) use the big m method,
c) use two-phase method to solve the lp.
Skills Required:
Project Stats:

Price Type: Negotiable

Expired
Total Proposals: 3
1 Current viewersl
7 Total views
Project posted by:

Proposals

Proposals Reputation Price offered