Abstract
The theme of this paper is the application of linear analysis to simplify and extend convex analysis. The central problem treated is the standard convex program — minimize a convex function subject to inequality constraints on other convex functions. The present approach uses the support planes of the constraint region to transform the convex program into an equivalent linear program. Then the duality theory of infinite linear programming shows how to construct a new dual program of bilinear type. When this dual program is transformed back into the convex function formulation it concerns the minimax of an unconstrained Lagrange function. This result is somewhat similar to the Kuhn—Tucker theorem. However, no constraint qualifications are needed and yet perfect duality maintains between the primal and dual programs.
Similar content being viewed by others
References
R.J. Duffin, “Infinite programs”, in:Linear inequalities and related systems, Eds. H.W. Kuhn and A. Tucker (Princeton University Press, Princeton, N.J., 1956) 157–170.
R.J. Duffin, “An orthogonality theorem of Dines related to moment problems and linear programming”,Journal of Combinatorial Theory 2 (1967) 1–26.
R.J. Duffin, “Linearizing geometric programs”,SIAM Review 12 (1969) 221–227.
R.J. Duffin and L.A. Karlovitz, “An infinite linear program with a duality gap”,Management Sciences 12 (1965) 122–134.
A.M. Geoffrion, “Duality in nonlinear programming: A simplified applications-oriented development”,SIAM Review 19 (1971) 1–37.
C. Kallina and A.C. Williams, “Linear programming in reflexive spaces”,SIAM Review 13 (1971) 350–376.
K. Kortanek, “Classifying convex extremum problems over linear topologies having sepation properties”,Journal of Mathematical Analysis and Applications, to appear.
K.S. Kretschmer, “Programmes in paired spaces”,Canadian Journal of Mathematics 13 (1961) 222–238.
O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).
E.L. Peterson, “Symmetric duality for generalized unconstrained geometric programming”,SIAM Journal of Applied Mathematics 19 (1970) 487–526.
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, N.J., 1971).
Author information
Authors and Affiliations
Additional information
Work prepared under Research Grant DA-AROD-31-124-71-G17, Army Research Office (Durham).
Rights and permissions
About this article
Cite this article
Duffin, R.J. Convex analysis treated by linear programming. Mathematical Programming 4, 125–143 (1973). https://doi.org/10.1007/BF01584656
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01584656