The Fundamental Relations between Geometric Programming Duality, Parametric Programming Duality, and Ordinary Lagrangian Duality

Annals of Operations Research

Volumn 105, Issue 1-4, 2001, Pages 109-153

  Peterson, Elmor L ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Conjugate transformation; Dual cones; Duality theory; Geometric programming; Lagrange multipliers; Legendre transformation; Ordinary programming; Orthogonal complementary subspaces; Orthogonal projection; Parametric programming; Post optimality analysis

Indexed keywords

EID: 0035562796     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1013353515966     Document Type: Article

References (58)

1. R.A. Abrams and C.T. Wu, Projection and restriction methods in geometric programming and related problems, in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 165.
2. M. Avriel, ed., Advances in Geometric Programming (Plenum Press, 1980).
3. R. Courant and D. Hilbert, Methods of Mathematical Physics (Interscience, 1953) pp. 231-238.
4. G.B. Dantzig and A. Orden, Duality theorems, RAND Report RM-1265, The RAND Corporation (1953).
5. J.B. Dennis, Mathematical Programming and Electrical Networks (Wiley, 1959).
6. W.S. Dorn, Duality in quadratic programming, Quart. Appl. Math. 18 (1960) 155.
7. R.J. Duffin, Nonlinear networks, I, Bull. Amer. Math. Soc. 52 (1946) 833.
8. R.J. Duffin, Nonlinear networks, IIa, Bull. Amer. Math. Soc. 53 (1947) 963.
9. R.J. Duffin, Nonlinear networks, IIb, Bull. Amer. Math. Soc. 54 (1948) 119.
10. R.J. Duffin, Nonlinear networks, III, Bull. Amer. Math. Soc. 55 (1949) 119.
11. R.J. Duffin, Nonlinear networks, IV, Proc. Amer. Math. Soc. 1 (1950) 233.
12. R.J. Duffin, Infinite linear programs, in: Linear Inequalities and Related Systems, eds. H.W. Kuhn and A.W. Tucker (Princeton University Press, 1956) p. 157.
13. R.J. Duffin, Dual programs and minimum cost, SIAM J. 10 (1962) 119.
14. R.J. Duffin, Cost minimization problems treated by geometric means, Operations Research 10 (1962) 668.
15. R.J. Duffin and L.A. Karlovitz, An infinite linear program with a duality gap, Management Science 13 (1965) 122.
16. R.J. Duffin and E.L. Peterson, Constrained minima treated by geometric means, Westinghouse Scientific Paper 64-158-129-P3 (1964).
17. R.J. Duffin and E.L. Peterson, Duality theory for geometric programming, SIAM J. Appl. Math. 14(6) (1966) 1307.
18. R.J. Duffin and E.L. Peterson, The proximity of algebraic geometric programming to linear programming, J. Math. Programming 3 (1972) 250.
19. R.J. Duffin, E.L. Peterson and C. Zener, Geometric Programming - Theory and Application (Wiley, 1967).
20. J.E. Falk, Lagrange multipliers and nonlinear programming, J. Math. Anal. Appl. 19 (1967) 141.
21. S.C. Fang, Solving linear constrained separable convex programs via generalized geometric programming duality, Chinese J. Math. 10 (1982) 103.
22. S.C. Fang, J.R. Rajasekera and H.S. Jacob Tsao, Entropy Optimization and Mathematical Programming (Kluwer Academic, 1997).
23. W. Fenchel, On conjugate convex functions, Canadian J. Math. 1 (1949) 73.
24. W. Fenchel, Convex Cones, Sets and Functions, Math. Dept. Lecture Notes (Princeton University, 1951).
25. D. Gale, H.W. Kuhn and A.W. Tucker, Linear programming and the theory of games, Cowles Commission Monograph 13 (1951) 317.
26. M. Hall and E.L. Peterson, Traffic equilibria analyzed via geometric programming, in: Proc. Int. Symp. Traffic Equilibrium Methods, ed. M. Florian, Lecture Notes in Economics and Mathematical Systems 118 (Springer, 1976) p. 53.
27. T.R. Jefferson and C.H. Scott, Quadratic geometric programming with application to machining economics, Mathematical Programming 31 (1985) 137.
28. G.J. Minty, Monotone networks, Proc. Roy. Soc. London A 257 (1960) 194.
29. G.J. Minty, On the axiomatic foundations of the theories of directed linear graphs, electrical networks, and network programming, J. Math. Mech. 15 (1966) 420.
30. E.L. Peterson, An economic interpretation of duality in linear programming, J. Math. Anal. Appl. 30 (1970) 172.
31. E.L. Peterson, Symmetric duality for generalized unconstrained geometric programming, SIAM J. Appl. Math. 19 (1970) 487.
32. E.L. Peterson, Fenchel's hypothesis and the existence of recession directions in convex programming, Northwestern University Center for Research in Mathematical Economics and Management Science, Discussion Paper Number 152 (1975).
33. E.L. Peterson, Geometric programming, SIAM Rev. 19 (1976) 1. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 31.
34. E.L. Peterson, Geometric programming, SIAM Rev. 19 (1976) 1. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 31.
35. E.L. Peterson, Ordinary duality vis-a-vis geometric duality, Northwestern University Center for Research in Mathematical Economics and Management Science, Discussion Paper Number 263 (1976).
36. E.L. Peterson, The complementary unboundedness of dual feasible solution sets in convex programming, J. Math. Prog. 392 (1977) 12.
37. E.L. Peterson, The duality between suboptimization and parameter deletion, Math. Oper. Res. 2 (1977) 311.
38. E.L. Peterson, Geometric duality via Rockafellar duality, Northwestern University Center for Research in Mathematical Economics and Management Science, Discussion Paper Number 270 (1977).
39. E.L. Peterson, Constrained duality via unconstrained duality in generalized geometric programming, J. Optimization Theory Appl. 26 (1978) 43. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 135.
40. E.L. Peterson, Constrained duality via unconstrained duality in generalized geometric programming, J. Optimization Theory Appl. 26 (1978) 43. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 135.
41. E.L. Peterson, Fenchel's duality theorem in generalized geometric programming, J. Optimization Theory Appl. 26 (1978) 51. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 143.
42. E.L. Peterson, Fenchel's duality theorem in generalized geometric programming, J. Optimization Theory Appl. 26 (1978) 51. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 143.
43. E.L. Peterson, Saddle points and duality in generalized geometric programming, J. Optimization Theory Appl. 26 (1978) 15. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 107.
44. E.L. Peterson, Saddle points and duality in generalized geometric programming, J. Optimization Theory Appl. 26 (1978) 15. Reprinted in: Advances in Geometric Programming, ed. M. Avriel (Plenum Press, 1980) p. 107.
45. p-approximation problems, Bull. Amer. Math. Soc. 74 (1968) 316.
46. p-approximation I, in: Proc. Princeton Symp. Math. Prog., ed. H.W. Kuhn (Princeton University Press, 1970) p. 445.
47. p-approximation II (canonical programs), SIAM J. Appl. Math. 17 (1969) 317.
48. p-approximation III (degenerate programs), J. Math. Anal. Appl. 29 (1970) 365.
49. R.T. Rockafellar, Duality and stability in extremum problems involving convex functions, Pacific J. Math. 21 (1967) 167.
50. R.T. Rockafellar, Convex Analysis (Princeton University Press, 1970).
51. R.T. Rockafellar, Network Flows and Monotropic Optimization (Wiley, 1984).
52. C.H. Scott and T.R. Jefferson, Conjugate duality in generalized fractional programming, J. Optimization Theory Appl. 60 (1989) 475.
53. C.H. Scott and T.R. Jefferson, Trace optimization problems and generalized geometric programming, J. Math. Anal. Appls. 58 (1977) 373.
54. J. von Neumann, Duality Theory, Privately Circulated Notes (Princeton, 1947).
55. P. Wolf, A duality theorem for nonlinear programming, Quart. Appl. Math. 19 (1961) 239.
56. C. Zener, A mathematical aid in optimizing engineering designs, Proc. Nat. Acad. Sci. 47 (1961) 537.
57. C. Zener, A further mathematical aid in optimizing engineering designs, Proc. Nat. Acad. Sci. 48 (1962) 518.
58. C. Zener, Engineering Design by Geometric Programming (Wiley, 1971).