Abstract
Recently a duality theory for integer programming has been developed. Here we examine some of the economic implications of this theory, in particular the necessity of using price functions in place of prices, and the possibility of carrying out sensitivity analysis of optimal solutions. In addition we consider the form of price functions that are generated by known algorithms for integer programming.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.E. Alcaly and A.V. Klevorick, “A note on dual prices of integer programs”,Econometrica 34 (1966) 206–214.
A. Bachem and R. Schrader, “A note on a theorem of Jeroslow”, Report No. 7897, Institut für Operations Research, Bonn.
W.J. Baumol and R.E. Gomory, “Integer programming and pricing”,Econometrica 28 (1960) 521–550.
D.E. Bell and J.F. Shapiro, “A convergent duality theory for integer programming”,Operations Research 25 (1977) 419–434.
J.F. Benders, “Partitioning procedures for solving mixed variables programming problems”,Numerische Mathematik 4 (1962) 238–252.
C.E. Blair, “Extensions of subadditive functions used in cutting plane theory”, MSRR No. 360, Carnegie Mellon University (December 1974).
C.E. Blair and R.G. Jeroslow, “The value function of a mixed integer program: I”,Discrete Mathematics 19 (1977) 121–138.
C.E. Blair and R.G. Jeroslow, “The value function of a mixed integer program: II”,Discrete Mathematics 25 (1979) 7–19.
C.A. Burdet and E.L. Johnson, “A subadditive approach to solve linear integer programs”,Annals of Discrete Mathematics 1 (1977) 117–144.
V. Chvatal, “Edmonds polytopes and a hierarchy of combinatorial problems”,Discrete Mathematics 4 (1973) 305–337.
R.J. Dakin, “A tree-search algorithm for mixed integer programming”,Computer Journal 8 (1965) 250–255.
J. Edmonds, “Maximum matching and a polyhedron with 0–1 vertices”,Journal Research National Bureau of Standards 69(B) (1965) 125–130.
J. Edmonds, “Some well-solved problems in combinatorial optimization”, in: B. Roy, ed.,Combinatorial programming: methods and applications (D. Reidel Publishing Co., Dordrecht, Holland, 1975).
J. Edmonds and W. Pulleyblank,Optimum matching theory (Johns Hopkins Press, to appear).
M.L. Fisher, W.D. Northrup and J.F. Shapiro, “Using duality to solve discrete optimization problems: theory and computational experience”,Mathematical Programming Study 3 (1975) 56–94.
A.M. Geoffrion, “Lagrangean relaxation for integer programming”,Mathematical Programming Study 2 (1974) 82–114.
A.M. Geoffrion and R. Nauss, “Parametric and postoptimality analysis in integer linear programming”,Management Science 23 (1977) 453–466.
R.E. Gomory, “An algorithm for the mixed integer problem”, RM-2597, RAND Corp. (1960).
R.E. Gomory, “An algorithm for integer solutions to linear programs”, in: R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming (McGraw-Hill, New York, 1963).
R.E. Gomory, “Some polyhedra related to combinatorial problems”,Linear Algebra and Its Applications 2 (1969) 451–558.
R.E. Gomory and E.L. Johnson, “Some continuous functions related to corner polyhedron”,Mathematical Programming 3 (1972) 23–85.
R.G. Jeroslow, “Minimal inequalities”,Mathematical Programming 17 (1979) 1–15.
R.G. Jeroslow, “Cutting plane theory: algebraic methods”,Discrete Mathematics 23 (1978) 121–150.
D.S. Johnson, A. Demers, J.D. Ullman, M.R. Carey and R.L. Graham, “Worst case performance bounds for simple one dimensional packing algorithms”,SIAM Journal of Computing 3 (1974) 299–325.
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, “On the group problem for mixed integer programming”,Mathematical Programming Study 2 (1974) 137–179.
E.L. Johnson, “On the group problem and a subadditive approach to integer programming”,Annals of Discrete Mathematics 5 (1979) 97–112.
R. Kannan and C.L. Monma, “On the complexity of integer programming problems”, Report No. 7780, Institut für Operations Research (Bonn, December 1977).
T.C. Koopmans, “Concepts of optimality and their uses”, Nobel Memorial Lecture, 11 December 1975,Mathematical Programming 11 (1976) 212–228.
R.R. Meyer, “On the existence of optimal solutions to integer and mixed integer programs”,Mathematical Programming 7 (1974) 223–235.
J. Tind and L.A. Wolsey, “A unifying framework for duality theory in mathematical programming”, CORE Discussion Paper 7834 (Louvain-la-Neuve, August 1978, revised November 1979).
H.P. Williams, “The economic interpretation of duality for practical mixed integer programming problems”, Mimeo University of Edinburgh (June 1977).
L.A. Wolsey, “Integer programming duality: A view of some recent developments”, Mimeo, CORE (Louvain-la-Neuve, August 1978).
L.A. Wolsey, “Decomposition algorithms for general mathematical programs”, CORE Discussion Paper 7940 (Louvain-la-Neuve, December 1979).
Author information
Authors and Affiliations
Additional information
This research was supported in part by a Senior Visiting Research Fellowship from the Science Research Council at the London School of Economics while the author was on leave from CORE, Université Catholique de Louvain, at Louvain-la-Neuve.
Rights and permissions
About this article
Cite this article
Wolsey, L.A. Integer programming duality: Price functions and sensitivity analysis. Mathematical Programming 20, 173–195 (1981). https://doi.org/10.1007/BF01589344
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01589344