CONSTRUCTION OF DIFFICULT LINEARLY CONSTRAINED CONCAVE MINIMIZATION PROBLEMS.

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)222-227
Number of pages6
JournalOperations Research
Volume33
Issue number1
DOIs
StatePublished - Jan 1 1985

Fingerprint

Set theory
Tolerance

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research

Cite this

@article{4cab963e9a944f74bab8237faff7ce89,
title = "CONSTRUCTION OF DIFFICULT LINEARLY CONSTRAINED CONCAVE MINIMIZATION PROBLEMS.",
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.",
author = "Bahman Kalantari",
year = "1985",
month = "1",
day = "1",
doi = "10.1287/opre.33.1.222",
language = "English (US)",
volume = "33",
pages = "222--227",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "1",

}

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 journalArticle

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

VL - 33

SP - 222

EP - 227

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 1

ER -