Professional Documents
Culture Documents
Lect8 Optimization
Lect8 Optimization
Minati De
Table of Contents
1 Optimality Condition
Feasible Direction
Minimize c T x
Subject to Ax = b
x ≥ 0.
Feasible Direction
Let x be an element of a polyhedron P = {x ∈ Rn |Ax = b, x ≥ 0}.
A vector d ∈ Rn is said to be a feasible direction at x, if there
exists a positive scalar θ for which x + θd ∈ P.
Example: ?
dj = 1, di = 0, ∀i ∈
/ B, i 6= j
−1
dB = −AB Aj .
How do you obtain this?
Does it always guarantee that x + θd is a feasible solution?
Reduced cost
Reduced Cost
For each basic variable xb(i) what is the reduced cost cB(i)
ˆ ?
Optimality Condition
Theorem
Consider a basic solution x associated with a basis matrix AB , and
let ĉ be the vector of reduced costs.
(a) If ĉ ≥ 0, then x is optimal.
(b) If x is optimal and nondegenerate, then ĉ ≥ 0.
Proof?
Optimal Basis
Optimal Basis
A basis matrix AB is said to be optimal if:
(a)
A−1
B b ≥ 0,
and
(b)
ĉ T = c T − cBT A−1
B A ≥ 0.