A principled approach to mixed integer/linear problem formulation (original) (raw)
Related papers
Mixed-Integer Linear Programming Formulations
In this chapter, (mixed-)integer linear programming formulations of the resource-constrained project scheduling problem are presented. Standard formulations from the literature and newly proposed formulations are classified according to their size in function of the input data. According to this classification, compact models (of polynomial size), pseudo-polynomial sized models, and formulations of exponential size are presented. A theoretical and experimental comparison of these formulations is then given. The complementarity of the formulations for different usages is finally discussed and directions for future work, such as hybridization with other methods, are given.
Mixed Integer Linear Programming Formulation Techniques
SIAM Review, 2015
A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP) problems using standard formulation techniques. However, in some cases the resulting MIP can be either too weak or too large to be effectively solved by state of the art solvers. In this survey we review advanced MIP formulation techniques that result in stronger and/or smaller formulations for a wide class of problems.
Coefficient Strengthening: A Tool for Formulating Mixed Integer Programs
SSRN Electronic Journal, 2000
Providing a good formulation is an important part of solving a mixed integer program. We suggest to measure the quality of a formulation by whether it is possible to strengthen the coefficients of the formulation. Sequentially strengthening coefficients can then be used as a tool for improving formulations. We believe this method could be useful for analyzing and producing tight formulations of problems that arise in practice. We illustrate the use of the approach on a problem in production scheduling. We also prove that coefficient strengthening leads to formulations with a desirable property: if no coefficient can be strengthened, then no constraint can be replaced by an inequality that dominates it. The effect of coefficient strengthening is tested on a number of problems in a computational experiment. The strengthened formulations are compared to reformulations obtained by the preprocessor of a commercial software package. For several test problems, the formulations obtained by coefficient strengthening are substantially stronger than the formulations obtained by the preprocessor. In particular, we use coefficient strengthening to solve two difficult problems to optimality that have only recently been solved.
Coefficient strengthening: a tool for reformulating mixed-integer programs
Mathematical Programming, 2010
Providing a good formulation is an important part of solving a mixed integer program. We suggest to measure the quality of a formulation by whether it is possible to strengthen the coefficients of the formulation. Sequentially strengthening coefficients can then be used as a tool for improving formulations. We believe this method could be useful for analyzing and producing tight formulations of problems that arise in practice. We illustrate the use of the approach on a problem in production scheduling. We also prove that coefficient strengthening leads to formulations with a desirable property: if no coefficient can be strengthened, then no constraint can be replaced by an inequality that dominates it. The effect of coefficient strengthening is tested on a number of problems in a computational experiment. The strengthened formulations are compared to reformulations obtained by the preprocessor of a commercial software package. For several test problems, the formulations obtained by coefficient strengthening are substantially stronger than the formulations obtained by the preprocessor. In particular, we use coefficient strengthening to solve two difficult problems to optimality that have only recently been solved.
2005
We consider the resource availability cost problem and two extensions through general temporal constraints and calendar constraints. With general temporal constraints minimum and maximum time lags between the activities can be ensured. Calendar constraints are used to model breaks in the availability of a resource, e.g., weekends or public holidays of resource types that equal staff. Especially if long-term and capital-intensive projects are under consideration, resource availability cost problems should be applied because in such projects it is more important to minimize the cost than, e.g., the project duration. We present mixed-integer linear programming (MILP) formulations as well as constraint programming (CP) models for the three problems. In a performance study we compare the results of the MILP formulations solved by cplex and the CP models solved by the lazy clause generation solver chuffed on benchmark instances from literature and also introduce new benchmarks. Our CP models close all open instances for resource availability cost problems from the literature.
Constraint Integer Programming: Techniques and Applications
2008
This article introduces constraint integer programming (CIP), which is a novel way to combine constraint programming (CP) and mixed integer programming (MIP) methodologies. CIP is a generalization of MIP that supports the notion of general constraints as in CP. This ap- proach is supported by the CIP framework SCIP, which also integrates techniques for solving satisability problems. SCIP is available
Formulating Integer Linear Programs: A Rogues' Gallery
INFORMS Transactions on Education, 2007
The art of formulating linear and integer linear programs is, well, an art: It is hard to teach, and even harder to learn. To help demystify this art, we present a set of modeling building blocks that we call "formulettes." Each formulette consists of a short verbal description that must be expressed in terms of variables and constraints in a linear or integer linear program. These formulettes can better be discussed and analyzed in isolation from the much more complicated models they comprise. Not all models can be built from the formulettes we present. Rather, these are chosen because they are the most frequent sources of mistakes. We also present Naval Postgraduate School (NPS) format; a define-before-use formulation guide we have followed for decades to express a complete formulation.
Knowledge engineering mixed-integer linear programming: constraint typology
ArXiv, 2021
In this paper, we investigate the constraint typology of mixed-integer linear programming (MILP) formulations. MILP is a commonly used mathematical programming technique for modelling and solving real-life scheduling, routing, planning, resource allocation, timetabling optimization problems, providing optimized business solutions for industry sectors such as: manufacturing, agriculture, defence, healthcare, medicine, energy, finance, and transportation. Despite the numerous real-life Combinatorial Optimization Problems found and solved, and millions yet to be discovered and formulated, the number of types of constraints (the building blocks of a MILP) is relatively much smaller. In the search of a suitable machine readable knowledge representation for MILPs, we propose an optimization modelling tree built based upon an MILP ontology that can be used as a guidance for automated systems to elicit an MILP model from end-users on their combinatorial business optimization problems. Our u...
A note on reducing the number of variables in integer programming problems
Computational Optimization and Applications, 1997
A necessary and sufficient condition for identification of dominated columns, which correspond to one type of redundant integer variables, in the matrix of a general Integer Programming problem, is derived. The given condition extends our recent work on eliminating dominated integer variables in Knapsack problems, and revises a recently published procedure for reducing the number of variables in general Integer Programming problems given in the literature. A report on computational experiments for one class of large scale Knapsack problems, illustrating the function of this approach, is included.
Contributions to general mixed integer knapsack problems
Preprint SC, 1997
This paper deals with a general mixed integer knapsack polyhedron for which we introduce and analyze a new family of inequalities. We discuss the value of this family both from a theoretic and a computational point of view.