An elementary survey of general duality theory in mathematical programming
From MaRDI portal
Cites work
- A resource decomposition algorithm for general mathematical programs
- Abstract study of optimality conditions
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- Concepts of optimality and their uses
- Convex Analysis
- Cutting-plane theory: Algebraic methods
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Heuristic analysis, linear programming and branch and bound
- scientific article; zbMATH DE number 3542186 (Why is no real title available?)
- scientific article; zbMATH DE number 3578640 (Why is no real title available?)
- scientific article; zbMATH DE number 3623314 (Why is no real title available?)
- scientific article; zbMATH DE number 3428777 (Why is no real title available?)
- scientific article; zbMATH DE number 3431974 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- Integer programming duality: Price functions and sensitivity analysis
- Minimal inequalities
- On \Phi -Convexity in Extremal Problems
- On Conjugate Convex Functions
- On the Group Problem and a Subadditive Approach to Integer Programming
- Partitioning procedures for solving mixed-variables programming problems
- Surrogate Mathematical Programming
- Technical Note—A Note on Extended GLM
- The value function of a mixed integer program: I
- Zur theorie der polarfunktionale
Cited in
(33)- General communication schemes for multiobjective decision making
- A general theory of dual optimization problems
- Duality in nonlinear programs using augmented Lagrangian functions
- Decomposition in global optimization
- Lagrangean duality for facial programs with applications to integer and complementarity problems
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Average shadow prices in mathematical programming
- A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
- Theorems of the alternative and optimality conditions
- Additively separable duality theory
- Petroleum supply planning: reformulations and a novel decomposition algorithm
- Convex analysis in groups and semigroups: a sampler
- Critical duality
- Duality in mathematics and linear and integer programming
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning
- A new duality theory for mathematical programming
- Quasiconvex duality theory by generalized conjugation methods
- An abstract symmetric framework for duality in mathematical programming
- Duality in nonlinear programming
- On abstract duality in mathematical programming
- Some further relations between unperturbational and perturbational dual optimization problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- Strict convex regularizations, proximal points and augmented lagrangians
- A general theory of dual optimization problems. II: On the perturbational dual problem corresponding to an unperturbational dual problem
- Comments on the general duality survey by J. Tind and L.A. Wolsey
- Some characterizations of perturbational dual problems
- The gap function: evaluating integer programming models over multiple right-hand sides
- Multipliers and general Lagrangians
- Partitioning procedure for polynomial optimization
- A generalized duality and applications
- Decomposition in general mathematical programming
- Generator subadditive functions for mixed-integer programs
- Are dualities appropriate for duality theories in optimization?
This page was built for publication: An elementary survey of general duality theory in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3921006)
