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

DOI10.1007/S00186-006-0110-4zbMATH Open1161.90011OpenAlexW2008258465MaRDI QIDQ1006541FDOQ1006541

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

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

zbMATH Keywords

concave minimizationreverse convex constraintsunboundedness of feasible regions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Feasibility in reverse convex mixed-integer programming
• Unboundedness in reverse convex and concave integer programming
• On boundedness of (quasi-)convex integer optimization problems
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• Convex programs with an additional reverse convex constraint
• Efficiency of a Global Optimization Algorithm
• GOOD DEAL BOUNDS WITH CONVEX 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

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)