
133Linear Programming
• It is observed that some of the LPPs show degeneracy when used
with the primal problems. The corresponding dual problems are
much easier to solve in such cases.
• Interior-point methods move inside the feasible region to reach the
optimal solution.
Formulae Chart
LPP in the standard matrix form:
Minimize
z = c
T
x
subject to
Ax = b
x ≥ 0
Simplex tableau:
x b B b
B
= =
−
ˆ
1
y c B
T
B
T
=
−1
ˆ
c c y N
N
T
N
T T
= −
z
B
T
B
= −c x
Problems
1. A manufacturer produces two components, X and Y. Component X
requires 2 hours of machining and 3 hours of polishing. Component
Y requires 3 hours of machining and 4 hours of polishing. Every ...