Theory of Duality in Mathematical Programming
Banach spacesconjugacyconvex functionsDifferentiability propertiesintroductionLagrange formsminimax theoremssaddle point theoremsseparation theoremsvector spaces
Fréchet and Gateaux differentiability in optimization (49J50) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Quadratic programming (90C20) Convex programming (90C25) Nonlinear programming (90C30) Programming involving graphs or networks (90C35) Programming in abstract spaces (90C48)
- Dualizing optimization problems in mathematical economics
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications
- On a generalized sup-inf problem
- Equilibrium constrained optimization problems
- The level set method of Joó and its use in minimax theory
- A new duality theory for mathematical programming
- Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- scientific article; zbMATH DE number 3948007 (Why is no real title available?)
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Stability of differential inclusions: a computational approach
- Duality theory in fuzzy mathematical programming problems with fuzzy coefficients
This page was built for publication: Theory of Duality in Mathematical Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993055)
