Professional Documents
Culture Documents
LinearProgramming I PDF
LinearProgramming I PDF
Linear Programming
Shirish Shevade
Computer Science and Automation
Indian Institute of Science
Bangalore 560 012, India.
Cost:
c1 x1 + c2 x2 + . . . + cn xn
min c1 x1 + c2 x2 + . . . + cn xn
s.t. aj1 x1 + aj2 x2 + . . . + ajn xn bj j
xi 0 i
min cT x
s.t. Ax b
x0
Polyhedral Set
X = {x : Ax b, x 0}
min cT x
s.t. Ax = b
x0
aT x b, x 0
can be written as
aT x + y = b
x 0
y 0
aT x b, x 0
can be written as
aT x z = b
x 0
z 0
xi = xi+ xi , xi+ 0, xi 0
min cT x
s.t. Ax = b
x0
Ax = b
x0
Theorem
Let X = {x : Ax = b, x 0}. x is an extreme point of X if
and only if x is a basic feasible solution of
Ax = b
x 0.
x1 a1 + . . . + xm am = b.
Ax = b BxB + NxN = b xB = B1 b 0
Proof.
Objective function, cT x, of the linear program is continuous
and the constraint set is compact. Therefore, by Weierstrass
Theorem, optimal solution exists.
The set of vertices, {x1 , . . . , xk }, of X is finite.
Therefore, X is the convex hull P of x1 , . . . , xk .
Hence, for every x X, x = ki=1 i xi where
i 0, ki=1 i = 1.
P
Let z = minP1ik cT xi . Therefore,
Pk for any x X,
T k T
z = c x = i=1 i c xi z i=1 i = z . So, the minimum
value of cT x is attained at a vertex of X.
Shirish Shevade Numerical Optimization
Consider the constraints:
x1 + x2 2
x1 1
x1 , x2 0
x1 + x2 2
x1 1
x1 , x2 0
x1 +x2 + x3 =2
x1 +x4 = 1
x1 , x2 , x3 , x4 0
1 1 1 0 2
Let A = = (a1 |a2 |a3 |a4 ) and b = .
1 0 0 1 1