Generalized Penalty-Function Concepts in Mathematical Optimization

DOI10.1287/OPRE.18.2.229MaRDI QIDQ4767126zbMATH OpenOpenAlexFDO

Authors

Publication date 1970

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.18.2.229

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cited in

(8)

• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem
• Implied constraints and an alternate unified development of nonlinear programming theory
• Implied constraints and a unified theory of duality in linear and nonlinear programming
• Vector optimization and generalized Lagrangian duality
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• Penalty methods for mathematical programming in E^n with general constraint sets
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• Exact penalty functions in nonlinear programming

This page was built for publication: Generalized Penalty-Function Concepts in Mathematical Optimization

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