Implied constraints and an alternate unified development of nonlinear programming theory

DOI10.1016/0377-2217(94)00253-3zbMath0908.90237OpenAlexW2088712108MaRDI QIDQ1266624

Pravin K. Johri

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00253-3

zbMATH Keywords

dualitysimplex methodKarush-Kuhn-Tucker conditionsconstraint qualificationimplied constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (2)

Implied constraints and LP duals of general nonlinear programming problems ⋮ Johri's general dual, the Lagrangian dual, and the surrogate dual

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implied constraints and a unified theory of duality in linear and nonlinear programming
• Derivation of duality in mathematical programming and optimization theory
• An approach to nonlinear programming
• A duality theorem for non-linear programming
• Two Rules for Deducing Valid Inequalities for 0-1 Problems
• Duality via halfspaces
• Generalized Penalty-Function Concepts in Mathematical Optimization
• Surrogate Constraints
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• A Necessary and Sufficient Qualification for Constrained Optimization
• Surrogate Mathematical Programming
• Constraint Qualifications Revisited
• On Conjugate Convex Functions

This page was built for publication: Implied constraints and an alternate unified development of nonlinear programming theory