Minmax and duality in nonlinear programming

DOI10.1016/0022-247X(65)90101-0zbMath0131.18601MaRDI QIDQ2395157

Yanyan Li

Publication date: 1965

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

operations research

Related Items (13)

Duale Optimierungsaufgaben und Sattelpunktsätze ⋮ Duality in improper programming ⋮ The generalized quasi-variational inequality problem with applications ⋮ Application of continuous-time programming problems to a class of variational-type inequalities ⋮ KT-invex control problem ⋮ Logarithmic convexity and geometric programming ⋮ Strictly quasi-convex (concave) functions and duality in mathematical programming ⋮ On duality without convexity ⋮ A decomposition method for structured linear and nonlinear programs ⋮ Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints ⋮ A variational-like inequality for multifunctions with applications ⋮ A duality theorem and an algorithm for (mixed-) integer nonlinear programming ⋮ Implied constraints and a unified theory of duality in linear and nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality in nonlinear programming and the minimax theorem
• A Duality Theorem for Convex Programs
• Duality in quadratic programming
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• A duality theorem for non-linear programming
• Symmetric dual quadratic programs
• Duality in nonlinear programming
• Dual Programs [Letter to the Editor]

This page was built for publication: Minmax and duality in nonlinear programming