CONSTRUCTION OF DIFFICULT LINEARLY CONSTRAINED CONCAVE MINIMIZATION PROBLEMS.

Research output: Contribution to journalArticle

2 Scopus citations

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

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'CONSTRUCTION OF DIFFICULT LINEARLY CONSTRAINED CONCAVE MINIMIZATION PROBLEMS.'. Together they form a unique fingerprint.

  • Cite this