Duality in nonlinear programming and the minimax theorem
From MaRDI portal
Publication:2525909
Cites work
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
- A Duality Theorem for Convex Programs
- A duality theorem for non-linear programming
- A generalization of Brouwer's fixed point theorem
- Dual Programs [Letter to the Editor]
- Duality in nonlinear programming
Cited in
(13)- Strictly quasi-convex (concave) functions and duality in mathematical programming
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- Duale Optimierungsaufgaben und Sattelpunktsätze
- Sequential stochastic core of a cooperative stochastic programming game
- Piecewise linear optimization: Duality and numerical results
- Abschätzungen bei Variationsmethoden mit Hilfe von Dualitätssätzen. I
- Über einen Dualitätssatz der nichtlinearen Programmierung
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
- Abschätzungen bei Variationsmethoden mit Hilfe von Dualitätssätzen. II
- ON A THEOREM OF NEGISHI
- Minmax and duality in nonlinear programming
- Application of continuous-time programming problems to a class of variational-type inequalities
- Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme
This page was built for publication: Duality in nonlinear programming and the minimax theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525909)
