Results 1  10
of
28
Review of nonlinear mixedinteger and disjunctive programming techniques
 Optimization and Engineering
, 2002
"... This paper has as a major objective to present a unified overview and derivation of mixedinteger nonlinear programming (MINLP) techniques, Branch and Bound, OuterApproximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are ex ..."
Abstract

Cited by 55 (15 self)
 Add to MetaCart
This paper has as a major objective to present a unified overview and derivation of mixedinteger nonlinear programming (MINLP) techniques, Branch and Bound, OuterApproximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are expressed in algebraic form. The solution of MINLP problems with convex functions is presented first, followed by a brief discussion on extensions for the nonconvex case. The solution of logic based representations, known as generalized disjunctive programs, is also described. Theoretical properties are presented, and numerical comparisons on a small process network problem.
Mixed Logical/Linear Programming
 Discrete Applied Mathematics
, 1996
"... Mixed logical/linear programming (MLLP) is an extension of mixed integer/linear programming (MILP). It represents the discrete elements of a problem with logical propositions and provides a more natural modeling framework than MILP. It can also have computational advantages, partly because it elimin ..."
Abstract

Cited by 33 (10 self)
 Add to MetaCart
Mixed logical/linear programming (MLLP) is an extension of mixed integer/linear programming (MILP). It represents the discrete elements of a problem with logical propositions and provides a more natural modeling framework than MILP. It can also have computational advantages, partly because it eliminates integer variables when they serve no purpose, provides alternatives to the traditional continuous relaxation, and applies logic processing algorithms. This paper surveys previous work and attempts to organize ideas associated with MLLP, some old and some new, into a coherent framework. It articulates potential advantages and disadvantages of MLLP and illustrates some of them with computational experiments. 1 Introduction Mixed logical/linear programming (MLLP) is a general approach to formulating and solving optimization problems that have both discrete and continuous elements. Mixed integer/linear programming (MILP), the traditional approach, is effective in many instances. But it unn...
LiftandProject for Mixed 01 Programming: Recent Progress
, 1999
"... Contents 1 Introduction 2 Disjunctive programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Two basic ideas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Compact Representation of the Convex Hull 3 Projection and polarity . . . . . . . . . ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Contents 1 Introduction 2 Disjunctive programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Two basic ideas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Compact Representation of the Convex Hull 3 Projection and polarity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Adjacency on the higher dimensional polyhedron . . . . . . . . . . . . . . . . . . 5 3 Sequential Convexication 7 Disjunctive rank . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Fractionality of intermediate points . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4 Another Derivation of the Basic Results 12 5 Generating Cuts 13 Deepest cuts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Cut lifting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Cut strengthening . . . . . . . .
Logic, Optimization, and Constraint Programming
 INFORMS Journal on Computing
, 2000
"... Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in di#erent ways, and how these ways can be combined. It sketches the intellectual background for recent e#orts at integration. In particular, it traces the history of logicbased methods in optimization and the development of constraint programming in artificial intelligence. It concludes with a review of recent research, with emphasis on schemes for integration, relaxation methods, and practical applications. Optimization and constraint programming are beginning to converge, despite their very di#erent origins. Optimization is primarily associated with mathematics and engineering, while constraint programming developed much more recently in the computer science an...
Modeling of Discrete/Continuous Optimization Problems: Characterization and Formulation of Disjunctions and their Relaxations
, 2002
"... Abstract. This paper addresses the relaxations in alternative models for disjunctions, bigM and convex hull model, in order to develop guidelines and insights when formulating MixedInteger NonLinear Programming (MINLP), Generalized Disjunctive Programming (GDP), or hybrid models. Characterization ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract. This paper addresses the relaxations in alternative models for disjunctions, bigM and convex hull model, in order to develop guidelines and insights when formulating MixedInteger NonLinear Programming (MINLP), Generalized Disjunctive Programming (GDP), or hybrid models. Characterization and properties are presented for various types of disjunctions. An interesting result is presented for improper disjunctions where results in the continuous space differ from the ones in the mixedinteger space. A cutting plane method is also proposed that avoids the explicit generation of equations and variables of the convex hull. Several examples are presented throughout the paper, as well as a small process synthesis problem, which is solved with the proposed cutting plane method.
Solving Integer and Disjunctive Programs by LiftandProject (Extended Abstract)
, 1998
"... ) Sebasti'an Ceria 1 and G'abor Pataki 2 ? 1 Graduate School of Business and Computational Optimization Research Center Columbia University, New York, NY 10027 sebas@cumparsita.gsb.columbia.edu, http://www.columbia.edu/~sc244 2 Department of Industrial Engineering and Operations Research and ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
) Sebasti'an Ceria 1 and G'abor Pataki 2 ? 1 Graduate School of Business and Computational Optimization Research Center Columbia University, New York, NY 10027 sebas@cumparsita.gsb.columbia.edu, http://www.columbia.edu/~sc244 2 Department of Industrial Engineering and Operations Research and Computational Optimization Research Center Columbia University, New York, NY 10027 gabor@ieor.columbia.edu, http://www.ieor.columbia.edu/~gabor Abstract. We extend the theoretical foundations of the branchandcut method using liftandproject cuts for a broader class of disjunctive constraints, and also present a new, substantially improved disjunctive cut generator. Employed together with an efficient commercial MIP solver, our code is a robust, general purpose method for solving mixed integer programs. We present extensive computational experience with the most difficult problems in the MIPLIB library. 1 Introduction Disjunctive programming is optimization over a finite union of convex ...
BranchandCut for Combinatorial Optimization Problems without Auxiliary Binary Variables
 KNOWLEDGE ENGINEERING REVIEW
