Abstract
To meet difficulties of convergence and “stepsize-choosing” within the Method of Approximation Programming (MAP) of GRIFFITH and STEWART a modified approximation method for nonlinear programming problems is given. It is proved to be convergent for convex problems. The running times and gained numerical experience is discussed for numerous test problems.
Originalsprache | deutsch |
---|---|
Seiten (von - bis) | 23-33 |
Fachzeitschrift | Mathematische Operationsforschung und Statistik |
Jahrgang | 5 |
Ausgabenummer | 1 |
DOIs | |
Publikationsstatus | Veröffentlicht - 1974 |