Abstract
We survey some recent developments in duality theory with the idea of explaining and unifying certain basic duality results in both nonlinear and integer programming. The idea of replacing dual variables (prices) by price functions, suggested by Everett and developed by Gould, is coupled with an appropriate dual problem with the consequence that many of the results resemble those used in linear programming.
The dual problem adopted has a (traditional) economic interpretation and dual feasibility then provides a simple alternative to concepts such as conjugate functions or subdifferentials used in the study of optimality. In addition we attempt to make precise the relationship between primal, dual and saddlepoint results in both the traditional Lagrangean and the more general duality theories and to see the implications of passing from prices to price functions. Finally, and perhaps surprisingly, it appears that all the standard algorithms terminate by constructing primal and dual feasible solutions of equal value, i.e., by satisfying generalised optimality conditions.
Similar content being viewed by others
References
E.J. Balder, “An extension of duality-stability relations to nonconvex optimization problems”,SIAM Journal on Control and Optimization 15 (1977) 329–343.
J.F. Benders, “Partitioning procedures for solving mixed variables programming problems”,Numerische Mathematik 4 (1962) 238–252.
C.E. Blair and R.G. Jeroslow, “The value function of a mixed integer program: I”,Discrete Mathematics 19 (1977), 121–138.
C.A. Burdet and E.L. Johnson, “A subadditive approach to solve linear integer programs”,Annals of Discrete Mathematics 1 (1977) 117–144.
S. Dolecki, “Semicontinuity in constrained optimization. Part I.1. metric spaces”,Control and Cybernetics 7 (1978) 5–16.
S. Dolecki, “Abstract study of optimality conditions”, Institute of Mathematics, Warsaw. Undated, received May 1979.
S. Dolecki, “Abstract optimality theory”, MRC Technical Report 2006, University of Wisconsin (October 1979).
S. Dolecki and S. Kurcyusz, “OnÆ-convexity in extremal problems”,SIAM Journal on Control and Optimization 16 (1978) 277–300.
K.H. Elster and R. Nehse, “Zur Theorie der Polarfunktionale”,Mathematische Operationsforschung und Statistik 5 (1974) 3–21.
J.P. Evans, F.J. Gould and S.M. Howe, “A note on extended GLM”,Operations Research 19 (1971) 1079–1080.
H. Everett, “Generalized Lagrange multiplier method for solving problems of optimum allocation of resources”,Operations Research 11 (1963) 399–417.
W. Fenchel, “On conjugate convex functions,Canadian Journal of Mathematics 1 (1949) 73–77.
A.M. Geoffrion, “Duality in nonlinear programming: A simplified applications-oriented development”,SIAM Review 13 (1971) 1–37.
A.M. Geoffrion, “Lagrangean relaxation for integer programming”,Mathematical Programming Study 3 (1975) 56–94.
F.J. Gould, “Extensions of Lagrange multipliers in nonlinear programming”,SIAM Journal on Applied Mathematics 17 (1969) 1280–1297.
F.J. Gould, “Nonlinear duality theorems”,Cahiers du Centre d'Etudes de Recherche Opérationnelle 14 (1972) 196–212.
H.J. Greenberg and W.P. Pierskalla, “Surrogate mathematical programming”,Operations Research 18 (1970) 924–939.
R.G. Jeroslow, “Cutting plane theory: Algebraic methods”,Discrete Mathematics 23 (1978) 121–150.
R.G. Jeroslow, “Minimal inequalities”,Mathematical Programming 17 (1979) 1–15.
E.L. Johnson, “Cyclic groups, cutting planes and shortest paths”, in: T.C. Hu and S. Robinson, eds.,Mathematical Programming (Academic Press, New York, 1973).
E.L. Johnson, “Faces of polyhedra of mixed integer programming problems”, Istituto Nazionale di alta Matematica XIX (1976) 289–299.
E.L. Johnson, “On the group problem and a subadditive approach to integer programming”,Annals of Discrete Mathematics 5 (1979) 97–112.
T.C. Koopmans, “Concepts of optimality and their uses”, Nobel Memorial Lecture, December 1975, in:Mathematical Programming 11 (1976) 212–228.
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970).
R.T. Rockafellar, “Augmented Lagrange multiplier functions and duality in nonconvex programming”,SIAM Journal on Control 12 (1974) 268–283.
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer-Verlag, Berlin, 1970).
L.A. Wolsey, “Integer programming duality: Price functions and sensitivity analysis”,Mathematical Programming 20 (1981) 173–195.
L.A. Wolsey, “Heuristic analysis, linear programming and branch and bound”,Mathematical Programming Study 13 (1980) 121–134.
L.A. Wolsey, “Decomposition algorithms for general mathematical programs”,Mathematical Programming Study 14 (1981) 244–257.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tind, J., Wolsey, L.A. An elementary survey of general duality theory in mathematical programming. Mathematical Programming 21, 241–261 (1981). https://doi.org/10.1007/BF01584248
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584248