Feasibility in reverse convex mixed-integer programming
From MaRDI portal
Publication:439456
DOI10.1016/j.ejor.2011.10.011zbMath1244.90171MaRDI QIDQ439456
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.011
integer programming; sensitivity analysis; feasibility; concave integer minimization; irreducible infeasible sets; reverse convex constraints
90C10: Integer programming
90C11: Mixed integer programming
90C30: Nonlinear programming
90C05: Linear programming
Related Items
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
- Unnamed Item
- Unboundedness in reverse convex and concave integer programming
- Efficiently packing unequal disks in a circle
- 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
- On infeasibility of systems of convex analytic inequalities
- Infeasibility analysis for systems of quadratic convex inequalities
- Some results concerning post-infeasibility analysis
- Consistency, redundancy, and implied equalities in linear systems
- Analyzing infeasible nonlinear programs
- Minimal infeasible constraint sets in convex integer programs
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Towards strong duality in integer programming
- Disk Packing in a Square: A New Global Optimization Approach
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Piecewise-convex maximization problems.