, 2001
"... Many optimization problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems have been modeled a ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Many optimization problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems have been modeled as mixedinteger programs by introducing auxiliary binary variables and additional constraints. Because the number of variables and constraints becomes larger and the combinatorial structure is not used to advantage, these mixedinteger programming models may not be solved satisfactorily, except for small instances. Traditionally, constraint programming approaches to such problems keep and use the combinatorial structure, but do not use linear programming bounds in the search for an optimal solution. Here we present a branchandcut approach that considers the combinatorial constraints without the introduction of binary variables. We review the development of this approach and show how strong constraints can be derived using ideas from polyhedral combinatorics. To illustrate the ideas, we present a production scheduling model that arises in the manufacture of fiber optic cables.
Venn Sampling: A Novel Prediction Technique for Moving Objects
 In ICDE
, 2005
"... Given a region qR and a future timestamp qT, a “range aggregate ” query estimates the number of objects expected to appear in qR at time qT. Currently the only methods for processing such queries are based on spatiotemporal histograms, which have several serious problems. First, they consume conside ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Given a region qR and a future timestamp qT, a “range aggregate ” query estimates the number of objects expected to appear in qR at time qT. Currently the only methods for processing such queries are based on spatiotemporal histograms, which have several serious problems. First, they consume considerable space in order to provide accurate estimation. Second, they incur high evaluation cost. Third, their efficiency continuously deteriorates with time. Fourth, their maintenance requires significant update overhead. Motivated by this, we develop Venn sampling (VS), a novel estimation method optimized for a set of “pivot queries ” that reflect the distribution of actual ones. In particular, given m pivot queries, VS achieves perfect estimation with only O(m) samples, as opposed to O(2 m) required by the current state of the art in workloadaware sampling. Compared with histograms, our technique is much more accurate (given the same space), produces estimates with negligible cost, and does not deteriorate with time. Furthermore, it permits the development of a novel “querydriven ” update policy, which reduces the update cost of conventional policies significantly. 1.
MixedInteger Nonlinear Optimization in Process Synthesis
, 1998
"... The use of networks allows the representation of a variety of important engineering problems. The treatment of a particular class of network applications, the process synthesis problem, is exposed in this paper. Process Synthesis seeks to develop systematically process flowsheets that convert raw ma ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The use of networks allows the representation of a variety of important engineering problems. The treatment of a particular class of network applications, the process synthesis problem, is exposed in this paper. Process Synthesis seeks to develop systematically process flowsheets that convert raw materials into desired products. In recent years, the optimization approach to process synthesis has shown promise in tackling this challenge. It requires the development of a network of interconnected units, the process superstructure, that represents the alternative process flowsheets. The mathematical modeling of the superstructure has a mixed set of binary and continuous variables and results in a mixedinteger optimization model. Due to the nonlinearity of chemical models, these problems are generally classified as MixedInteger Nonlinear Programming (MINLP) problems. A number of local optimization algorithms, developed for the solution of this class of problems, are presented in this pap...
Facets of the complementarity knapsack polytope
 Mathematics of Operations Research
, 1998
"... We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alt ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alternative approach, in which we keep in the model only the continuous variables, and we tighten the model by introducing inequalities that define facets of the convex hull of the set of feasible solutions in the space of the continuous variables. To obtain the facetdefining inequalities, we extend the concepts of cover and cover inequality, commonly used in 01 programming, for this problem, and we show how to sequentially lift cover inequalities. We obtain tight bounds for the lifting coefficients, and we present two families of facetdefining inequalities that can be derived by lifting cover inequalities. We show that unlike 01 knapsack polytopes, in which different facetdefining inequalities can be derived by fixing variables at 0 or 1, and then sequentially lifting cover inequalities valid for the projected polytope, any sequentially lifted cover inequality for the complementarity