11,642 research outputs found
Relaxations and Duality for Multiobjective Integer Programming
Multiobjective integer programs (MOIPs) simultaneously optimize multiple
objective functions over a set of linear constraints and integer variables. In
this paper, we present continuous, convex hull and Lagrangian relaxations for
MOIPs and examine the relationship among them. The convex hull relaxation is
tight at supported solutions, i.e., those that can be derived via a
weighted-sum scalarization of the MOIP. At unsupported solutions, the convex
hull relaxation is not tight and a Lagrangian relaxation may provide a tighter
bound. Using the Lagrangian relaxation, we define a Lagrangian dual of an MOIP
that satisfies weak duality and is strong at supported solutions under certain
conditions on the primal feasible region. We include a numerical experiment to
illustrate that bound sets obtained via Lagrangian duality may yield tighter
bounds than those from a convex hull relaxation. Subsequently, we generalize
the integer programming value function to MOIPs and use its properties to
motivate a set-valued superadditive dual that is strong at supported solutions.
We also define a simpler vector-valued superadditive dual that exhibits weak
duality but is strongly dual if and only if the primal has a unique
nondominated point
Lagrangian Relaxation for Mixed-Integer Linear Programming: Importance, Challenges, Recent Advancements, and Opportunities
Operations in areas of importance to society are frequently modeled as
Mixed-Integer Linear Programming (MILP) problems. While MILP problems suffer
from combinatorial complexity, Lagrangian Relaxation has been a beacon of hope
to resolve the associated difficulties through decomposition. Due to the
non-smooth nature of Lagrangian dual functions, the coordination aspect of the
method has posed serious challenges. This paper presents several significant
historical milestones (beginning with Polyak's pioneering work in 1967) toward
improving Lagrangian Relaxation coordination through improved optimization of
non-smooth functionals. Finally, this paper presents the most recent
developments in Lagrangian Relaxation for fast resolution of MILP problems. The
paper also briefly discusses the opportunities that Lagrangian Relaxation can
provide at this point in time
A Lagrangian relaxation approach for the multiple sequence alignment problem
We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bound at each bb node is based on a Lagrangian relaxation of an integer linear programming formulation for MSA. Dualizing certain inequalities, the Lagrangian subproblem becomes a pairwise alignment problem, which can be solved efficiently by a dynamic programming approach. Due to a reformulation w.r.t. additionally introduced variables prior to relaxation we improve the convergence rate dramatically while at the same time being able to solve the Lagrangian problem efficiently. Our experiments show that our implementation, although preliminary, outperforms all exact algorithms for the multiple sequence alignment problem
Modeling and Solving the Capacitated Network Loading Problem
This paper studies a topical and economically significant capacitated network design problem that arises in the telecommunications industry. In this problem, given point-topoint demand between various pairs of nodes of a network must be met by installing (loading) capacitated facilities on the arcs. The facilities are chosen from a small set of alternatives and loading a particular facility incurs an arc specific and facility dependent cost. The problem is to determine the configuration of facilities to be loaded on the arcs of the network that will satisfy the given demand at minimum cost. Since we need to install (load) facilities to carry the required traffic, we refer to the problem as the network loading problem. In this paper, we develop modeling and solution approaches for the problem. We consider two approaches for solving the underlying mixed integer programming model: (i) a Lagrangian relaxation strategy, and (ii) a cutting plane approach that uses three classes of valid inequalities that we identify for the problem. In particular, we show that a linear programming formulation that includes the valid inequalities always approximates the value of the mixed integer program at least as well as the Lagrangian relaxation bound (as measured by the gaps in the objective functions). We also examine the computational effectiveness of these inequalities on a set of prototypical telecommunications data. The computational results show that the addition of these inequalities considerably improves the gap between the integer programming formulation of the problem and its linear programming relaxation: for 6 - 15 node problems from an average of 25% to an average of 8%. These results show that strong cutting planes can be an effective modeling and algorithmic tool for solving problems of the size that arise in the telecommunications industry
Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding) and intermediate (work-in-process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two di erent, but closely related, Dantzig-Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig-Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two di erent lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near-optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with di erent types of strongly NP-hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near-optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), new algorithms for PBO have emerged, which are effective on highly constrained instances. However, these algorithms fail to handle effectively the information provided by the cost function of PBO. This paper addresses the integration of lower bound estimation methods with SAT-related techniques in PBO solvers. Moreover, the paper shows that the utilization of lower bound estimates can dramatically improve the overall performance of PBO solvers for most existing benchmarks from EDA. 1
A Lagrangian relaxation approach to the edge-weighted clique problem
The -clique polytope is the convex hull of the node and edge incidence vectors of all subcliques of size at most of a complete graph on nodes. Including the Boolean quadric polytope as a special case and being closely related to the quadratic knapsack polytope, it has received considerable attention in the literature. In particular, the max-cut problem is equivalent with optimizing a linear function over . The problem of optimizing linear functions over has so far been approached via heuristic combinatorial algorithms and cutting-plane methods. We study the structure of in further detail and present a new computational approach to the linear optimization problem based on Lucena's suggestion of integrating cutting planes into a Lagrangian relaxation of an integer programming problem. In particular, we show that the separation problem for tree inequalities becomes polynomial in our Lagrangian framework. Finally, computational results are presented. \u
- …