Minimal infeasible constraint sets in convex integer programs

DOI10.1007/S10898-009-9443-XMaRDI QIDQ2268936zbMATH OpenOpenAlexFDO

Authors W. T. Obuchowska

Publication date 15 March 2010

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-009-9443-x

zbMATH Keywords

feasibility

Mathematics Subject Classification ID

Integer programming (90C10) Convex programming (90C25)

Recommendations

• Irreducible infeasible sets in convex mixed-integer programs
• Feasibility in reverse convex mixed-integer programming
• On infeasibility of systems of convex analytic inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Minimal valid inequalities for integer constraints

Cites work

• A Theorem Concerning the Integer Lattice
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• An observation on the structure of production sets with indivisibilities
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs
• Convex Analysis
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 42654 (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 976325 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• Infeasibility analysis for systems of quadratic convex inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• On boundedness of (quasi-)convex integer optimization problems
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
• On infeasibility of systems of convex analytic inequalities
• On Projection Algorithms for Solving Convex Feasibility Problems

Cited in

(10)

• On infeasibility of systems of convex analytic inequalities
• Feasible partition problem in reverse convex and convex mixed-integer programming
• On minimal valid inequalities for mixed integer conic programs
• A simple test for integer programming problems with bounded integer variables
• A General Framework for the Analysis of Sets of Constraints
• scientific article; zbMATH DE number 165561 (Why is no real title available?)
• Feasibility in reverse convex mixed-integer programming
• Irreducible infeasible sets in convex mixed-integer programs
• Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
• Unboundedness in reverse convex and concave integer programming

This page was built for publication: Minimal infeasible constraint sets in convex integer programs

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