Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...

Lifting is a procedure for deriving strong valid inequalities for a closed set from inequalities that are valid for its lower dimensional restrictions. It is arguably one of the most effective ways of strengthening linear programming relaxations of 0–1 programming problems. Wolsey (1977) and Gu et al. (2000) show that superadditive lifting functions lead to sequence independent lifting of valid...

Combinatorial optimization over continuous and integer variables was proposed recently as an useful tool for solving complex optimal control problems for linear hybrid dynamical systems formulated in discretetime. Current approaches are based on mixed-integer linear/quadratic programming (MIP), which provides the solution after solving a sequence of relaxed standard linear (or quadratic) progra...

In hybrid solvers for combinatorial optimization, combining Constraint (Logic) Programming (CLP) and Mixed Integer Programming (MIP), it is important to have tight connections between the two domains. We extend and generalize previous work on automatic linearizations and propagation of symbolic CLP constraints that cross the boundary between CLP and MIP. We also present how reduced costs from t...

The IDP knowledge base system currently usesMiniSAT(ID) as its backend Constraint Programming (CP) solver. A few similar systems have used a Mixed Integer Programming (MIP) solver as backend. However, so far little is known about when the MIP solver is preferable. This paper explores this question. It describes the use of CPLEX as a backend for IDP and reports on experiments comparing both back...

We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems. This approach solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. New strategies are proposed for uncovering feasible and high-quality solutions and exten...

In this paper, we consider mixed integer linear programming (MIP) formulations for piecewise linear functions (PLFs) that are evaluated when an indicator variable is turned on. We describe modifications to standard MIP formulations for PLFs with desirable theoretical properties and superior computational performance in this context. © 2013 Elsevier B.V. All rights reserved.

This paper provides a corrected formulation to the mixed integer programming model proposed by Aydogan et al. (2012) [1]. They proposed a genetic algorithm to learn fuzzy rules for a fuzzy rule-based classification system and developed a Mixed Integer Programming model (MIP) to prune the generated rules by selecting the best set of rules to maximize predictive accuracy. However, their proposed ...

This paper considers a bi-objective mathematical model for locations of landfills, transfer stations and material recovery facilities (MRFs) in order to serve the entire regions and simultaneously identify the capacities of landfills. This is a mixed-integer programming (MIP) model, whose objectives are to minimize the total cost and pollution simultaneously. To validate the model, a numerical ...

The ‘Progressive Party Problem’ [9] has long been considered a problem intractable for branch-and-bound mixed integer solvers. Quite impressive results have been reported with constraint programming systems for this problem. As a result the problem has become a standard example in texts on constraint programming. Fortunately, there has been progress in the mixed integer programming arena: we ca...