Professional Documents
Culture Documents
(TIN 4109)
Lecture 3
LINEAR PROGRAMMING
Lecture 3
Outline:
Graphical Method
Mathematical Modeling
References:
Frederick Hillier and Gerald J. Lieberman. Introduction
to Operations Research. 7th ed. The McGraw-Hill
Companies, Inc, 2001.
Hamdy A. Taha. Operations Research: An Introduction.
8th Edition. Prentice-Hall, Inc, 2007.
Graphical LP Solution
Example: The
Graphical LP Solution
Example: The
Technological input
Graphical LP Solution
Example: The
Decisions variables:
X1 = Weekly production level of Space Rays (in dozens)
X2 = Weekly production level of Zappers (in dozens)
Objective Function:
Weekly profit, to be maximized
Max 8X1 + 5X2
subject to
2X1 + 1X2 1000
3X1 + 4X2 2400
X1 + X2 700
X1 - X2 350
Xj> = 0, j = 1,2
(Weekly profit)
(Plastic)
(Production Time)
(Total production)
(Mix)
(Nonnegativity)
700
500
Production
Time
3X1+4X22400
Infeasible
Production mix
constraint:
X1-X2 350
Feasible
500
Interior points.
X1
700
Boundary points.
Extreme points.
coefficients.
Infeasible Model
No point, simultaneously,
lies both above line 1 and
below lines 2 and 3
.
Unbounded
solution
12
13
Latihan Soal
A company produces two products, A and B.
The sales volume for A is at least 80% of the
total sales of both A and B. However, the
company cannot sell more than 100 unit of A
per day. Both products use one raw material
whose maximum daily availability is limited to
240 lb a day. The usage rates of the raw
material are 2 lb per unit of A and 4 lb per unit
of B. The unit prices for A and B are $20 and
$50, respectively.
200
150
2x1+4x2 = 240
Z = 20x1 + 50x2 = $6000
120
100
-0.2x1+0.8x2 = 0
(x1 = 100, x2 = 35; z = 2175)
50
25
50
100
150
200 240
X1
Beer
Ice cream
Minimum
Weekly Requirement
________________________________________________________
I
2 mg/oz
3 mg/oz
3500 mg
II
6 mg/oz
2 mg/oz
7000 mg
________________________________________________________
cost/oz
10 cents
4.5 cents
X, Y 0
6x + 2y = 7000
3000
Z = 10x + 4.5y = 18000 cents
2000
(x = 1000, y = 500; z = 122.50)
1000
2x + 3y = 3500
1000
2000
3000
Z=2000 150
100
50
0
A
Optimal solution
( x = 60, y = 40)
50 B
100
150
200
z = 50x + 20y
150
x 60
100
D(40, 80)
2 x 4 y 400 (constraint 1)
50
(constraint 3 )
50 B
100
150
200
x 60
150
(constraint 3 )
100
D
50
100x 50 y 8000
H
C
H(60, 280)
50 B
100
150
200
(constraint 2)
Lecture 4 - Preparation
Read and Practice:
Hamdy A. Taha. Operations Research: An
Introduction. 8th Edition. Prentice-Hall, Inc, 2007.
Chapter 3.