Global minimum test problem construction
- 1 December 1982
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 24 (1) , 353-355
- https://doi.org/10.1007/bf01585116
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible DomainMathematics of Operations Research, 1983
- A survey of methodology for the global minimization of concave functions subject to convex constraintsOmega, 1981
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976