UNIT 2
SIMPLEX METHOD The simplex method is also called simplex Technique. It was developed by G. B. Dantzig, an American Mathematician. Canonical Form The canonical form of L.P.P is Maximize Z = c1x1 + c2x2 + c3x3 +…..,+cnxn Subject to the constraints ai1x1 + ai2x2 +….,+ ainxn ≤ bi for i = 1, 2, 3, 4,……,m with x1, x2, x3,…..xn ≥ 0 Slack Variable It is a non negative variable which is added to the L.H.S of a constraint in (≤) types to make it into “ = ” types. Example : The constraint -2x1 – 3x2 ≤ -18 can be written as -2x1 – 3x2 + S = -18, where S is the slack variable. De generate Solution :- A basic solution to a system of linear equations AY = B is called degenerate solution. If one or more of the basic variables are zero. Non degenerate solution :- When all the basic variables are non zero the basic solution is called non degenerate Thanking you K.SATHISH KUMAR 23UCM030 I B.COM 10/02/2024