Linear

LinearProgramming
Programming(LP)
(LP)

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
1
 Why
WhyTalk
TalkAbout
AboutLinear
LinearProgramming?
Programming?

• LP is simpler than NLP, hence, good for a foundation

• Linearity has some unique features for optimization

• A lot of problems are or can be converted to a LP

formulation

• Some NLP algorithms are based upon LP simplex method

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
2
 Bolted
BoltedJoint
Joint Design
Design

Given
At - tensile strength area, function of d
Db - bolt circle diameter
Pt - total load Question:
Question:
C - joint constant Is
Is this
this aa linear
linear or
or
Fi - preload (= 0.75 Sp At) nonlinear model?
nonlinear model?
Find
N - number of bolts, Sp - proof strength, d - diameter
Satisfy
3d   Db / N good wrench rule
 Db / N  6d good seal rule
C Pt / N  Sp At - Fi static loading constraint
Fi  (1 - C) Pt / N joint separation constraint
Minimize Z= [ f1(N, d, Sp), f2(N, d, Sp), ..]
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
3
 Bolted
BoltedJoint
JointDesign
Design(2)
(2)
Given
d - diameter
At - tensile strength area, function of d
Db - bolt circle diameter
Pt - total load Question:
Question:
C - joint constant Is
Is this
this aa linear
linear or
or
Fi - preload (= 0.75 Sp At) nonlinear problem?
nonlinear problem?
Find
N - number of bolts, Sp - proof strength
Satisfy
3d   Db / N good wrench rule
 Db / N  6d good seal rule
C Pt / N  Sp At - Fi static loading constraint
Fi  (1 - C) Pt / N joint separation constraint
Minimize Z= [ f1(N, Sp), f2(N, Sp), ..] G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
4
 Historical
HistoricalPerspective
Perspective

1928 – John von Neumann published related central theorem of game

theory
1944 – Von Neumann and Morgenstern published Theory of Games and
Economic Behavior
1936 – W.W. Leontief published "Quantitative Input and Output
Relations in the Economic Systems of the US" which was a linear
model without objective function.
1939 – Kantoravich (Russia) actually formulated and solved a LP
problem
1941 – Hitchcock poses transportation problem (special LP)
WWII – Allied forces formulate and solve several LP problems related to
military

A breakthrough occurred in 1947...

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
5
 SCOOP
SCOOP

• US Air Force wanted to investigate the feasibility of applying

mathematical techniques to military budgeting and planning.
• George Dantzig had proposed that interrelations between activities of
a large organization can be viewed as a LP model and that the optimal
program (solution) can be obtained by minimizing a (single) linear
objective function.
• Air Force initiated project SCOOP (Scientific Computing of Optimum
Programs)

NOTE:
SCOOP began in June 1947 and at the end of the same summer, Dantzig
and associates had developed:
1) An initial mathematical model of the general linear programming
problem.
2) A general method of solution called the simplex method.
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
6
 Simplex
SimplexToday
Today

• A large variety of Simplex-based algorithms exist to solve

LP problems.
• Other (polynomial time) algorithms have been developed
for solving LP problems:
– Khachian algorithm (1979)
– Kamarkar algorithm (AT&T Bell Labs, mid 80s)
– See Section 4.10

BUT,
none of these algorithms have been able to beat Simplex in
actual practical applications.

HENCE,
Simplex (in its various forms) is and will most likely remain
the most dominant LP algorithm for at least the near future
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
7
 Fundamental
FundamentalTheorem
Theorem

Extreme
Extremepointpoint(or
(orSimplex
Simplexfilter)
filter) theorem:
theorem:
IfIf the
the maximum
maximum or or minimum
minimum value value ofof aa
linear
linear function
function defined
defined over
over aa polygonal
polygonal
convex
convex region
region exists,
exists, then
thenitit is
is to
to be
be found
found
at
at the
theboundary
boundaryof ofthe
theregion.
region.

Convex
Convexset:
set:
AAset
set(or
(orregion)
region)isisconvex
convexif,if,for
forany
anytwo
twopoints
points(say,
(say,x1
x1
and x2) in that set, the line segment joining these points
and x2) in that set, the line segment joining these points
lies
liesentirely
entirelywithin
withinthe
theset.
set.
AApoint
pointisisby
bydefinition
definitionconvex.
convex.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
8
 What
