A Strict Converse Duality Theorem in Nonlinear Programming

DOI10.1080/02522667.1983.10698771zbMath0529.49006OpenAlexW1977784563MaRDI QIDQ3311191

T. R. Gulati, Bruce D.Craven

Publication date: 1983

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1983.10698771

zbMATH Keywords

duality theoreminvex functionLagrangeanstrictly pseudoconvex function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (3)

On various duality theorems in nonlinear programming ⋮ Converse Duality in Nonlinear Programming ⋮ On Strict Converse Duality In Nonlinear Programming

Cites Work

• Unnamed Item
• On sufficiency of the Kuhn-Tucker conditions
• Invex functions and constrained local minima
• Pseudo-Convex Functions

This page was built for publication: A Strict Converse Duality Theorem in Nonlinear Programming