LP Graphical Solution

2-1
 Maximization Example

• 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

Labor Clay Profit

Product
(Hr./Unit) (Lb./Unit) ($/Unit)

Bowl 1 4 40
Mug 2 3 50
Resource 40 hrs of labor per day
Availability: 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 labor
Constraints: 4x1 + 3x2  120 pounds of clay

Non-Negativity x1  0; x2  0
Constraints:
A feasible solution does not violate any of the constraints:

Example: x1 = 5 bowls
x2 = 10 mugs
Z = $40x1 + $50x2 = $700

Labor constraint check: 1(5) + 2(10) = 25 < 40 hours

Clay constraint check: 4(5) + 3(10) = 50 < 120
pounds
Infeasible Solutions

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

• 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.
 X2 is mugs

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0

X1 is bowls
Labor Constraint

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Labor Constraint Area

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Clay Constraint Area

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Both Constraints

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Feasible Solution Area

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
 Extreme (Corner) Point Solutions

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Slack Variables

 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.
Linear Programming Model: Standard Form

Max Z = 40x1 + 50x2 + 0s1 + 0s2

subject to:1x1 + 2x2 + s1 = 40
4x1 + 3x2 + s2 = 120
x1, x2, s1, s2  0
Where:
x1 = number of bowls
x2 = number of mugs
s1, s2 are slack variables
LP Model Formulation – Minimization (1 of 8)

 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 ?
Chemical Contribution

Nitrogen Phosphate
Brand
(lb/ bag) (lb/ bag)
Super-gro 2 4
Crop-quick 4 3
LP Model Formulation – Minimization (3 of 8)

Decision Variables:
x1 = bags of Super-gro
x2 = 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)
Constraint Graph – Minimization (4 of 8)

Minimize Z = $6x1 + $3x2

subject to: 2x1 + 4x2  16
4x1 + 3x2  24
x1, x2  0
Feasible Region– Minimization (5 of 8)

Minimize Z = $6x1 + $3x2

subject to: 2x1 + 4x2  16
4x1 + 3x2  24
x1, x2  0
Optimal Solution Point – Minimization (6 of 8)

Minimize Z = $6x1 + $3x2

subject to: 2x1 + 4x2  16
4x1 + 3x2  24
x1, x2  0
Surplus Variables – Minimization (7 of 8)

 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)
Graphical Solutions – Minimization (8 of 8)

Minimize Z = $6x1 + $3x2 + 0s1 + 0s2

subject to: 2x1 + 4x2 – s1 = 16
4x1 + 3x2 – s2 = 24
x1, x2, s1, s2  0
Irregular Types of Linear Programming Problems

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
Multiple Optimal Solutions Beaver Creek Pottery

The objective function is

parallel to a constraint line.
Maximize Z=$40x1 + 30x2
subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Where:
x1 = number of bowls
x2 = number of mugs
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 , x 2  0
An Unbounded Problem

Value of the objective

function increases indefinitely:
Maximize Z = 4x1 + 2x2
subject to: x1  4
x2  2
x1 , x 2  0
Problem Statement

■ 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.
Solution

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
Solution

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, x 2  0
The Model: Minimize Z = $3x1 + 5x2
subject to: x1 + x2 = 1,000 lb
x1  500
x2  200
x1 - 2x2  0
Exercise

Solve the following model

graphically:
Maximize Z = 4x1 + 5x2
subject to: x1 + 2x2  10
6x1 + 6x2  36
x1  4
x1 , x 2  0

Step 1: Plot the constraints

as equations
Maximize Z = 4x1 + 5x2
subject to: x1 + 2x2  10
6x1 + 6x2  36
x1  4
x1 , x 2  0
Step 2: Determine the feasible
solution space
Maximize Z = 4x1 + 5x2
subject to: x1 + 2x2  10
6x1 + 6x2  36
x1  4
x1 , x 2  0
Step 3 and 4: Determine the
solution points and optimal
solution
Solve the following LPP using Graphical Method
1. Determine the amount of each product that maximize the total profit

Hours Required
to Produce 1 Unit

Product 1 Pproduct 2 Available Hours

Department (X1) (X2) per Week

A 4 3 240
B 2 1 100
Profit per unit $7 $5
2. Solve the following minimization problem
graphically

Minimize total cost = 2,500X1 + 3,000X2

Subject to:
X1 + X2
≥ 60
30 ≤ X1 ≤
50
20 ≤ X2 ≤
60
X1, X2 ≥ 0 non
negativity requirements
• Special types of problems include those with:
 Multiple optimal solutions
 Infeasible solutions
 Unbounded solutions
Multiple Optimal Solutions Beaver Creek Pottery

The objective function is

parallel to a constraint line.
Maximize Z=$40x1 + 30x2
subject to: 1x1 + 2x2  40
4x1 + 3x2  120
x1, x2  0
Where:
x1 = number of bowls
x2 = number of mugs
 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
 An Unbounded Problem

Value of the objective

function increases indefinitely:
Maximize Z = 4x1 + 2x2
subject to: x1  4
x2  2
x1, x2  0
Solve the ff LPPs graphically
1. Maximize Z = 5x1 + 4x2
Subject to x1 – 2x2 ≤ 1
x1 + 2x2 ≥ 3
x1, x2 ≥ 0
2. Maximize Z = 3x1 + 2x2
-2x1 + 3x2 ≤ 9
3x1 - 2x2 ≤ -20
x1, x2 ≥ 0
3. Maximize Z = 40x1 + 100x2
12x1 + 6x2 ≤ 3000
4x1 + 10x2 ≤ 2000
Copyright © 2010 Pearson Education, Inc.
39
2x + 3x Publishing
≤ 900as Prentice Hall