An elementary survey of general duality theory in mathematical programming

DOI10.1007/BF01584248zbMath0467.90061OpenAlexW1978701215MaRDI QIDQ3921006

Jørgen Tind, Laurence A. Wolsey

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584248

zbMATH Keywords

surveyoptimality conditionssubdifferentialsduality theorydual variableseconomic interpretationdual feasible solutionsdual feasibilityprice functionsprimal feasible solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Mathematical economics (91B99) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Duality theory (optimization) (49N15)

Related Items

General communication schemes for multiobjective decision making, Petroleum supply planning: reformulations and a novel decomposition algorithm, A general theory of dual optimization problems, Strict convex regularizations, proximal points and augmented lagrangians, Some further relations between unperturbational and perturbational dual optimization problems, Duality in nonlinear programs using augmented Lagrangian functions, Additively separable duality theory, Multipliers and general Lagrangians, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Partitioning procedure for polynomial optimization, Convex analysis in groups and semigroups: a sampler, Duality in nonlinear programming, A necessary and a sufficient optimality condition for bilevel programming problems, Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning, Decomposition in global optimization, Quasiconvex duality theory by generalized conjugation methods, Lagrangean duality for facial programs with applications to integer and complementarity problems, A generalized duality and applications, Decomposition in general mathematical programming, An abstract symmetric framework for duality in mathematical programming, Critical duality, Are dualities appropriate for duality theories in optimization?, A general theory of dual optimization problems. II: On the perturbational dual problem corresponding to an unperturbational dual problem, A new duality theory for mathematical programming, L-shaped decomposition of two-stage stochastic programs with integer recourse, Theorems of the alternative and optimality conditions, Duality in mathematics and linear and integer programming, Comments on the general duality survey by J. Tind and L.A. Wolsey, Some characterizations of perturbational dual problems, Average shadow prices in mathematical programming, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems, On abstract duality in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Abstract study of optimality conditions
• The value function of a mixed integer program: I
• Cutting-plane theory: Algebraic methods
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Minimal inequalities
• Heuristic analysis, linear programming and branch and bound
• A resource decomposition algorithm for general mathematical programs
• Integer programming duality: Price functions and sensitivity analysis
• Technical Note—A Note on Extended GLM
• Concepts of optimality and their uses
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• On $\Phi $-Convexity in Extremal Problems
• On the Group Problem and a Subadditive Approach to Integer Programming
• Zur theorie der polarfunktionale
• Extensions of Lagrange Multipliers in Nonlinear Programming
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Surrogate Mathematical Programming
• On Conjugate Convex Functions