Examples of Minimization Problems

Finding Optimal Solution

using Graphical method
 Introduction
 Many management decisions involve trying to
make the most effective use of limited resources
 Machinery, labor, money, time, warehouse space, raw
materials
 Linear programming (LP) is a widely used
mathematical modeling technique designed to
help managers in planning and decision making
relative to resource allocation
 Belongs to the broader field of mathematical
programming
 In this sense, programming refers to modeling and
solving a problem mathematically

© 2009 Prentice-Hall, Inc. 7–2

 Requirements of a Linear
Programming Problem
 LP has been applied in many areas over the past
years
 All LP problems have 4 properties in common
1. All problems seek to maximize or minimize some
quantity (the objective function)
2. The presence of restrictions or constraints that limit the
degree to which we can pursue our objective
3. There must be alternative courses of action to choose
from
4. The objective and constraints in problems must be
expressed in terms of linear equations or inequalities

© 2009 Prentice-Hall, Inc. 7–3

 Basic Assumptions of LP
 We assume conditions of certainty exist and
numbers in the objective and constraints are
known with certainty and do not change during
the period being studied
 We assume proportionality exists in the objective
and constraints
 We assume additivity in that the total of all
activities equals the sum of the individual
activities
 We assume divisibility in that solutions need not
be whole numbers
 All answers or variables are nonnegative

© 2009 Prentice-Hall, Inc. 7–4

 Formulating LP Problems
 Formulating a linear program involves developing a
mathematical model to represent the managerial
problem
 The steps in formulating a linear program are
1. Completely understand the managerial problem
being faced
2. Identify the objective and constraints
3. Define the decision variables
4. Use the decision variables to write mathematical
expressions for the objective function and the
constraints

© 2009 Prentice-Hall, Inc. 7–5

 Formulating LP Problems
 One of the most common LP applications is the
product mix problem
 Two or more products are produced using limited
resources such as personnel, machines, and raw
materials
 The cost that the firm seeks to minimize is based on
the cost of production per unit of each product
 The company would like to determine how many
units of each product it should produce to minimize
cost and maximize overall profit given its limited
resources

© 2009 Prentice-Hall, Inc. 7–6

 Graphical Solution to an LP Problem

 The easiest way to solve small LP problems is with

the graphical solution approach
 The graphical method only works when there are just
two decision variables
 When there are more than two variables, a more
complex approach is needed as it is not possible to
plot the solution on a two-dimensional graph
 The graphical method provides valuable insight into
how other approaches work

© 2009 Prentice-Hall, Inc. 7–7

 Solving Minimization Problems

 Many LP problems involve minimizing an objective such as

cost instead of maximizing a profit function
 Minimization problems can be solved graphically by first
setting up the feasible solution region to find the values of
the decision variables (e.g., X1 and X2) that yield the
minimum cost

© 2009 Prentice-Hall, Inc. 7–8

Solving Linear Programming Problems

Find the feasibility region and the vertices of the following:

1. 3x + 4y ≥ 12 2. 2x + y ≥ 4
x≤3 6x + 10y ≤ 30
y≥2 x≥2
x ,y ≥ 0 x, y ≥ 0
Solving Linear Programming Problems

Finding the feasibility region

and the vertices:
Example 1 3x + 4y ≥ 12
x≤3
y≥2
x ,y ≥ 0
Converting inequality to equality Vertices At vertex B:
3x + 4y = 12 3x + 4y = 12 eq.1
Intercepts: (0,3) and (4,0) A: (0 , 3)
Y = 2 eq. 2
x=3 B: (4/3 , 2) Thus, 3x + 4(2) = 12
y=2
C: (3 , 2) 3x + 8 = 12
3x = 12-8 ; x = 4/3
Solving Linear Programming Problems
Finding the feasibility region and the vertices:

