
103Linear Programming
where
A =
− −
− − −
− − −
2 3 1 3 3 0 0 0
5 2 4 7 7 1 0 0
4 1 2 5 5 0 1 0
0 1 0 0 0 0 0 1
=
−
−
; ;c
4
2
1
3
3
0
0
0
b x=
=
′
′
′′
7
3
2
2
1
2
3
4
4
2
3
4
;
x
x
x
x
x
s
e
s
4.4 Basic Solution
Consider an LPP in the standard form
Minimize
z = c
T
x (4.29)
subject to
Ax = b (4.30)
x, b ≥ 0 (4.31)
with n variables and m constraints. If m = n, then the solution is given by
satisfying the constraint equations Ax = b and there is no need for optimiza-
tion. For m > n, there will be m − n redundant equations. The case m < n will
correspond to an underdetermined system of linear equations that wi ...