Implied constraints and a unified theory of duality in linear and nonlinear programming

DOI10.1016/0377-2217(93)90260-TzbMath0804.90090OpenAlexW1982037232MaRDI QIDQ1319546

Pravin K. Johri

Publication date: 24 January 1995

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90260-t

zbMATH Keywords

implied constraintsconjugate function approach

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05)

Related Items

Derivation of duality in mathematical programming and optimization theory, Duality via halfspaces, A non-interactive elicitation method for nonlinear multiattribute utility functions: theory and application to agricultural economics, Duality in nonlinear programming, Implied constraints and LP duals of general nonlinear programming problems, Implied constraints and an alternate unified development of nonlinear programming theory, 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
• Minmax and duality in nonlinear programming
• Symmetric dual nonlinear programs
• Duality in nonlinear programming and the minimax theorem
• Theory of Duality in Mathematical Programming
• Two Rules for Deducing Valid Inequalities for 0-1 Problems
• Cutting-Planes for Complementarity Constraints
• Generalized Penalty-Function Concepts in Mathematical Optimization
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Surrogate Constraints
• An Improved Implicit Enumeration Approach for Integer Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Surrogate Mathematical Programming
• On Conjugate Convex Functions