Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems

DOI10.1287/opre.33.1.222zbMath0569.90067OpenAlexW2096149764MaRDI QIDQ3686435

Bahman Kalantari

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.33.1.222

zbMATH Keywords

polytopedifferentiable concave functionlinearly constrained concave minimization algorithmstext problem generation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (3)

Quadratic functions with exponential number of local maxima ⋮ Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. ⋮ A new technique for generating quadratic programming test problems

This page was built for publication: Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems