Documente Academic
Documente Profesional
Documente Cultură
Linear Programming
Objecti
ve
Increase a certain
Reduce certain value
value
Maximize Reduce
Minimize
Maximize Return Advertising cost on
Cost
Campaign inventory
1) Maximization Problem
Problem identification:
- A toy company produces two types of toy models (model 1)
and (model 2). The company has 900 hours of production time
available in its producing department, 300 hours in its
finishing department and 100 hours in its packing and
shipping department.
- The production time of model 1 is 1 hour while that for model
2 is 3/2 hours.
- The finishing time required for model 1 is 1/2 hours and for
model 2 is 1/3 hours.
- Finally, the packing and shipping department requires 1/8
hours for model 1 and 1/4 hours for model 2.
- The company estimated the profit of contribution of models 1
and 2 to be $5 and $8 per toy respectively.
- Formulate problem as linear program and solve it for an
optimal solution.
1) Table Format
Productio Finishing Packing Profit
n
Prof. Maged Morcos
Quantitative Analysis lecture 2 Date: 17/1/2017
2) Free Format
Max P=5 x+8 y
-
- Subject to the following constraints:
C 1 : X +3 2 Y 900hrs
C 2 :1 2 X +1 8 Y 300 hrs
1 1
C 3 : X + Y 100hrs
8 4
C4 :X ,Y 0
Notes:
3) Standard Format
- Max P = 5X + 8Y + 0 S1 + 0 S2 + 0 S3
Optimal Solution:
- 5(500) + 8(150) = 3700$
- Will every point give me the 3700?
It depends on the slope of the objective function, which is the
relation between the X and Y contribution.
Homework:
1) P = 15X + 8Y
2) P = 5X + 18Y
2) Minimization Problem
Problem identification:
- A company produces two types of products (product 1) and
(product 2). The company management estimated that
combined production of both products must total to at least 4
units per hour.
- They also estimated that the processing units of product 1
take about 1 hour while that of product 2 takes about 3 hours.
- The minimum number of hours to be worked in a shift is 6
hours.
- The company estimated the cost of production of both
products to be $3 and $4 per unit respectively.
- Formulate problem as linear program and solve it for an
optimal solution.
1) Table Format
Producti Processin Cost
on g
X 1 1 3
Y 1 3 4
Capacity 4 units 6 Hrs
2) Free Format
MinC=3 x +4 y
-
- Subject to the following constraints:
Prof. Maged Morcos
Quantitative Analysis lecture 2 Date: 17/1/2017
C 1 : X +Y 4
If X = 0, 0+Y = 4, Y = 4
If Y = 0, X + 0 = 4, X=4
C 2 : X +3 Y 6
If X = 0, 0+ (3Y) = 6, Y = 6*1/3 = 2
If Y=0, X + 0 = 6, X= 6
C3: X ,Y 0
3) Standard Format
- Min C = 3X + 4Y + 0 S1 + 0 S2
- Subject to the following constraints:
(You consider x=0 and use the y in free format to get the S or
consider y=0 and use x in free format to get the S)
C1: X+ Y - S1 = 4
then S1 = 0
C2: X + 3Y - S2 = 6
then S2 = 0
C3: X , Y, 0
Optimal Solution:
- 3(3) + 4(1) = 13$
Homework:
3) P = 15X + 8Y
4) P = 5X + 18Y