Unboundedness in reverse convex and concave integer programming
From MaRDI portal
Publication:604803
DOI10.1007/s00186-010-0315-4zbMath1200.49028OpenAlexW2019805944MaRDI QIDQ604803
Publication date: 12 November 2010
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-010-0315-4
Related Items (3)
Feasibility in reverse convex mixed-integer programming ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Remarks on the analytic centers of convex sets
- On boundedness of (quasi-)convex integer optimization problems
- Conditions for boundedness in concave programming under reverse convex and convex constraints
- Reverse convex programming
- Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
- Convex constrained programmes with unattained infima
- On the minimizing trajectory of convex functions with unbounded level sets
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Minimal infeasible constraint sets in convex integer programs
- Nonlinear integer programming
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Methods for Global Concave Minimization: A Bibliographic Survey
- Convex Analysis
- Cone of recession and unboundedness of convex functions
This page was built for publication: Unboundedness in reverse convex and concave integer programming
