A New Method for Constrained Optimization Problems

DOI10.1287/OPRE.17.6.973zbMath0183.49005OpenAlexW2123228849MaRDI QIDQ5575233

J. S. Kowalik, David M. Ryan, Michael R. Osborne

Publication date: 1969

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Related Items (10)

Least squares with non-linear equality constraints. Application to closing of balances ⋮ Penalty function versus non-penalty function methods for constrained nonlinear programming problems ⋮ An efficient algorithm for minimizing barrier and penalty functions ⋮ Least square approach for system reliability optimization† ⋮ A computational comparison of some non-linear programs ⋮ Reliability optimization through sequential simplex search ⋮ A negative-positive barrier method for non-linear programming ⋮ New algorithms for constrained minimax optimization ⋮ Minimization methods with constraints ⋮ Nonlinear programming using minimax techniques

This page was built for publication: A New Method for Constrained Optimization Problems