Gopisankar.T

                                                LINEAR PROGRAMMING PROBLEM Linear Programming Problems are two types 1. Maximization Problems such as Maximizing the Profit. 2. Minimization Problems such as minimizing the Cost. The General form of an L.P.P is as follows: Maximize or minimize Z = C1x1+ C2x2 + C3x3+……..+ Cnxn …………..(1) Subject to the constraints a11x1+a12x2+a13x3+………+a1nxn  or = or  b1 a21x1+a22x2+a23x3+……….+a2nxn or = or b2 ………………………………………………… ………………….(2) ………………………………………………… ………………………………………………… am1x1+am2x2+am3x3+……….+amnxn or = or bm and x1, x2, x3…………..xn  0………………………………………….(3).                Objective Function The equation Maximize or minimize Z = C1x1+ C2x2 + C3x3+……..+ Cnxn is called the  Objective function.                      ...