Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems

DOI10.1287/OPRE.33.1.222MaRDI QIDQ3686435zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the construction of test problems for concave minimization algorithms
• Construction of test problems for concave minimization under linear and nonlinear constraints
• Construction of large-scale global minimum concave quadratic test problems
• A generalization of the construction of test problems for nonconvex optimization
• Concave minimization via conical partitions and polyhedral outer approximation

Cited in

(5)

• 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
• Construction of large-scale global minimum concave quadratic test problems
• Construction of test problems for concave minimization under linear and nonlinear constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686435)