Technical Note—On Converse Duality in Nonlinear Programming

DOI10.1287/OPRE.19.4.1075MaRDI QIDQ5659351zbMATH OpenOpenAlexFDO

Authors B. D. Craven, Bertram Mond

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.4.1075

Mathematics Subject Classification ID

Convex programming (90C25)

Cited in

(18)

• A converse duality theorem in multiple objective programming
• More on subgradient duality
• Converse and symmetric duality in complex nonlinear programming
• Converse duality in Banach space
• Second- and higher-order duality in nonlinear programming
• Converse duality in fractional programming
• A class of nondifferentiable mathematical programming problems
• Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions
• Nonlinear programming in locally convex spaces
• Generalised convexity and duality in multiple objective programming
• On converse duality for a nondifferentiable program
• On Nondifferentiable Quasiconvex Programming Problem
• Complementarity for arbitrary cones
• Lagrangean conditions and quasiduality
• Symmetric duality for nondifferentiable minimax mixed integer programming problems^##The authors wish to thank a referee for his valuable suggestions which have improved the presentation of this paper. The third author is also thankful to University Grants Commission, India for providing financial support$ef:
• Duality in nonlinear fractional programming
• A singularly perturbed Cauchy problem
• Duality-based single-level reformulations of bilevel optimization problems

This page was built for publication: Technical Note—On Converse Duality in Nonlinear Programming

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