Professional Documents
Culture Documents
Engineers and managers are constantly attempting to optimize, particularly in the design, analysis, and operation of complex systems. The course seeks to:
Formulating linear programs Applications of linear programming Linear algebra Simplex algorithm Duality theory Sensitivity analysis Integer programming: Applications and algorithms
Network Optimization
Shortest path problem Minimum spanning tree problem Maximum flow problem Minimum cost flow problem
Text Books:
M.S. Bazaraa, J. J. Jarvis, and H.D. Sherali, Linear Programming Winston, Wayne L., Operations Research : Applications and
Algoritms, Fourth Edition, Thomson, 2004
2
Tugas: 20% Quiz: 30% Midterm Exam: 25% Final Exam: 25%
Regrading
If I have made a mistake in grading something, I will be happy
to correct it.
In order to receive a re-grade, you must contact/email me
the entire test. So it is possible to lose additional points. Therefore, it is strongly recommended that you do not ask for regrading unless you have substantial reason to believe that I made a mistake when originally grading the test.
OR Definition
Scientific approach to solve decision making problem for finding the best system design and operation, with limited resources (can also be defined as Management Science)
Characteristics of OR
2. 3. 4. 5. 6.
N
C O N T R O L
Management Problems
Mathematic Model
Solution
IMPLEMENTATION
Observation
SYSTEM
Data Collection
TI091306/OR1/sew/2012 /#1
CONTENTS
subject to a11x1 + a12x2 + a13x3 + . + a1nxn b1 a21x1 + a22x2 + a23x3 + . + a2nxn b2 : : am1x1 + am2x2 + am3x3 + . + amnxn bm or, x1, x2, x3 , ., xn 0
Minimize subject to
j=1, n cjxj
for all i = 1, , m
xj 0 for all j =1, , n+m Note:- xn+i is the slack variable corresponding to ith equation.
9
Matrix Notation
Minimize cx subject to
Ax = b x0 where
c1 x1 x2 : : xn Xn+1 : : Xn+m
a11 a21
.. ..
1 1 : : 1
b1 b2
c2 : : cn 0 : : 0
A=
: : am1
b=
: : bm
c=
x=
10
Features of a Linear Programming (LP) Problem Decision Variables We minimize (or maximize) a linear function of decision
variables, called objective function.
The decision variables must satisfy a set of constraints. Decision variables have sign restrictions.
11
Constraints:
100 finishing hour per week available 80 carpentry hours per week available produce no more than 40 soldiers per week
An Example of a LP (cont.)
Linear Programming formulation:
(Obj. Func.)
(Finishing constraint) (Carpentry constraint) (Bound on soldiers) (Sign restriction) (Sign restriction)
13
Additivity Assumptions
Contributions of variables are independent.
Divisibility Assumption
Decision variables can take fractional values.
Certainty Assumption
Each parameter is known with certainty.
14
15
Capital Budgeting Problem Five different investment opportunities are available for
investment.
16
subject to
11x1 + 53x2 + 5x3 + 5x4 + 29x5 3x1 + 6x2 + 5x3 + x4 + 34x5 x1 x2 x3 x4 40 20 1 1 1 1 x5 1 x 1, x 2, x 3, x 4, x 5 0
17
Transportation Problem The Brazilian coffee company processes coffee beans into
coffee at m plants. The production capacity at plant i is ai.
The unit shipping cost from plant i to warehouse j is cij. It is desired to find the production-shipping pattern xij from
plant i to warehouse j, i = 1, .. , m, j = 1, , n, that minimizes the overall shipping cost.
18
Minimize z = subject to
i=1j=1 n
cijxij
j=1
xij
m
= ai, i = 1, , m bj, j = 1, , n
i=1
xij
xij 0, i = 1, , m, j = 1, , n
19
Static Workforce Scheduling Number of full time employees on different days of the week
are given below.
17 13 15 19 14 16 11
10
21
A B C D E
0 -1 0 -1 -1 0
1 + 0.5 -1 + 1.2 0 0
2 +1 + 0.5 0 0 -1
3 0 +1 0 + 1.9 + 1.5
22
11
Multi-Period Workforce Scheduling Requirement of skilled repair time (in hours) is given below. At the beginning of the period, 50 skilled technicians are
available.
Each month 5% of the technicians leave. A new technician needs one month of training, is paid
$1,000 per month, and requires 50 hours of supervision of a trained technician.
23
subject to
A + C + D + S0 = 100,000 0.5A + 1.2C + 1.08S0 = B + S1 A + 0.5B + 1.08S1 = E + S2 A 75,000 B 75,000 C 75,000 D 75,000 E 75,000 A, B, C, D, E, S0, S1, S2 0
24
12
y1 = 50 + x1 = y2 + x2 = y3 + x3 = y4 + x4 = y5
xt, yt 0, t = 1, 2, 3, , 5
25
i=1,n xi
i=1,n aij xi bi
xi 0 xi integer
i = 1, , m j = 1, , n j = 1, , n
26
13
Feasible Region
Feasible Region: Set of all points satisfying all the constraints and all the sign restrictions
Example 1
14
Example 2
Maximize z = 3x1+ 2x2 subject to 1/40x1 + 1/60x2 1/50x1 + 1/50x2 x1 30 x2 20 x1, x2 0 1 1
Example 3
Max. z = 3x1+ 2x2 subject to 1/40 x1 1/50 x1 x 1, x 2 0 + 1/60x2 1 + 1/50x2 1
15
31
Cutting Stock Problem (contd.) Given a standard sheet of length l, there are many ways of
cutting it. Each such way is called a cutting pattern.
32
16