Theory of Duality in Mathematical Programming

DOI10.1515/9783112483442zbMath0679.90028OpenAlexW4207061790MaRDI QIDQ3993055

M. Walk

Publication date: 17 September 1992

Full work available at URL: https://doi.org/10.1515/9783112483442

zbMATH Keywords

Banach spacesconjugacyminimax theoremsconvex functionsvector spacesintroductionseparation theoremssaddle point theoremsDifferentiability propertiesLagrange forms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Nonsmooth analysis (49J52) Linear programming (90C05) Fréchet and Gateaux differentiability in optimization (49J50) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming in abstract spaces (90C48) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Duality theory (optimization) (49N15) Optimality conditions for problems in abstract spaces (49K27)

Related Items (10)

Complementary Principle, Algorithm, and Complete Solutions to Phase Transitions in Solids Governed by Landau-Ginzburg Equation ⋮ Stability of differential inclusions: a computational approach ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ Perfect duality theory and complete solutions to a class of global optimization problems* ⋮ On a generalized sup-inf problem ⋮ Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications ⋮ Equilibrium constrained optimization problems ⋮ The level set method of Joó and its use in minimax theory ⋮ Implied constraints and a unified theory of duality in linear and nonlinear programming ⋮ Duality theory in fuzzy mathematical programming problems with fuzzy coefficients

This page was built for publication: Theory of Duality in Mathematical Programming