Generalized Penalty-Function Concepts in Mathematical Optimization

DOI10.1287/opre.18.2.229zbMath0279.90034OpenAlexW2026517383MaRDI QIDQ4767126

No author found.

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)

Related Items (8)

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

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