Back to Search
Start Over
Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Source :
- Operations Research. 21:1260-1266
- Publication Year :
- 1973
- Publisher :
- Institute for Operations Research and the Management Sciences (INFORMS), 1973.
-
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.
- Subjects :
- Mathematical optimization
Concave function
MathematicsofComputing_NUMERICALANALYSIS
Maximization
Management Science and Operations Research
Computer Science Applications
Nonlinear programming
Linear inequality
Quadratic equation
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
Criss-cross algorithm
Algorithm
Global optimization
Counterexample
Mathematics
Subjects
Details
- ISSN :
- 15265463 and 0030364X
- Volume :
- 21
- Database :
- OpenAIRE
- Journal :
- Operations Research
- Accession number :
- edsair.doi...........df21eb6b87356765074e573fea52c1ad