Representability in mixed integer programming. I: Characterization results

DOI10.1016/0166-218X(87)90026-6zbMath0618.90069MaRDI QIDQ1089258

Robert G. Jeroslow

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear relaxationdisjunctive methodsrepresentation of a set

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (35)

Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ On the Mixed Binary Representability of Ellipsoidal Regions ⋮ Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints ⋮ Mixed-Integer Convex Representability ⋮ A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Shapes and recession cones in mixed-integer convex representability ⋮ A solution algorithm for chance-constrained problems with integer second-stage recourse decisions ⋮ A hierarchy of relaxations for linear generalized disjunctive programming ⋮ Logic cuts for multilevel generalized assignment problems. ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations ⋮ Single-facility scheduling by logic-based Benders decomposition ⋮ Constructing integer programming models by the predicate calculus ⋮ Mixed logical-linear programming ⋮ New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints ⋮ An enhanced logarithmic method for signomial programming with discrete variables ⋮ Lift-and-project for mixed 0-1 programming: recent progress ⋮ Modeling disjunctive constraints with a logarithmic number of binary variables and constraints ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones ⋮ Ellipsoidal mixed-integer representability ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables ⋮ On the structure of linear programs with overlapping cardinality constraints ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Modelling either-or relations in integer programming ⋮ Characterizations of mixed binary convex quadratic representable sets ⋮ Representability of functions ⋮ Combining leximax fairness and efficiency in a mathematical programming model ⋮ Formulating logical implications in combinatorial optimisation ⋮ Logic cuts for processing networks with fixed charges ⋮ Nonlinear chance-constrained problems with applications to hydro scheduling ⋮ Projection, lifting and extended formulation integer and combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive characterizations of the value function of a mixed-integer program. II
• Foundations of optimization
• Mixed integer minimization models for piecewise-linear functions of a single variable
• A converse for disjunctive constraints
• Integer programming formulation of combinatorial optimization problems
• Representations of unbounded optimization problems as integer programs
• Representability of functions
• Elementare Theorie der konvexen Polyeder
• Integer and mixed-integer programming models: General properties
• Some polyhedra related to combinatorial problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Modelling with integer variables
• Experimental Results on the New Techniques for Integer Programming Formulations
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Rational Mixed-Integer and Polyhedral Union Minimization Models
• On Cutting Planes
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• A theoretical and computational comparison of “equivalent” mixed-integer formulations
• The value function of an integer program
• On the existence of optimal solutions to integer and mixed-integer programming problems
• New results on equivalent integer programming formulations
• Multicommodity Distribution System Design by Benders Decomposition
• Experiments in mixed-integer linear programming using pseudo-costs
• Polyhedral annexation in mixed integer and combinatorial programming
• Branch and Bound Methods for Mathematical Programming Systems
• Disjunctive Programming
• Trivial integer programs unsolvable by branch-and-bound
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Discrete-Variable Extremum Problems
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs

This page was built for publication: Representability in mixed integer programming. I: Characterization results