
228 Optimization: Algorithms and Applications
C D
Q
D
Q
= + +150
972 000 432
2
5
,
where C is in dollars, D is in inches, and Q is in cubic feet per second.
Find the minimum cost and best values of D and Q by geometric
programming.
The degree of difculty of this problem is 3 − (2 + 1) = 0. Also given are
a a a
a a a
a a a
11 12 13
21 22 23
31 32 33
1 5 0
0 2
=
−
−11
1 1 1
150
972 000
1
2
3
=and
c
c
c
,
4432
Writing the normality and orthogonality conditions in matrix form
1 5 0
0 2 1
1 1 1
0
0
1
1
2
3
−
−
=
w
w
w
Solving the above equation gives
w
w
w
1
2
3
5 8
1 8
1 4
=
/
/
/
Substituting these ...