A Strict Converse Duality Theorem in Nonlinear Programming

DOI10.1080/02522667.1983.10698771MaRDI QIDQ3311191zbMATH OpenOpenAlexFDO

Authors T. R. Gulati, B. 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

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

Cites work

• scientific article; zbMATH DE number 734930 (Why is no real title available?)
• Invex functions and constrained local minima
• On sufficiency of the Kuhn-Tucker conditions
• Pseudo-Convex Functions

Cited in

(4)

• On various duality theorems in nonlinear programming
• On Strict Converse Duality In Nonlinear Programming
• Converse Duality in Nonlinear Programming
• Duality-based single-level reformulations of bilevel optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3311191)