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)
The book is intended as an introduction to the quantitative theory of mathematical programming in vector spaces. It consists of three chapters. The first chapter presents fundamentals of convex analysis, including separation theorems and conjugacy correspondence for convex functions (which are essentially the geometric and analytic equivalent forms of duality principles). Differentiability properties of convex functions are also treated but only in the Fréchet sense. Chapter 2 deals with the general duality theory of mathematical programming in its three main aspects: duality theorems, minimax theorems and saddle point theorems. Special attention is paid to the Lagrange form \(\psi (x,y)=\phi (x,y)- \alpha (x)-\beta (y)\), where \(\phi\) (x,y) is defined on \(K\times L\), \(\alpha\) (x) on K and \(\beta\) (y) on L. The last chapter is devoted to dual problems of mathematical programming, including linear programming, quadratic programming, convex programming and nonlinear programming. Duality theorems for these extremal problems are derived by specializing the general principles in Chapters 2 to suitable Lagrange forms. Also linear programming in Banach spaces and duality in transportation problems on networks are studied. In the whole the book is a lucid presentation of duality theory and can serve as a useful textbook for graduate or advanced undergraduate students. The specialist might wish to find in it more material on recent developments connected with nondifferentiable and nonconvex programming.
- 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)