Conditions for boundedness in concave programming under reverse convex and convex constraints

DOI10.1007/s00186-006-0110-4zbMath1161.90011OpenAlexW2008258465MaRDI QIDQ1006541

Wiesława T. Obuchowska

Publication date: 25 March 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-006-0110-4

zbMATH Keywords

concave minimizationreverse convex constraintsunboundedness of feasible regions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (4)

Unboundedness in reverse convex and concave integer programming ⋮ Feasibility in reverse convex mixed-integer programming ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ On boundedness of (quasi-)convex integer optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on the analytic centers of convex sets
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• Convex constrained programmes with unattained infima
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
• Methods for Global Concave Minimization: A Bibliographic Survey
• Cone of recession and unboundedness of convex functions

This page was built for publication: Conditions for boundedness in concave programming under reverse convex and convex constraints