Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- 1 December 1973
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 21 (6) , 1260-1266
- https://doi.org/10.1287/opre.21.6.1260
Abstract
This paper gives counterexamples to: 1 Ritter's algorithm for the global maximization of a quadratic subject to linear inequality constraints, and 2 Tui's algorithm for the global minimization of a concave function subject to linear inequality constraints.Keywords
This publication has 0 references indexed in Scilit: