linear programming - model formulation, graphical method
TRANSCRIPT
![Page 1: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/1.jpg)
2-1
Linear Programming:
Model Formulation and Graphical
SolutionJOSEPH GEORGE KONNULLY
Prepared by
![Page 2: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/2.jpg)
2-2
Topics Linear Programming – An overview Model Formulation Characteristics of Linear Programming
Problems Assumptions of a Linear Programming
Model Advantages and Limitations of a Linear
Programming. A Maximization Model Example Graphical Solutions of Linear Programming
Models A Minimization Model Example Irregular Types of Linear Programming
Models
![Page 3: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/3.jpg)
2-3
Objectives of business decisions frequently involve maximizing profit or minimizing costs.
Linear programming uses linear algebraic relationships to represent a firm’s decisions, given a business objective, and resource constraints.
Steps in application:1. Identify problem as solvable by linear
programming.2. Formulate a mathematical model of the
unstructured problem.3. Solve the model.4. Implementation
Linear Programming: An Overview
![Page 4: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/4.jpg)
2-4
Decision variables - mathematical symbols representing levels of activity of a firm.
Objective function - a linear mathematical relationship describing an objective of the firm, in terms of decision variables - this function is to be maximized or minimized.
Constraints – requirements or restrictions placed on the firm by the operating environment, stated in linear relationships of the decision variables.
Parameters - numerical coefficients and constants used in the objective function and constraints.
Model Components
![Page 5: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/5.jpg)
2-5
Summary of Model Formulation Steps
Step 1 : Clearly define the decision variables
Step 2 : Construct the objective function Step 3 : Formulate the constraints
![Page 6: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/6.jpg)
2-6
Characteristics of Linear Programming Problems
A decision amongst alternative courses of action is required.
The decision is represented in the model by decision variables.
The problem encompasses a goal, expressed as an objective function, that the decision maker wants to achieve.
Restrictions (represented by constraints) exist that limit the extent of achievement of the objective.
The objective and constraints must be definable by linear mathematical functional relationships.
![Page 7: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/7.jpg)
2-7
Proportionality - The rate of change (slope) of the objective function and constraint equations is constant.
Additivity - Terms in the objective function and constraint equations must be additive.
Divisibility -Decision variables can take on any fractional value and are therefore continuous as opposed to integer in nature.
Certainty - Values of all the model parameters are assumed to be known with certainty (non-probabilistic).
Assumptions of Linear Programming Model
![Page 8: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/8.jpg)
2-8
It helps decision - makers to use their productive resource effectively.
The decision-making approach of the user becomes more objective and less subjective.
In a production process, bottle necks may occur. For example, in a factory some machines may be in great demand while others may lie idle for some time. A significant advantage of linear programming is highlighting of such bottle necks.
Advantages of Linear Programming Model
![Page 9: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/9.jpg)
2-9
Linear programming is applicable only to problems where the constraints and objective function are linear i.e., where they can be expressed as equations which represent straight lines. In real life situations, when constraints or objective functions are not linear, this technique cannot be used.
Factors such as uncertainty, and time are not taken into consideration.
Parameters in the model are assumed to be constant but in real life situations they are not constants.
Linear programming deals with only single objective , whereas in real life situations may have multiple and conflicting objectives.
In solving a LPP there is no guarantee that we get an integer value. In some cases of no of men/machine a non-integer value is meaningless.
Limitations of Linear Programming Model
![Page 10: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/10.jpg)
2-10
LP Model FormulationA Maximization Example (1 of 4)
Product mix problem - Beaver Creek Pottery Company
How many bowls and mugs should be produced to maximize profits given labor and materials constraints?
Product resource requirements and unit profit:Resource Requirements
Product Labor(Hr./Unit)
Clay(Lb./Unit)
Profit($/Unit)
Bowl 1 4 40
Mug 2 3 50
![Page 11: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/11.jpg)
2-11
LP Model FormulationA Maximization Example (2 of 4)
![Page 12: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/12.jpg)
2-12
LP Model FormulationA Maximization Example (3 of 4)
Resource 40 hrs of labor per dayAvailability: 120 lbs of clay
Decision x1 = number of bowls to produce per day
Variables: x2 = number of mugs to produce per day
Objective Maximize Z = $40x1 + $50x2
Function: Where Z = profit per day
Resource 1x1 + 2x2 40 hours of laborConstraints: 4x1 + 3x2 120 pounds of clay
Non-Negativity x1 0; x2 0 Constraints:
![Page 13: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/13.jpg)
2-13
LP Model FormulationA Maximization Example (4 of 4)
Complete Linear Programming Model:
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 404x2 + 3x2 120x1, x2 0
![Page 14: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/14.jpg)
2-14
A feasible solution does not violate any of the constraints:
Example: x1 = 5 bowls
x2 = 10 mugsZ = $40x1 + $50x2 = $700
Labor constraint check: 1(5) + 2(10) = 25
< 40 hours Clay constraint check: 4(5) + 3(10) = 70
< 120 pounds
Feasible Solutions
![Page 15: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/15.jpg)
2-15
An infeasible solution violates at least one of the constraints:
Example: x1 = 10 bowls
x2 = 20 mugs Z = $40x1 + $50x2 = $1400
Labor constraint check: 1(10) + 2(20) = 50 > 40 hours
Infeasible Solutions
![Page 16: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/16.jpg)
2-16
Graphical solution is limited to linear programming models containing only two decision variables (can be used with three variables but only with great difficulty).
Graphical methods provide visualization of how a solution for a linear programming problem is obtained.
Graphical methods can be classified under two categories:
1. Iso-Profit(Cost) Line Method
2. Extreme-point evaluation Method.
Graphical Solution of LP Models
![Page 17: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/17.jpg)
2-17
Coordinate AxesGraphical Solution of Maximization Model (1 of 12)
Figure 2.2 Coordinates for Graphical Analysis
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
X1 is bowls
X2 is mugs
![Page 18: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/18.jpg)
2-18
Labor ConstraintGraphical Solution of Maximization Model (2 of 12)
Figure 2.3 Graph of Labor Constraint
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 19: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/19.jpg)
2-19
Labor Constraint AreaGraphical Solution of Maximization Model (3 of 12)
Figure 2.4 Labor Constraint Area
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 20: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/20.jpg)
2-20
Clay Constraint AreaGraphical Solution of Maximization Model (4 of 12)
Figure 2.5 Clay Constraint Area
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 21: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/21.jpg)
2-21
Both ConstraintsGraphical Solution of Maximization Model (5 of 12)
Figure 2.6 Graph of Both Model Constraints
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 22: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/22.jpg)
2-22
Feasible Solution AreaGraphical Solution of Maximization Model (6 of 12)
Figure 2.7 Feasible Solution Area
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 23: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/23.jpg)
2-23
Objective Function Solution = $800Graphical Solution of Maximization Model (7 of 12)
Figure 2.8 Objection Function Line for Z = $800
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 24: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/24.jpg)
2-24
Alternative Objective Function Solution LinesGraphical Solution of Maximization Model (8 of 12)
Figure 2.9 Alternative Objective Function Lines
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 25: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/25.jpg)
2-25
Optimal SolutionGraphical Solution of Maximization Model (9 of 12)
Figure 2.10 Identification of Optimal Solution Point
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 26: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/26.jpg)
2-26
Optimal Solution CoordinatesGraphical Solution of Maximization Model (10 of 12)
Figure 2.11 Optimal Solution Coordinates
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 27: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/27.jpg)
2-27
Extreme (Corner) Point SolutionsGraphical Solution of Maximization Model (11 of 12)
Figure 2.12 Solutions at All Corner Points
Maximize Z = $40x1 + $50x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
![Page 28: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/28.jpg)
2-28
Optimal Solution for New Objective FunctionGraphical Solution of Maximization Model (12 of 12)
Maximize Z = $70x1 + $20x2
subject to: 1x1 + 2x2 40 4x2 + 3x2 120
x1, x2 0
Figure 2.13 Optimal Solution with Z = 70x1 + 20x2
![Page 29: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/29.jpg)
2-29
Standard form requires that all constraints be in the form of equations (equalities).
A slack variable is added to a constraint (weak inequality) to convert it to an equation (=).
A slack variable typically represents an unused resource.
A slack variable contributes nothing to the objective function value.
Slack Variables
![Page 30: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/30.jpg)
2-30
Linear Programming Model: Standard Form
Max Z = 40x1 + 50x2 + s1 + s2
subject to:1x1 + 2x2 + s1 = 40 4x2 + 3x2 + s2 = 120 x1, x2, s1, s2 0Where:
x1 = number of bowls x2 = number of mugs s1, s2 are slack variables
Figure 2.14 Solution Points A, B, and C with Slack
![Page 31: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/31.jpg)
2-31
LP Model Formulation – Minimization (1 of 8)
Chemical Contribution
Brand Nitrogen (lb/ bag)
Phosphate (lb/ bag)
Super-gro 2 4
Crop-quick 4 3
Two brands of fertilizer available - Super-gro, Crop-quick.
Field requires at least 16 pounds of nitrogen and 24 pounds of phosphate.
Super-gro costs $6 per bag, Crop-quick $3 per bag. Problem: How much of each brand to purchase to
minimize total cost of fertilizer given following data ?
![Page 32: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/32.jpg)
2-32
LP Model Formulation – Minimization (2 of 8)
Figure 2.15 Fertilizing farmer’s field
![Page 33: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/33.jpg)
2-33
Decision Variables: x1 = bags of Super-grox2 = bags of Crop-quick
The Objective Function:Minimize Z = $6x1 + 3x2
Where: $6x1 = cost of bags of Super-Gro
$3x2 = cost of bags of Crop-Quick
Model Constraints:2x1 + 4x2 16 lb (nitrogen constraint)4x1 + 3x2 24 lb (phosphate constraint)x1, x2 0 (non-negativity constraint)
LP Model Formulation – Minimization (3 of 8)
![Page 34: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/34.jpg)
2-34
Minimize Z = $6x1 + $3x2
subject to: 2x1 + 4x2 16 4x2 + 3x2 24
x1, x2 0
Figure 2.16 Graph of Both Model Constraints
Constraint Graph – Minimization (4 of 8)
![Page 35: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/35.jpg)
2-35
Figure 2.17 Feasible Solution Area
Feasible Region– Minimization (5 of 8)
Minimize Z = $6x1 + $3x2
subject to: 2x1 + 4x2 16 4x2 + 3x2 24
x1, x2 0
![Page 36: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/36.jpg)
2-36
Figure 2.18 Optimum Solution Point
Optimal Solution Point – Minimization (6 of 8)
Minimize Z = $6x1 + $3x2
subject to: 2x1 + 4x2 16 4x2 + 3x2 24
x1, x2 0
![Page 37: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/37.jpg)
2-37
A surplus variable is subtracted from a constraint to convert it to an equation (=).
A surplus variable represents an excess above a constraint requirement level.
A surplus variable contributes nothing to the calculated value of the objective function.
Subtracting surplus variables in the farmer problem constraints:
2x1 + 4x2 - s1 = 16 (nitrogen) 4x1 + 3x2 - s2 = 24 (phosphate)
Surplus Variables – Minimization (7 of 8)
![Page 38: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/38.jpg)
2-38
Figure 2.19 Graph of Fertilizer Example
Graphical Solutions – Minimization (8 of 8)
Minimize Z = $6x1 + $3x2 + 0s1 + 0s2
subject to: 2x1 + 4x2 – s1 = 16 4x2 + 3x2 – s2 = 24
x1, x2, s1, s2 0
![Page 39: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/39.jpg)
2-39
For some linear programming models, the general rules do not apply.
Special types of problems include those with: Multiple optimal solutions Infeasible solutions Unbounded solutions
Irregular Types of Linear Programming Problems
![Page 40: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/40.jpg)
2-40
Figure 2.20 Example with Multiple Optimal Solutions
Multiple Optimal Solutions Beaver Creek Pottery
The objective function is parallel to a constraint line.
Maximize Z=$40x1 + 30x2
subject to: 1x1 + 2x2 404x2 + 3x2 120x1, x2 0
Where:x1 = number of bowlsx2 = number of mugs
![Page 41: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/41.jpg)
2-41
An Infeasible Problem
Figure 2.21 Graph of an Infeasible Problem
Every possible solution violates at least one constraint:
Maximize Z = 5x1 + 3x2
subject to: 4x1 + 2x2 8 x1 4 x2 6 x1, x2 0
![Page 42: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/42.jpg)
2-42
An Unbounded Problem
Figure 2.22 Graph of an Unbounded Problem
Value of the objectivefunction increases indefinitely:
Maximize Z = 4x1 + 2x2
subject to: x1 4 x2 2 x1, x2 0
![Page 43: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/43.jpg)
2-43
Problem StatementExample Problem No. 1 (1 of 3)
■ Hot dog mixture in 1000-pound batches.■ Two ingredients, chicken ($3/lb) and beef
($5/lb).■ Recipe requirements:
at least 500 pounds of “chicken”
at least 200 pounds of “beef”
■ Ratio of chicken to beef must be at least 2 to 1.
■ Determine optimal mixture of ingredients that will minimize costs.
![Page 44: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/44.jpg)
2-44
Step 1:
Identify decision variables.
x1 = lb of chicken in mixture
x2 = lb of beef in mixture
Step 2:
Formulate the objective function.
Minimize Z = $3x1 + $5x2
where Z = cost per 1,000-lb batch $3x1 = cost of chicken $5x2 = cost of beef
SolutionExample Problem No. 1 (2 of 3)
![Page 45: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/45.jpg)
2-45
Step 3:
Establish Model Constraints x1 + x2 = 1,000 lb x1 500 lb of chicken x2 200 lb of beef x1/x2 2/1 or x1 - 2x2 0 x1, x2 0
The Model: Minimize Z = $3x1 + 5x2
subject to: x1 + x2 = 1,000 lb x1 50 x2 200 x1 - 2x2 0 x1,x2 0
SolutionExample Problem No. 1 (3 of 3)
![Page 46: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/46.jpg)
2-46
Solve the following model graphically:Maximize Z = 4x1 + 5x2
subject to: x1 + 2x2 10 6x1 + 6x2 36 x1 4 x1, x2 0
Step 1: Plot the constraints as equations
Example Problem No. 2 (1 of 3)
Figure 2.23 Constraint Equations
![Page 47: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/47.jpg)
2-47
Example Problem No. 2 (2 of 3)
Maximize Z = 4x1 + 5x2
subject to: x1 + 2x2 10 6x1 + 6x2 36 x1 4 x1, x2 0
Step 2: Determine the feasible solution space
Figure 2.24 Feasible Solution Space and Extreme Points
![Page 48: Linear programming - Model formulation, Graphical Method](https://reader035.vdocuments.net/reader035/viewer/2022081417/555653c0d8b42aa41e8b4e45/html5/thumbnails/48.jpg)
2-48
Example Problem No. 2 (3 of 3)
Maximize Z = 4x1 + 5x2
subject to: x1 + 2x2 10 6x1 + 6x2 36 x1 4 x1, x2 0
Step 3 and 4: Determine the solution points and optimal solution
Figure 2.25 Optimal Solution Point