Pee eee eee ee ee SLACK VARIABLES The non-negative variable which i equation is called the slack variable. For example. consider the constraints: A tay 2. 24 day <5 and xy .3y 20 We add the slack variables 5, > 0,5) = 0 on'the left hand side of above inequalities respectively to obtai SURPLUS VARIABLES (esata araS ble which is subtracted from the left hand side of the constraint to convert it into The positive va equation is called the surplus variable. - For example. consider the constraints: 22. 2x, 14x, 25 and x.%, 20 4 xy 22.24 We subtract the surplus variables 3, 20,5220 on the left hand side of above inequalities respectively to obtain3: Allvatibles must have non-negative values 4. The objective fnction shold be of maximization form, ‘The standard form of a general LPP involving. deision variables end ‘hmasimizaon objective irton is given by Max. Z= 65, Hepty +t yh +05, +05: Oy “ Subject consis ee nF #28 gay vg 20 IMPORTANT DEFINITIONS cons Selon to LPP: Any sto ales fat) 08 ur, of eonstains (2) onlyFeasible Solution: Any set of values {rotons Sq} OF variables is called a feasTble itsaisties the set of constants (2) and non-negativity constraints 6). Basie Solution: Vw solution, if) ‘basic solution tothe set of constraints (3) is a solution obtained by setting any n ‘ariables (among.an «11 variables) equal to zero and solving for remaining m variables. provided the determinant of the Coellicients of these m variables is Ron-zero. Such mi variables are called ‘the basic variables and remaining 11 zero-valued variables are called non-basic variables, Basic Feasible Solution: “A basic feasible solution is a basic solution which also satis| fies the non- Negativity constraints (3). Basic feasible solutions are of two types in nature (a) Non-degenerate BFS: A non-degenerate basic feasible solution is the basic feasible solution which has exactly m Positive variables. In other words, al Il_m basic variables are positive, and. the Temaining 17 variables will be all zero, (b) Degenerate BFS: A basic feasible solution is called degenerate, if one or more basic variables are Zero-valued. In otherwords, ifthe number of positive valued basie variables are less than m, then the BFS is called degenerate. Optimum Basic Feasible Solution: A basic feasible solution is said to be optimum, if it also optimizes (maximizes or minimizes) the objective function (1) Yabounded Solution: If the value of the objective function Z can be increased or decreased indefinitely, such solutions are called unbounded solutions,cfficient iterativetice, ste Simplex method is an P by step) procedure by which a new basic feasible solution can be obtained from a given (initial) te sibl : asic feasible solution so that the value of the objective funetion is improved, Since the mimber of ext Solution space are finite, the method assures an improv iteration to another in a finite number of sleps and reached, reme points ( corners oF vertices) af feasible fement in the solution 4s we move from one also signals when SIMPLEX ALGORITHM ‘The steps of the simplex algorit Ainear programming probem areas fll \ Step 1: Form thm to obtain an optimal solution (if it exists) to a standard lows: of the Mathematical model (Tithe objective function is of minimization, then convert it into ‘maximization problem, using the relation Maximize Z” = -Minimize Z (ii) Check whether all the values in the right hand side of the constraints are positive. If not. make it positive by multiplying the correspond ing constraint by -1 Express the mathematical model of the given LPP in the standard form by adding, additional variables to the left side of each constraint and assign a zero cost coctticient to these in the objective function. \ Sep 2: Set up the initial solution Initial basic feasible solution can be found by assigning the values of all variables except slack and artificial variables to zero (non-basic variables). ‘The values of slack and artificial variable(if present) thus obtained (basie variables) is the initial basic feasible solution Step 3: Constructing Simplex Table ‘After obtaining initial b.fs, construct the Simplex table as follows. “> G 0 0 Coefficient of Basic Value of basic Variables Basic variables variables variables yO XS Sy (Ca) B >) | in 18 0 «i si xn a . in tie 8 0 em : nn wd 5 2m ima bm in Z=Lepxp oneal oo 0 ae) heey yee oo0 0The variables corresponding {o the columns of identity matrix are called basic variables and the Variables. In general, if an LPP has a vari Femaining onés non-basie f basic lables and m( *Ge “ SEG igh ai Xg Step e: Go to Step Soukion 18 Obtained dy thowe is an Slution. 4 and peat the Proaduve until eithsy Gn Optimal indication oP unboundsd