A Duality Theorem for Nonlinear Programming
From MaRDI portal
Publication:5514167
DOI10.1287/mnsc.12.5.385zbMath0139.13203OpenAlexW2050798859MaRDI QIDQ5514167
Publication date: 1966
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.12.5.385
Related Items (15)
On Nondifferentiable Quasiconvex Programming Problem ⋮ Optimality conditions for a class of nondifferentiable minmax programming problems ⋮ A singularly perturbed Cauchy problem ⋮ More on subgradient duality ⋮ A class of nondifferentiable mathematical programming problems ⋮ On generalized convexity and duality with a square root term ⋮ The linearized version of an algorithm for the mixed norms problem ⋮ Programming with a non-differentiable constraint. ⋮ Nonlinear programming in complex space ⋮ An extension of the transposition theorems of Farkas and Eisenberg ⋮ On converse duality for a nondifferentiable program ⋮ A dual-linear program ⋮ A chance constrained approach to fractional programming with random numerator ⋮ A duality theorem for a special class of programming problems in complex space ⋮ Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
This page was built for publication: A Duality Theorem for Nonlinear Programming
