<p> RB/OR/LPP/CN/1 LINEAR PROGRAMMING FORMULATION & GRAPHICAL METHOD</p><p>Aim: To optimally utilize the scarce resources- e.g. money, man power, machinery etc.</p><p>LP is the most popular and widely accepted deterministic technique of Mathematical programming. </p><p>The credit for its development goes to George B Dentzig in 1947.</p><p>Basic Terminology, Requirements, Assumptions of LP</p><p>The word linear stresses on directly proportional relationship among the variables while the world programming refers to the systematic procedure of solution. </p><p>Basic Requirements: 1. Decision variables and their relationship 2. Objective Function 3. Constraints 4. Alternative courses of actions 5. Non negativity restriction 6. Linearity</p><p>Basic Assumptions 1. Proportionality : The amount of each resource used and associated contribution to profit (or cost) in the OF must be proportional. 2. Divisibility: Continuous values of decision variables and resources must be permissible in obtaining optimal solution. 3. Additivity: The total profitability and the total amount of each resource utilized must be equal to sum of the respective individual amounts. 4. Certainty: All coefficients and parameters in LP model are known with certainty. </p><p>Advantages of LP 1. LP helps in attaining the optimum use of productive factors. 2. Improve the quality of decisions 3. Provides possible and practical solutions and keeps room open for modification. 4. Highlights the problem areas, bottlenecks and constraints operating upon the problem in hand. RB/OR/LPP/CN/2 Limitations of LP</p><p>1. Treat all relationships leaner which usually does not happen in realty. 2. Integral solution is not guaranteed. 3. Does not take into consideration the effect of time and uncertainty. 4. Sometimes, it is unable to solve large scale problems and demands for decomposition. 5. Deals with only a single objective. </p><p>Application Areas of LPP</p><p>Agriculture: Allocation of scarce resources-acreage, labour, water, capital…</p><p>Military: Various optimizations pertaining to allocation, transportation, strategies or so. </p><p>Production Management  Product Mix  Production Planning  Assembly Line Balancing  Blending Problems  Trim Loss Prevention</p><p>Financial Management  Portfolio Selection  Profit Planning</p><p>Marketing Management  Media Selection  Traveling Salesman Problem  Physical Distribution</p><p>Personnel Management  Staffing Problem  Determination of Equitable Salaries  Job Evaluation and Selection</p><p>Formulation of a LP Model 1. Identify the decision variables and express them in algebraic symbols 2. Identify all the constraints or limitations and express as equations 3. Identify the Objective Function and express it as a linear function. RB/OR/LPP/CN/3</p><p>General Mathematical Formulation of LPP</p><p>Optimize (Maximize or Minimize) </p><p>Z = c1 x1 + c2 x2+…+cn xn Subject to: </p><p> a11 x1 + a12 x2 +…+ a1n xn (<=, =, >= ) b1 a21 x1 + a22 x2 +…+ a2n xn (<=, =, >= ) b2</p><p>. .</p><p> am1 x1 + am2 x2 +…+ amn xn (<=, =, >= ) bm and x1, x2, …xn >=0 </p><p>The above formulation may also be expressed with the following notations: </p><p>Optimize (Max. or Min.) z = Σ cj xj for j = 1..n, (Objective Function) Subject to: Σ a ij xj (<=, =, >=) bi ; for j = 1 ..n, i = 1,2, …m (Constraints) and xj >=0 ; j= 1, 2, …, n (Non negativity restrictions)</p><p>Some Definitions</p><p>1. Solution: pertains to the values of decision variables that satisfies constraints 2. Feasible solution: Any solution that also satisfies the non negativity restrictions 3. Basic Solution: For a set of m simultaneous equations in n unknowns (n>m), a solution obtained by setting n- m of the variables equal to zero and solving the m equation in m unknowns is called basic solution. 4. Basic Feasible solution: A feasible solution that is also basic. 5. Optimum Feasible solution: Any basic feasible solution which optimizes the objective function 6. Degenerate Solution: If one or more basic variable becomes equal to zero. </p><p>Steps for Graphical Solution RB/OR/LPP/CN/4 A. Corner Point Method 1. Define the problem mathematically 2. Graph by constraints by treating each inequality as equality. 3. Locate the feasible region and the corner points. 4. Find out the value of objective function at these points. 5. Find out the optimal solution and the optimal value of O.F. </p><p>B. Iso-Profit or Iso-Cost Line Method 1. Define the problem mathematically 2. Graph by constraints by treating each inequality as equality. 3. Locate the feasible region and the corner points. 4. Draw out a line having the slope of Objective Function Equation (this is called Iso-Cost / Profit Line in Minimization and Maximization problems respectively) somewhere in the middle of the feasible region 5. Move this line away from origin (in case of Maximization) or towards Origin (in case of Minimization) until it touches the extreme point of the feasible region. 6. If a single point is encountered, that reflects optimality and its coordination the solution. If Iso-Profit/ Cost line coincides with any constraint line at the extreme, then this is the case of multiple optimum solutions. </p><p>Some special cases:</p><p>1. Infeasible Solution 2. Multiple optimum solutions 3. Unbounded solution</p><p>Simplex Method of Solution of LPP</p><p>Steps: 1. Formulation of the mathematical model 2. Set up an initial solution 3. Test for Optimality (variable entry criteria) 4. Test for feasibility (variable leaving criteria) 5. Identify the key element 6. Determine the new solution 7. Revise the solution until optimization. RB/OR/LPP/CN/5 READY MIX PROBLEM (GRAPHICAL SOLUTION) (Ref. : Taha, Operations Research- an introduction, Pearson Education, Ed.7)</p><p>Ready Mix Produces interior and exterior paints from two raw materials M1 & M2. </p><p>The requirement of raw material for these paints as well as their availability along with the profit per tons is being expressed in the following table:</p><p>Tons of Raw Material / Tons of Maximum Availability Exterior Paint Interior Paint /day (tons) Raw Material M1 6 4 24 Raw Material M2 1 2 6 Profit/Ton (‘000$) 5 4</p><p>Market survey indicates that the daily demand for Interior Paint can not exceed that of Exterior Paint by more than 1 ton. Also, maximum daily demand of interior paint is 2 tons. </p><p>Determine the optimal product mix that maximizes total daily profit. </p><p>Formulation:</p><p>Objective Function:</p><p>Maximize Z= 5 x1 + 4 x2</p><p>Subject to:</p><p>Constraints: </p><p>1. 6x1+4x2 <= 24 2. x1 +2 x2 <=6 3. –x1+ x2 <= 1 4. x2 <= 2 5. x1 >= 0 6. x2 >= 0 RB/OR/LPP/CN/6 RB/OR/LPP/CN/7 RB/OR/LPP/CN/8 RB/OR/LPP/CN/9 RB/OR/LPP/CN/10 RB/OR/LPP/CN/11 RB/OR/LPP/CN/12</p><p>MINIMIZATION PROBLEM (GRAPHICAL METHOD)</p><p>Awash Farm uses 800 kg of mixed feed daily having the following composition:</p><p>Kg per Kg of Feedstuff Feedstuff Protein Fiber Cost Birr/ Kg Corn .09 .02 .30 Soybean Meal .60 .06 .90</p><p>The diet must contain at least 30% protein and at the most 5% fiber. </p><p>Determine the daily minimum cost feed mix. </p><p>Formulation:</p><p>Min Z = .30 x1 + .90 x2</p><p>Subject to :</p><p> x1 + x2 >= 800 .09 x1 + .60 x2 >= .30( x1+ x2) .02 x1 + .06 x2 <= .05(x1+x2) and x1, x2 >=0</p><p>Or </p><p>Min Z = .30 x1 + .90 x2 S/t x1 + x2 >= 800 .21 x1 - .30 x2 <= 0 .03 x1 - .01 x2 >= 0 and x1, x2 >= 0 RB/OR/LPP/CN/13 RB/OR/LPP/CN/14 RB/OR/LPP/CN/15 RB/OR/LPP/CN/16 RB/OR/LPP/CN/17 RB/OR/LPP/CN/18</p><p>Linear Programming Duality & Sensitivity Analysis</p><p>Duality implies that every LPP has associated with it another LPP sharing same data. They are collectively called primal-dual problems.</p><p>Either problems can be considered as primal or dual and can be derived from each other.</p><p>Optimal feasible solutions of both can be derived from each other and have the same value. </p><p>Primal Dual</p><p>Optimize (Maximize) Optimize (Minimize) </p><p>Z = c1 x1 + c2 x2+…+cn xn Z = b1 y1 + b2 y2+…+bm ym Subject to: Subject to: </p><p> a11 x1 + a12 x2 +…+ a1n xn <= b1 a11 y1 + a21 y2 +…+ am1 ym >= c1 a21 x1 + a22 x2 +…+ a2n xn <= b2 a12 y1 + a22 y2 +…+ am2 ym >= c2</p><p>. . . .</p><p> am1 x1 + am2 x2 +…+ amn xn <= bm a1n y1 + a2n y2 +…+ amn ym >= cn</p><p> and x1, x2, …xn >=0 and y1, y2, …ym >=0 RB/OR/LPP/CN/19</p><p>SENSITIVITY ANALYSIS</p><p>LP Assumes Static Environment</p><p> In LP all model parameters (e.g. Unit contribution rate (cj), the amount of available resource (bi) and the amount of resources required per unit of product (aij) are assumed to be know with certainty. </p><p>Real world situations are, however, dynamic.</p><p>Hence, it is important to the decision maker to know about the changes in parameters. </p><p>Sensitivity Analysis or post optimality analysis helps in investigating relationships between the change in model parameters and the optimum solution.</p><p>In other word, it brings an element of dynamism to the static nature of LP.</p>