A Duality Theorem for Nonlinear Programming

DOI10.1287/MNSC.12.5.385MaRDI QIDQ5514167zbMATH OpenOpenAlexFDO

Authors Suman Sinha

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

zbMATH Keywords

operations research

Cited in

(15)

• A chance constrained approach to fractional programming with random numerator
• More on subgradient duality
• A class of nondifferentiable mathematical programming problems
• A duality theorem for a special class of programming problems in complex space
• Programming with a non-differentiable constraint.
• An extension of the transposition theorems of Farkas and Eisenberg
• A dual-linear program
• Optimality conditions for a class of nondifferentiable minmax programming problems
• On converse duality for a nondifferentiable program
• On Nondifferentiable Quasiconvex Programming Problem
• On generalized convexity and duality with a square root term
• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
• Nonlinear programming in complex space
• A singularly perturbed Cauchy problem
• The linearized version of an algorithm for the mixed norms problem

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

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