Technical Note—On Converse Duality in Nonlinear Programming

DOI10.1287/opre.19.4.1075zbMath0246.90041OpenAlexW1993100540MaRDI QIDQ5659351

Bruce 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)

Related Items (17)

On Nondifferentiable Quasiconvex Programming Problem ⋮ A converse duality theorem in multiple objective programming ⋮ Generalized parameter-free duality models in discrete minmax fractional programming based on second-order optimality conditions ⋮ A singularly perturbed Cauchy problem ⋮ More on subgradient duality ⋮ A class of nondifferentiable mathematical programming problems ⋮ Duality in nonlinear fractional programming ⋮ Generalised convexity and duality in multiple objective programming ⋮ Converse and symmetric duality in complex nonlinear programming ⋮ Converse duality in Banach space ⋮ Complementarity for arbitrary cones ⋮ Lagrangean conditions and quasiduality ⋮ Second- and higher-order duality in nonlinear programming ⋮ 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: ⋮ On converse duality for a nondifferentiable program ⋮ Nonlinear programming in locally convex spaces ⋮ Converse duality in fractional programming

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