We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 13
so
Or. Md. Rezaul Karim,
Linear Programming
(Simplex Method)
isas
General Linear Programming Problem: Mathematical model of a linear programming problem
follows. Determine x,,.x2, 1%» Which
Optimize z = 64x, + 6x2 +“.
Subject to aux; + ay2%2 +»
4g Xy + 9X2 +
AmiX, + Aaa + *
and non-negativty constraints
xj 20, j=1,2,3,
where c/s, bis and aiys are constants and x's are decision variables.
A General Maximization Linear Programming Problem: A maximization linear program inn
Variable and subject to m constraint will appear as follows:
Maximize z= cx, + 6%, +
+ n%n
ot Qykn Sy
+ dan%n Sb
Subject to ay yx, 4 ay2%2 + som
34X; + 22%) +
+ OmanXn S bm
ie. Maximize z =
Subject to T9,ayxj