Example 2 2x + y ≥ 4
6x + 10y ≤ 30
x≥2
x, y
≥0
2x + y = 4 Vertices At vertex C:
6x + 10y = 30
Intercepts: (0,4) and (2,0) A: (0 , 2) x=2
6x + 10y = 30 B: (5 , 0 ) Thus, 6(2) + 4Y = 30
Intercepts: (0,3) and (5,0) C: (4.5, 2)
12 + 4Y = 30
x=2 4Y = 30-12 ;
Y = 18/4=4 ½
Solving Linear Programming Problems

A.
Solve the following linear program using the graphical method. Find
the feasible region. Always solve for the coordinates at the
intersection of lines, which are parts of the feasible region.

1. Minimize: 30x + 50y 2. Minimize: 80x + 60y

3x + 4y ≥ 12 s.t 2x + 6y ≥ 18
4x + 2y ≤ 20 6x + 3y ≤ 24
x≤4 x+y≥4
y ≥6 x,y ≥ 0
x ,y ≥ 0
 Solving Linear Programming Problems
Vertices Min: 80x + 60y
(1.5, 2.5) 80(1.5) + 60(2.5) =
270
(3,2) 80(3) + 60(2) = 360
(0,4) 80(0) + 60(4) = 240
(0,8) 80(0) + 60(8) = 480
Finding the intersection:
X + Y = 4 and 2x + 6y = 18 Finding the intersection:
2x + 6y = 18 6X + 3Y = 24 and 2x + 6y = 18
( x + y = 4) -2 (2x + 6y = 18)
2x + 6y= 18 (6x+ 3y = 24) -2
-2x - 2y = -8 2x + 6y= 18 Optimal solution: (0,4)
0 + 4y = 10 -12x - 6y = -48 Minimum value = 240
y = 10/4 -10x + 0 = -30 x = -30/-10
y = 2.5 x= 3
X + 2.5 = 4 6(3) + 3y = 24 ; 18 + 3y = 24
X = 4 – 2.5 = 1.5 ;
3y = 24 – 18 ; 3y =6 ; y = 6/3 = 2; (3,2)
(1.5, 2.5)
 Solving Linear Programming Problems

Finding the feasibility region and

the feasible solution:
Example 2 Minimize: 80x + 60y
subject to: 2x+ 6y ≥ 18
6x + 3y ≤ 24 Converting Intercepts
inequality to
x+ equality
y≥4 2x + 6y = 18 (0,3) and (9,0)
x ,y ≥ 0 6x + 3y = 24 (0,8) and (4,0)
x+y=4 (0,4) and (4,0)
Solving Linear Programming Problems

Vertices Min: 30x + 50y

(0,6) 30(0) + 50(6) = 300
(0,10) 30(0) + 50(10) = 500
(2,6) 30(2) + 50(6) = 360
Finding the intersection:
Y =6 and 4x + 2y = 20
4x + 2(6) = 20
4x + 12 = 20
x = 8/4 =
2

Optimal solution: (0,6)

Minimum value = 300
Formulating the Linear Program
Formulate the linear program on the following problems:

Illustrative Example 1
The Queen City Construction Company needs to rest some special
trucks which will haul 20 standard loads of dirt per day, or it can rent a
medium duty model truck which will have 15 standard loads per day.
The heavy-duty model costs P1,800 a day to rent while the medium-
duty model costs P1,600 a day. To operate the heavy-duty model,
however, it is necessary to hold a proficiency skill level, and Queen City
has only four truck drivers who have the necessary skill level. If Queen
City needs sufficient capacity to have a total of 155 standard loads of
dirt per day, determine the number of each truck drive that it should
rent to minimize its costs.
Formulating the Linear Program

Formulating the linear program of the Queen City

Construction Company

Objective function:
Minimize Z = 1,800X + 1,600Y where: x is the heavy-duty model truck
y is the medium-duty model truck
s.t. constraints:
per truck capacity X+ Y ≥ 20 loads per day
drive skill requirement X ≥ 4 drivers
truck drives X+15Y = 155 daily standard
Implicit Constraintloads of dirt
X, Y ≥ 0
 Formulating the Linear Program

Formulate the linear program on the following problems:

Illustrative Example 2
A poultry farmer must supplement the vitamins in the feed he buys. He is
considering two supplements, each of which contains the feed required
but in different amounts. He must meet or exceed the minimum vitamin
requirements. The vitamin content per gram of the supplements is given
in the following table.

Supplement I costs ₱5 per gram and Supplement II costs ₱6 per gram. The feed
must contain at least 50 units of vitamin 1, 100 units of vitamin 2, 60 units of
vitamin 3, and 180 units of vitamin 4. Determine the combination that has the
minimum cost.
 Formulating the Linear Program

Formulating the linear program of the Poultry Farmer

Objective function:
Minimize Z = 5X + 6Y where: x is a supplement
y is a supplement II
s.t. constraints:
Vit 1 5x + 25y ≥ 50 units
Vit 2 25x + 10y ≥ 100 units
Vit 3 10x + 10y ≥ 60 units
Vit 4 36x + 20y ≥ 180 units
Implicit Constraint: x, y ≥
0
 Holiday Meal Turkey Ranch
 The Holiday Meal Turkey Ranch is considering
buying two different brands of turkey feed and
blending them to provide a good, low-cost diet for
its turkeys
Let
X1 = number of pounds of brand 1 feed purchased
X2 = number of pounds of brand 2 feed purchased
Minimize cost (in cents) = 2X1 + 3X2
subject to:
5X1 + 10X2 ≥ 90 ounces (ingredient constraint A)
4X1 + 3X2 ≥ 48 ounces (ingredient constraint B)
0.5X1 ≥ 1.5 ounces (ingredient constraint C)
X1 ≥ 0 (non-negativity constraint)
X2 ≥ 0 (non-negativity constraint)
© 2009 Prentice-Hall, Inc. 7 – 20
 Holiday Meal Turkey Ranch
 Holiday Meal Turkey Ranch data

COMPOSITION OF EACH POUND

OF FEED (OZ.)
MINIMUM MONTHLY
REQUIREMENT PER
INGREDIENT BRAND 1 FEED BRAND 2 FEED TURKEY (OZ.)
A 5.0 10 90.0
B 4.0 3 48.0
C 0.5 0 1.5
Cost per pound 2 cents 3 cents

© 2009 Prentice-Hall, Inc. 7 – 21

 Holiday Meal Turkey Ranch
 Using the corner X2

point method –

 First we construct
the feasible 20 – Ingredient C Constraint

Pounds of Brand 2
solution region
 The optimal 15 – Feasible Region
solution will lie at a
on of the corners 10 –
as it would in a Ingredient B Constraint
maximization 5– Ingredient A Constraint
b
problem
| | | | c | |
0–
5 10 15 20 25 X1
Figure 1 Pounds of Brand 1
© 2009 Prentice-Hall, Inc. 7 – 22
 Holiday Meal Turkey Ranch
 We solve for the values of the three corner points
 Point a is the intersection of ingredient constraints
C and B
4X1 + 3X2 = 48
X1 = 3
 Substituting 3 in the first equation, we find X2 = 12
 Solving for point b with basic algebra we find X1 =
8.4 and X2 = 4.8
 Solving for point c we find X1 = 18 and X2 = 0

© 2009 Prentice-Hall, Inc. 7 – 23

 Holiday Meal Turkey Ranch
4(5x1+10x2=90)= 20x1+40x2=360
5(4x1+3x2=48)= - (20x1+15x2=240)
25x2=120
x2=4.8
5x1 + 10(4.8)=90
5x1 +48=90
5x1=90-48
5x1=42
x1= 42/5
x1=8.4

© 2009 Prentice-Hall, Inc. 7 – 24

 Holiday Meal Turkey Ranch
 Substituting these value back into the objective
function we find

Cost = 2X1 + 3X2

Cost at point a = 2(3) + 3(12) = 42
Cost at point b = 2(8.4) + 3(4.8) = 31.2
Cost at point c = 2(18) + 3(0) = 36

 The lowest cost solution is to purchase 8.4

pounds of brand 1 feed and 4.8 pounds of brand 2
feed for a total cost of 31.2 cents per turkey

© 2009 Prentice-Hall, Inc. 7 – 25