What does
doesthe
theextreme
extremepoint
pointtheorem
theorem imply?
imply?

• A finite number of extreme points implies a finite number

of solutions!

• Hence, search is reduced to a finite set of points

• However, a finite set can still be too large for practical

purposes

• Simplex method provides an efficient systematic search

guaranteed to converge in a finite number of steps.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
9
 Basic
BasicSteps
Stepsof
of Simplex
Simplex
1. Begin the search at an extreme point (i.e., a basic feasible
solution).

2. Determine if the movement to an adjacent extreme can

improve on the optimization of the objective function. If not,
the current solution is optimal. If, however, improvement is
possible, then proceed to the next step.

3. Move to the adjacent extreme point which offers (or,

perhaps, appears to offer) the most improvement in the
objective function.

4. Continue steps 2 and 3 until the optimal solution is found or it

can be shown that the problem is either unbounded or
infeasible.
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
10
 Step
Step 00––Obtain
ObtainCanonical
Canonical Form
Form

IMPORTANT: Simplex only deals with equalities

General Simplex LP model:
min (or max) z =  ci xi
s.t.
Ax=b
x0
In order to get and maintain this form, use
• slack, if x  b, then x + slack = b
• surplus, if x  b, then x - surplus = b
• artificial variables (sometimes need to be added to ensure all
variables  0, see page 101)

Compare
Compare constraint
constraint conversion
conversion with
with goal
goal
conversions
conversionsusing
usingdeviation
deviationvariables
variables
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
11
 Different
Different "components"
"components" of
of aaLP
LPmodel
model

• LP model can always be split into a basic and a non-

basic part.

• “Transformed” or “reduced” model is another good way

to show this.

• This can be represented in mathematical terms as well

as in a LP or simplex tableau.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
12
 Movement
Movement to
toAdjacent
Adjacent Extreme
ExtremePoint
Point

Given any basis we move to an adjacent extreme point

(another basic feasible solution) of the solution space by
exchanging one of the columns that is in the basis for a
column that is not in the basis.

Two things to determine:

1) which (nonbasic) column of A should be brought into
the basis so that the solution improves?
2) which column can be removed from the basis such that
the solution stays feasible?

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
13
 Entering
Enteringand
andDeparting
DepartingVector
Vector(Variable)
(Variable)Rules
Rules

General rules:

• The one non-basic variable to come in is the one which

provides the highest reduction in the objective function.

• The one basic variable to leave is the one which is

expected to go infeasible first.

NOTE: THESE ARE HEURISTICS!!

Variations on these rules exist, but are rare.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
14
 Simplex
SimplexVariations
Variations

Various variations on the simplex method exist:

• "regular" simplex (see Section 4.4)
• two-phase method: Phase I for feasibility and Phase II
for optimality (see Section 4.5.1)
• condensed/reduced/revised method: only use the non-
basic columns to work with (see Section 4.6)
• (revised) dual simplex (see Section 4.8), etc.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
15
 Computational
ComputationalConsiderations
Considerations

• Unrestricted variables (unboundedness)

• Redundancy (linear dependency, modeling errors)

• Degeneracy (some basic variables = 0)

• Round-off errors

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
16
 Limitations
Limitationsof
ofSimplex
Simplex

1. Inability to deal with multiple objectives

2. Inability to handle problems with integer variables

Problem 1 is solved using Multiplex

Problem 2 has resulted in:

• Cutting plane algorithms (Gomory, 1958)
• Branch and Bound (Land and Doig, 1960)

However,
solution methods to LP problems with integer or Boolean
variables are still far less efficient than those which include
continuous variables only

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
17
 Example
ExampleProblem
Problem

Maximize Z = 5x1 + 2x2 + x3

subject to

x1 + 3x2 - x3 ≤ 6,

x2 + x3 ≤ 4,

3x1 + x2 ≤ 7,

x1, x2, x3 ≥ 0.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
18
 Simplex
Simplexand
andExample
ExampleProblem
Problem

