Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Practice Set 1
Ardavan Asef-Vaziri
June-2013
Problem Formulation
Decision Variables
x1 : volume of product 1
x2 : volume of product 2
x3 : volume of product 3
Objective Function
Max Z = 50 x1 +20 x2 +25
x3
Constraints
Resources
9 x1 +3 x2 +5 x3 500
5 x1 +4 x2 +
350
3 x1 +
+2 x3 150
Market
x3 20
LP-Formulation
Ardavan Asef-Vaziri
Nonnegativity
June-2013
Problem 2
An appliance manufacturer produces two models of
microwave ovens: H and W. Both models require
fabrication and assembly work: each H uses four
hours fabrication and two hours of assembly, and
each W uses two hours fabrication and six hours of
assembly. There are 600 fabrication hours this week
and 450 hours of assembly. Each H contributes $40
to profit, and each W contributes $30 to profit.
a) Formulate the problem as a Linear Programming
problem.
b) Solve it using excel.
c) What are the final values?
d) What is the optimal value of the objective function?
LP-Formulation
Ardavan Asef-Vaziri
June-2013
Problem Formulation
Decision Variables
xH : volume of microwave oven
type H
xW : volume of microwave oven
type W
Objective Function
Max Z = 40 xH +30 xW
Constraints
Resources
4 xH +2 xW 600
2 xH +6 xW 450
Nonnegativity
xH 0, xW 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
Problem 3
A small candy shop is preparing for the holyday season. The
owner must decide how many how many bags of deluxe mix
how many bags of standard mix of Peanut/Raisin Delite to
put up. The deluxe mix has 2/3 pound raisins and 1/3 pounds
peanuts, and the standard mix has 1/2 pound raisins and 1/2
pounds peanuts per bag. The shop has 90 pounds of raisins
and 60 pounds of peanuts to work with. Peanuts cost $0.60
per pounds and raisins cost $1.50 per pound. The deluxe mix
will sell for 2.90 per pound and the standard mix will sell for
2.55 per pound. The owner estimates that no more than 110
bags of one type can be sold.
a) Formulate the problem as a Linear Programming problem.
b) Solve it using excel.
c) What are the final values?
d) What is the optimal value of the objective function?
LP-Formulation
Ardavan Asef-Vaziri
June-2013
Problem Formulation
Decision Variables
x1 : volume of deluxe mix
x2 : volume of standard mix
Objective Function
Max Z = [2.9-0.60(1/3)-1.5(2/3)] x1 + [2.550.60(1/2)-1.5(1/2)] x2
Max Z = 1.7x1 + 1.5 x2
Constraints
Resources
(2/3) x1 +(1/2) x2 90
(1/3) x1 +(1/2) x2 60
Nonnegativity
LP-Formulation
x1 0, x2 0
Ardavan Asef-Vaziri
June-2013
Problem 4
The following table summarizes the key facts about two
products, A and B, and the resources, Q, R, and S,
required to produce them.
Resource Usage per Unit Produced
Resource
Product A
Product B
Amount of
resource
available
Profit/Uni
t
$3000
$2000
Problem Formulation
Decision Variables
xA : volume of product A
xB : volume of product B
Objective Function
Max Z = 3000 xA +2000 xB
Constraints
Resources
2 xA +1 xB 2
1 xA +2 xB 2
3 xA +3 xB 4
Nonnegativity
xA 0, xB 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
Problem 5
The Apex Television Company has to decide on the number of
27 and 20 sets to be produced at one of its factories.
Market research indicates that at most 40 of the 27 sets and
10 of the 20 sets can be sold per month. The maximum
number of work-hours available is 500 per month. A 27 set
requires 20 work-hours and a 20 set requires 10 work-hours.
Each 27 set sold produces a profit of $120 and each 20 set
produces a profit of $80. A wholesaler has agreed to purchase
all the television sets produced if the numbers do not exceed
the maximum indicated by the market research.
Ardavan Asef-Vaziri
June-2013
10
Problem Formulation
Decision Variables
x1 : number of 27 TVs
x2 : number of 20 TVs
Objective Function
Max Z = 120 x1 +80 x2
Constraints
Resources
20 x1 +10 x2 500
Market
x1
40
x2 10
Nonnegativity
x1 0, x2 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
11
Problem 6
Ralph Edmund has decided to go on a steady diet of only
streak and potatoes s (plus some liquids and vitamins
supplements). He wants to make sure that he eats the right
quantities of the two foods to satisfy some key nutritional
requirements. He has obtained the following nutritional and
cost information. Ralph wishes to determine the number of
daily servings (may be fractional of steak and potatoes that will
meet these requirements
atIngredient
a minimum
cost.
Grams of
per Serving
Ingredient
Steak
Potatoes
Carbohydrates
15
50
Protein
20
40
Fat
15
60
$4
$2
12
Problem Formulation
Decision Variables
x1 : serving of steak
x2 : serving of potato
Objective Function
Min Z = 4 x1 +2x2
Constraints
Resources
5 x1 +15 x2 50
20 x1 +5 x2 40
15 x1 +2 x2 60
Nonnegativity
x1 0, x2 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
13
Problem 7
A farmer has 10 acres to plant in wheat and rye. He has
to plant at least 7 acres. However, he has only $1200 to
spend and each acre of wheat costs $200 to plant and
each acre of rye costs $100 to plant. Moreover, the
farmer has to get the planting done in 12 hours and it
takes an hour to plant an acre of wheat and 2 hours to
plant an acre of rye. If the profit is $500 per acre of
wheat and $300 per acre of rye, how many acres of
each
be planted
to maximize profits?
State should
the decision
variables.
x = the number of acres of wheat to plant
y = the number of acres of rye to plant
Write the objective function.
Ardavan Asef-Vaziri
June-2013
14
Problem 7
Write the constraints.
x+y 10
(max acreage)
x+y 7
(min acreage)
200x + 100y 1200
(cost)
x + 2y 12
(time)
x 0, y 0
(non-negativity)
LP-Formulation
Ardavan Asef-Vaziri
June-2013
15
Problem 8
You are given the following linear programming model in
algebraic form, where, X1 and X2 are the decision
variables and Z is the value of the overall measure of
performance.
Maximize Z = X1 +2 X2
Subject to
Constraints on resource 1: X1 + X2 5 (amount
available)
Constraints on resource 2: X1 + 3X2 9 (amount
available)
And
X1 , X2 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
16
Problem 8
Identify the objective function, the functional
constraints, and the non-negativity constraints in this
model.
Objective Function Maximize Z = X1 +2 X2
Functional constraints X1 + X2 5, X1 + 3X2 9
Is (X1 ,X2) = (3,1) a feasible solution?
3 + 1 5, 3 + 3(1) 9 yes; it satisfies both
constraints.
Is (X1 ,X2) = (1,3) a feasible solution?
1 + 3 5, 1 + 3(9) > 9 no; it violates the second
constraint.
LP-Formulation
Ardavan Asef-Vaziri
June-2013
17
Problem 9
You are given the following linear programming model in
algebraic form, where, X1 and X2 are the decision
variables and Z is the value of the overall measure of
performance.
Maximize Z = 3X1 +2 X2
Subject to
Constraints on resource 1: 3X1 + X2 9 (amount
available)
Constraints on resource 2: X1 + 2X2 8 (amount
available)
And
X1 , X2 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
18
Problem 9
Identify the objective function,
Maximize Z = 3X1 +2 X2
the functional constraints,
3X1 + X2 9 and X1 + 2X2 8
the non-negativity constraints
X1 , X2 0
Is (X1 ,X2) = (2,1) a feasible solution?
3(2) + 1 9 and 2 + 2(1) 8 yes; it satisfies both
constraints
Is (X1 ,X2) = (2,3) a feasible solution?
3(2) + 3 9 and 2 + 2(3) 8 yes; it satisfies both
constraints
Is (X1 ,X2) = (0,5) a feasible solution?
3(0) + 5 9 and 0 + 2(5) > 8 no; it violates the second
constraint
LP-Formulation
Ardavan Asef-Vaziri
June-2013
19
Ardavan Asef-Vaziri
June-2013
20
Ardavan Asef-Vaziri
June-2013
21
4 x1 + 7 x2
1200 hours
10 x1 + 35 x2 5000 pounds
x1 0, x2 0.
Ardavan Asef-Vaziri
June-2013
22
LP-Formulation
Ardavan Asef-Vaziri
June-2013
23
Model 3
3,000
2,000
900
1.5
Hours of harnessing/unit 1
Cost to Make
$50
$83
$130
Cost to Buy
$61
$97
$145
LP-Formulation
Ardavan Asef-Vaziri
June-2013
24
Minimizethetotalcostoffillingtheorder.
MIN: 50x1+83x2+130x3+61y1+97y2+145y3
LP-Formulation
Ardavan Asef-Vaziri
June-2013
25
LP-Formulation
Ardavan Asef-Vaziri
June-2013
26
LP-Formulation
Ardavan Asef-Vaziri
June-2013
27
28
Resource Constraints
2x1 + 1.5x2 + 3x3 <= 10,000 } wiring
1x1 + 2.0x2 + 1x3 <= 5,000 } harnessing
Demand Constraints
x1 <= 3,000 } model 1
x2 <= 2,000 } model 2
x3 <= 900
} model 3
Nonnegativity Conditions
x1, x2, x3 >= 0
LP-Formulation
Ardavan Asef-Vaziri
June-2013
29
y1 = 3,000x1
y2 = 2,000x2
Demand Constraints
MIN: 50x1 + 83x2 + 130x3
= 900x1 + y1 = 3,000 } model 1
+ y3
61(3,000x1)
x3
+ 97(2,000-x2)
x2 + y2 = 2,000 } model 2
+ 145(900-x3)
x3 + y3 = 900 } model 3
y1 = 3,000Resource Constraints
x1>=0
2x1 + 1.5x2 + 3x3 <= 10,000 }
y2 = 2,000wiring
x2>=0
x1 <= 3,000
1x1 + 2.0x2 + 1x3 <= 5,000 }
y3x2
= <=
9002,000
harnessing
x3>=0
x3 <= 900
Nonnegativity Conditions
LP-Formulation
Ardavan Asef-Vaziri
June-2013
30
LP-Formulation
Ardavan Asef-Vaziri
June-2013
31
x1
x2
x1 + x2 +
x1, x2, x3 0
LP-Formulation
10
x3
x3
15
Ardavan Asef-Vaziri
June-2013
32
Ardavan Asef-Vaziri
June-2013
33
LP-Formulation
Ardavan Asef-Vaziri
June-2013
34
Ardavan Asef-Vaziri
June-2013
35
LP-Formulation
Ardavan Asef-Vaziri
June-2013
36