Abstract
Given a polytope and an arbitrary subset of its vertices, the author shows how to construct a differentiable concave function that assumes any arbitrary value (within a specified epsilon -tolerance) at each vertex of the subset, with each vertex in the subset a strong local constrained minimum. The author also shows how this construction method can be used to generate test problems for linearly constrained concave minimization algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 222-227 |
| Number of pages | 6 |
| Journal | Operations Research |
| Volume | 33 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1 1985 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research
Cite this
}
CONSTRUCTION OF DIFFICULT LINEARLY CONSTRAINED CONCAVE MINIMIZATION PROBLEMS. / Kalantari, Bahman.
In: Operations Research, Vol. 33, No. 1, 01.01.1985, p. 222-227.Research output: Contribution to journal › Article
TY - JOUR
T1 - CONSTRUCTION OF DIFFICULT LINEARLY CONSTRAINED CONCAVE MINIMIZATION PROBLEMS.
AU - Kalantari, Bahman
PY - 1985/1/1
Y1 - 1985/1/1
N2 - Given a polytope and an arbitrary subset of its vertices, the author shows how to construct a differentiable concave function that assumes any arbitrary value (within a specified epsilon -tolerance) at each vertex of the subset, with each vertex in the subset a strong local constrained minimum. The author also shows how this construction method can be used to generate test problems for linearly constrained concave minimization algorithms.
AB - Given a polytope and an arbitrary subset of its vertices, the author shows how to construct a differentiable concave function that assumes any arbitrary value (within a specified epsilon -tolerance) at each vertex of the subset, with each vertex in the subset a strong local constrained minimum. The author also shows how this construction method can be used to generate test problems for linearly constrained concave minimization algorithms.
UR - http://www.scopus.com/inward/record.url?scp=0021794591&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021794591&partnerID=8YFLogxK
U2 - 10.1287/opre.33.1.222
DO - 10.1287/opre.33.1.222
M3 - Article
AN - SCOPUS:0021794591
VL - 33
SP - 222
EP - 227
JO - Operations Research
JF - Operations Research
SN - 0030-364X
IS - 1
ER -