Lab Assignment 3 (24/01/2017)

1. Solve the following problem manually by simplex method.

M ax3x1 +5x2 +4x3 s.to 2x1 +3x2 8, 2x2 +5x3 10, 3x1 +2x2 +4x3 15, x1 , x2 , x3 0

Ans: (x1 = 89/41, x2 = 50/41, x3 = 62/41), max = 765/41

2. Write C program for simplex method to solve a general linear programming

problem:
M aximize c1 x1 + c2 x2 + ... + cn xn
subject to
a11 x1 + a12 x2 + ... + a1n xn b1
a21 x1 + a22 x2 + ... + a2n xn b2
.................
am1 x1 + am2 x2 + ... + amn xn bm
where bi 0, i = 1, 2, ..., m, xj 0, j = 1, 2, ..., n,m n

Out put:
(I) Optimal Solution, Optimal value
(II)Solution is Unbounded(If zj cj < 0 corresponding to some non basic col-
umn and corresponding column element xij 0 for all i = 1, 2, ..., m. )
(III)Optimal Solution, Alternate solution exists: ((i)If there is an optimal basic
feasible solution to a LPP and for some non basic column zj cj = 0 and cor-
responding xi j < 0i then nonbasic alternate optimum solution will exist.(ii)If
there is an optimal basic feasible solution to a LPP and for some non basic
column zj cj = 0 and corresponding xi j > 0 for at least one i = 1, 2, ..., m
then basic alternate optimum solution will exist.)

3. Using this C program find the solution of the following problems.

(i) max 2x1 +4x2 +x3 +x4 s.to x1 +3x2 +x4 4, 2x1 +x2 3, x2 +4x3 +x4 3, xj 0

(ii) min 3x1 4x2 s.to x1 x2 1, x1 + x2 2, x1 , x2 0