Feasibility in reverse convex mixed-integer programming

DOI10.1016/J.EJOR.2011.10.011MaRDI QIDQ439456zbMATHOpenAlexFDO

Authors W. T. Obuchowska

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

zbMATH Keywords

sensitivity analysisinteger programmingfeasibilityconcave integer minimizationirreducible infeasible setsreverse convex constraints

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Feasible partition problem in reverse convex and convex mixed-integer programming
• A polyhedral characterization of the inverse-feasible region of a mixed-integer program
• Mixed integer programming with a class of nonlinear convex constraints
• Methods for solving some classes of reverse convex programs
• A method for solving reverse convex programming problems
• Reverse convex problems: an approach based on optimality conditions
• On the complexity of inverse mixed integer linear optimization
• Convex relaxations for mixed-integer nonlinear programs
• A feasibility pump for mixed integer nonlinear programs
• scientific article; zbMATH DE number 3932824

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3653840 (Why is no real title available?)
• scientific article; zbMATH DE number 193113 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (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?)
• A Theorem Concerning the Integer Lattice
• An observation on the structure of production sets with indivisibilities
• Analyzing infeasible nonlinear programs
• Conditions for boundedness in concave programming under reverse convex and convex constraints
• Consistency, redundancy, and implied equalities in linear systems
• Disk packing in a square: a new global optimization approach
• Efficiently packing unequal disks in a circle
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Infeasibility analysis for systems of quadratic convex inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Minimal infeasible constraint sets in convex integer programs
• On boundedness of (quasi-)convex integer optimization problems
• On infeasibility of systems of convex analytic inequalities
• Piecewise-convex maximization problems.
• Reverse convex programming
• Some results concerning post-infeasibility analysis
• Towards strong duality in integer programming
• Unboundedness in reverse convex and concave integer programming
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints

Cited in

(4)

• Irreducible infeasible sets in convex mixed-integer programs
• Feasible partition problem in reverse convex and convex mixed-integer programming
• Minimal infeasible constraint sets in convex integer programs
• A polyhedral characterization of the inverse-feasible region of a mixed-integer program

This page was built for publication: Feasibility in reverse convex mixed-integer programming

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