Feasible partition problem in reverse convex and convex mixed-integer programming

DOI10.1016/J.EJOR.2013.10.041zbMATH Open1305.90332OpenAlexW2046321731MaRDI QIDQ2256208FDOQ2256208

Authors W. T. Obuchowska 

Publication date 19 February 2015

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2013.10.041

zbMATH Keywords

integer programminginfeasibilityfeasible partition and maximal consistent partition problemreverse convex and convex constraints

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Feasibility in reverse convex mixed-integer programming
• Some efficiently solvable problems over integer partition polytopes
• scientific article; zbMATH DE number 3954650
• Disjunctive programming: Properties of the convex hull of feasible points
• Global minimization of a concave function subject to mixed linear and reverse convex constraints

Cites Work

• scientific article; zbMATH DE number 4089320 (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 557207 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (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 Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• A Frank--Wolfe type theorem for convex polynomial programs
• A level set algorithm for a class of reverse convex programs
• A new polynomial-time algorithm for linear programming
• Analyzing infeasible nonlinear programs
• Conditions for boundedness in concave programming under reverse convex and convex constraints
• Consistency, redundancy, and implied equalities in linear systems
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Feasibility in reverse convex mixed-integer programming
• Handbook of global optimization
• Handbook of global optimization. Vol. 2
• Infeasibility analysis for systems of quadratic convex inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Methods for Global Concave Minimization: A Bibliographic Survey
• Minimal infeasible constraint sets in convex integer programs
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• 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 the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
• Reverse convex programming
• Some results concerning post-infeasibility analysis
• Systems of distinct representatives and linear algebra
• The MIN PFS problem and piecewise linear model estimation
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• 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 (3)

• Feasibility in reverse convex mixed-integer programming
• A polyhedral characterization of the inverse-feasible region of a mixed-integer program
• Irreducible infeasible sets in convex mixed-integer programs

This page was built for publication: Feasible partition problem in reverse convex and convex mixed-integer programming

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