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

DOI10.1007/S00186-006-0110-4MaRDI QIDQ1006541zbMATH OpenOpenAlexFDO

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

Recommendations

• Unboundedness in reverse convex and concave integer programming
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• On boundedness of (quasi-)convex integer optimization problems
• Minimizing a quasi-concave function subject to a reverse convex constraint
• A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 193113 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• scientific article; zbMATH DE number 3422216 (Why is no real title available?)
• Cone of recession and unboundedness of convex functions
• Convex constrained programmes with unattained infima
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Methods for Global Concave Minimization: A Bibliographic Survey
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
• Remarks on the analytic centers of convex sets
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints

Cited in

(9)

• Unboundedness in reverse convex and concave integer programming
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems
• Feasible partition problem in reverse convex and convex mixed-integer programming
• Efficiency of a Global Optimization Algorithm
• Convex programs with an additional reverse convex constraint
• On boundedness of (quasi-)convex integer optimization problems
• Feasibility in reverse convex mixed-integer programming
• GOOD DEAL BOUNDS WITH CONVEX CONSTRAINTS

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

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