Step 1. Convert to Standard Form

a11 x1 + a12 x2 + ••• + a1n xn ≤ b1, a11 x1 + a12 x2 + ••• + a1n xn + xn+1 = b1,

a21 x1 + a22 x2 + ••• + a2n xn ≥ b2, a21 x1 + a22 x2 + ••• + a2n xn - xn+2 = b2,

am1 x1 + am2 x2 + ••• + amn xn ≤ bm, am1 x1 + am2 x2 + ••• + amn xn + xn+k = bm,
In our example problem:

x1 + 3x2 - x3 ≤ 6, x1 + 3x2 - x3 + x4 = 6,

x2 + x3 ≤ 4, x2 + x 3 + x5 = 4,

3x1 + x2 ≤ 7, 3x1 + x2 + x6 = 7,

x1, x2, x3 ≥ 0. x1, x2, x3, x4, x5, x6 ≥ 0.

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
19
 Simplex:
Simplex: Step
Step22
Step 2. Start with an initial basic feasible solution (b.f.s.) and set up the
initial tableau.
In our example
Maximize Z = 5x1 + 2x2 + x3

x1 + 3x2 - x3 + x4 = 6,

x 2 + x3 + x5 = 4,

3x1 + x2 + x6 = 7,
c
BBas
i
s c
j Co
n
st
an
ts
x1, x2, x3, x4, x5, x6 ≥ 0. 521 000
x1x
2x
3x4x
5x
6
0x 41 3-
1 100 6
0x 50 11 010 4
0x 63 10 001 7
cr
o
w 521 000Z=0
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
20
 Step
Step2:
2:Explanation
Explanation
Adjacent Basic Feasible Solution
If we bring a nonbasic variable xs into the basis, our system changes from
the basis, xb, to the following (same notation as the book):
x1 + ā1sxs= b1 x = b a for i =1, …, m i i is
xr + ā rsxr= b r xs = 1
xj = 0 for j=m+1, ..., n and js
xm + āmsxs= bs
The new value of the objective function becomes:
m
Z  c (b  a
i 1
i i is )  c s

Thus the change in the value of Z per unit increase in xs is

cs = new
m
value of Z - old mvalue of Z
=  c (b  a
i 1
i
m
i is )  c s  c b
i 1
i i
This is the Inner Product rule
= c  c a
s i is
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
i 1
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
21
 Simplex:
Simplex: Step
Step33

Use the inner product rule to find the relative profit coefficients

c
BBas
i
s c
j Co
n
st
an
ts
521 000
x1x
2x
3x4x
5x
6
0x 41 3-
1 100 6
0x 50 11 010 4
0x 63 10 001 7
cr
o
w 521 000Z=0

c j  c j  cB Pj
c1 = 5 - 0(1) - 0(0) - 0(3) = 5 -> largest positive
c2 = ….
c3 = ….
Step 4: Is this an optimal basic feasible solution?
G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
22
 Simplex:
Simplex: Step
Step55

Apply the minimum ratio rule to determine the basic variable to leave the basis.

The new values of the basis variables:

xi = b i  a is x s for i = 1, ..., m

 bi 
max x s  min  
a is  0 a is
 
In our example:

Row Basic Variable Ratio

1 x4 6
2 x5 -
3 x6 7/3

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
23
 Simplex:
Simplex: Step
Step66

Perform the pivot operation to get the new tableau and the b.f.s.

New iteration:
find entering
variable:
c j  c j  c B Pj

cB = (0 0 5)
c2 = 2 - (0) 8/3 - (0) 1 - (5) 1/3 = 1/3
c3 = 1 - (0) (-1) - (0) 1 - (5) 0 = 1
c6 = 0 - (0) 0 - (0) 0 - (5) 1/3 = -5/3 G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
24
 Final
FinalTableau
Tableau

x3 enters basis,
x5 leaves basis

Wrong value!
4 should be 11/3

G
e
o
r
gi
a
In
st
i
t
ut
eo
fT
ec
h
n
ol
o
gy
Optimization in Engineering Design
S
y
s
t
e
msR
ea
l
i
za
ti
o
nLa
b
o
r
at
or
y
25