Results 1  10
of
22
Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice
, 2001
"... After several decades of sustained research and testing, linear programming has evolved into a remarkably reliable, accurate and useful tool for handling industrial optimization problems. Yet, large problems arising from several concrete applications routinely defeat the very best linear programming ..."
Abstract

Cited by 69 (4 self)
 Add to MetaCart
After several decades of sustained research and testing, linear programming has evolved into a remarkably reliable, accurate and useful tool for handling industrial optimization problems. Yet, large problems arising from several concrete applications routinely defeat the very best linear programming codes, running on the fastest computing hardware. Moreover, this is a trend that may well continue and intensify, as problem sizes escalate and the need for fast algorithms becomes more stringent. Traditionally, the focus in optimization algorithms, and in particular, in algorithms for linear programming, has been to solve problems "to optimality." In concrete implementations, this has always meant the solution ofproblems to some finite accuracy (for example, eight digits). An alternative approach would be to explicitly, and rigorously, trade o# accuracy for speed. One motivating factor is that in many practical applications, quickly obtaining a partially accurate solution is much preferable to obtaining a very accurate solution very slowly. A secondary (and independent) consideration is that the input data in many practical applications has limited accuracy to begin with. During the last ten years, a new body ofresearch has emerged, which seeks to develop provably good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context ofthe modern theory ofalgorithms. The result ofthis work has been a family ofalgorithms with solid theoretical foundations and with growing experimental success. In this manuscript we will study these algorithms, starting with some ofthe very earliest examples, and through the latest theoretical and computational developments.
BundleBased Relaxation Methods For Multicommodity Capacitated Fixed Charge Network Design
, 1999
"... To efficiently derive bounds for largescale instances of the capacitated fixedcharge network design problem, Lagrangian relaxations appear promising. This paper presents the results of comprehensive experiments aimed at calibrating and comparing bundle and subgradient methods applied to the optimi ..."
Abstract

Cited by 44 (25 self)
 Add to MetaCart
To efficiently derive bounds for largescale instances of the capacitated fixedcharge network design problem, Lagrangian relaxations appear promising. This paper presents the results of comprehensive experiments aimed at calibrating and comparing bundle and subgradient methods applied to the optimization of Lagrangian duals arising from two Lagrangian relaxations. This study substantiates the fact that bundle methods appear superior to subgradient approaches because they converge faster and are more robust relative to different relaxations, problem characteristics, and selection of the initial parameter values. It also demonstrates that effective lower bounds may be computed efficiently for largescale instances of the capacitated fixedcharge network design problem. Indeed, in a fraction of the time required by a standard simplex approach to solve the linear programming relaxation, the methods we present attain very high quality solutions.
A specialized interiorpoint algorithm for multicommodity network flows
 SIAM J. on Optimization
, 1996
"... Abstract. Despite the efficiency shown by interiorpoint methods in largescale linear programming, they usually perform poorly when applied to multicommodity flow problems. The new specialized interiorpoint algorithm presented here overcomes this drawback. This specialization uses both a precondit ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
Abstract. Despite the efficiency shown by interiorpoint methods in largescale linear programming, they usually perform poorly when applied to multicommodity flow problems. The new specialized interiorpoint algorithm presented here overcomes this drawback. This specialization uses both a preconditioned conjugate gradient solver and a sparse Cholesky factorization to solve a linear system of equations at each iteration of the algorithm. The ad hoc preconditioner developed by exploiting the structure of the problem is instrumental in ensuring the efficiency of the method. An implementation of the algorithm is compared to stateoftheart packages for multicommodity flows. The computational experiments were carried out using an extensive set of test problems, with sizes of up to 700,000 variables and 150,000 constraints. The results show the effectiveness of the algorithm.
Algorithms for discrete and continuous multicommodity flow network interdiction problems
 IIE Transactions
, 2006
"... The authors also thank two anonymous referees and an Associate Editor for their remarks, which improved the presentation of this paper. We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum p ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
The authors also thank two anonymous referees and an Associate Editor for their remarks, which improved the presentation of this paper. We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum profit that can be obtained from shipping commodities across the network. The attacker is assumed to have some budget for destroying (or “interdicting”) arcs, and each arc is associated with a positive interdiction expense. In this paper, we examine problems in which interdiction must be discrete (i.e., each arc must either be left alone or completely destroyed), and in which interdiction can be continuous (the capacities of arcs may be partially reduced). For the discrete problem, we describe a linearized model for optimizing network interdiction that is similar to previous studies in the field, and compare it to a penalty model that does not require linearization constraints. For the continuous case, we prescribe an optimal partitioning algorithm along with a heuristic procedure for estimating the optimal objective function value. We demonstrate on a set of randomly generated test data that our penalty model for the discrete interdiction problem significantly reduces computational time when compared to that consumed by the linearization model. 1
A Computational Study of Cost Reoptimization for Min Cost Flow Problems
 INFORMS JOURNAL ON COMPUTING
, 2003
"... In the last two decades, a number of algorithms for the linear singlecommodity Min Cost Flow problem (MCF) have been proposed, and several efficient codes are available that implement different variants of the algorithms. The practical significance of the algorithms has been tested by comparing the ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
In the last two decades, a number of algorithms for the linear singlecommodity Min Cost Flow problem (MCF) have been proposed, and several efficient codes are available that implement different variants of the algorithms. The practical significance of the algorithms has been tested by comparing the time required by their implementations for solving "from scratch" instances of (MCF), of different classes, as the size of the problem (number of nodes and arcs) increases. However, in many applications several closely related instances of (MCF) have to be sequentially solved, so that reoptimization techniques can be used to speed up computations, and the most attractive algorithm is the one which minimizes the total time required to solve all the instances in the sequence. In this paper we compare the performances of four different efficient implementations of algorithms for (MCF) under cost reoptimization in the context of decomposition algorithms for the Multicommodity Min Cost Flow problem (MMCF), showing that for some classes of instances the relative performances of the codes doing "from scratch" optimization do not accurately predict the relative performances when reoptimization is used. Since the best solver depends both on the class and on the size of the instance, this work also shows the usefulness of a standard interface for (MCF) problem solvers that we have proposed and implemented.
Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit Commitment
 IEEE Transactions on Power Systems
, 2003
"... Abstract—The paper presents a simple and effective Lagrangian relaxation approach for the solution of the optimal shortterm unit commitment problem in hydrothermal powergeneration systems. The proposed approach, based on a disaggregated Bundle method for the solution of the dual u spinning reserve ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
Abstract—The paper presents a simple and effective Lagrangian relaxation approach for the solution of the optimal shortterm unit commitment problem in hydrothermal powergeneration systems. The proposed approach, based on a disaggregated Bundle method for the solution of the dual u spinning reserves Rt in each period t. Irows Tcolumns matrix, whose rows are the Tdimensional arrays ui of the 01 variables ui,t indicating the commitment state of thermal unit i during period t. problem, with a new warmstarting procedure, achieves accurate solutions in few iterations. The adoption of a disaggregated Bundle method not only improves the convergence of the proposed approach but also provides information that are suitably exploited for generating a feasible solution of the primal pI pH Irows Tcolumns matrix, whose rows are the Tdimensional arrays pi of production levels pi,t of thermal unit i during each period t. Hrows Tcolumns matrix, whose rows are problem and for obtaining an optimal hydro scheduling. A the Tdimensional arrays ph of production comparison between the proposed Lagrangian approach and other ones, based on subgradient and Bundle methods, is presented for a simple yet reasonable formulation of the Hydrothermal Unit Commitment problem. Index Terms—Power generation operation, Hydrothermal unit
New Approaches for Optimizing OVER THE SEMIMETRIC POLYTOPE
, 2004
"... The semimetric polytope is an important polyhedral structure lying at the heart of hard combinatorial problems. Therefore, linear optimization over the semimetric polytope is crucial for a number of relevant applications. Building on some recent polyhedral and algorithmic results about a related pol ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
The semimetric polytope is an important polyhedral structure lying at the heart of hard combinatorial problems. Therefore, linear optimization over the semimetric polytope is crucial for a number of relevant applications. Building on some recent polyhedral and algorithmic results about a related polyhedron, the rooted semimetric polytope, we develop and test several approaches, mainly based over Lagrangian relaxation and application of Non Differentiable Optimization algorithms, for linear optimization over the semimetric polytope. We show that some of these approaches can obtain very accurate primal and dual solutions in a small fraction of the time required for the same task by stateoftheart general purpose linear programming technology. In some cases, good estimates of the dual optimal solution (but not of the primal solution) can be obtained even quicker.
Symmetric and Asymmetric Parallelization of a CostDecomposition Algorithm for MultiCommodity Flow Problems
 INFORMS Journal on Computing
, 1996
"... We study the coarsegrained parallelization of an efficient bundlebased costdecomposition algorithm for the solution of multicommodity mincost flow (MMCF) problems. We show that a code exploiting only the natural parallelism inherent in the costdecomposition approach, i.e., solving the mincost fl ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We study the coarsegrained parallelization of an efficient bundlebased costdecomposition algorithm for the solution of multicommodity mincost flow (MMCF) problems. We show that a code exploiting only the natural parallelism inherent in the costdecomposition approach, i.e., solving the mincost flow subproblems in parallel, obtains satisfactory efficiencies even with many processors on large, difficult MMCF problems with many commodities. This is exactly the class of instances where the decomposition approach attains its best results in sequential. The parallel code we developed is highly portable and flexible, and it can be used on different machines. We also show how to exploit a common characteristic of current supercomputer facilities, i.e., the sidetoside availability of massively parallel and vector supercomputers, to implement an asymmetric decomposition algorithm where each architecture is used for the tasks for which it is best suited.
A Parallel Implementation of an InteriorPoint Algorithm for Multicommodity Network Flows
 VECPAR 2000 : 4th International Conference
, 2000
"... A parallel implementation of the specialized interiorpoint algorithm for multicommodity network ows introduced in [5] is presented. In this algorithm, the positive denite systems of each iteration are solved through a scheme that combines direct factorization and a preconditioned conjugate grad ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A parallel implementation of the specialized interiorpoint algorithm for multicommodity network ows introduced in [5] is presented. In this algorithm, the positive denite systems of each iteration are solved through a scheme that combines direct factorization and a preconditioned conjugate gradient (PCG) method. Since the solution of at least k independent linear systems is required at each iteration of the PCG, k being the number of commodities, a coarsegrained parallellization of the algorithm naturally arises, where these systems are solved on dierent processors. Also, several other minor steps of the algorithm are easily parallelized by commodity. An extensive set of computational results on a shared memory machine is presented, using problems of up to 2.5 million variables and 260,000 constraints. The results show that the approach is especially competitive on large, dicult multicommodity ow problems. This work has been supported by the European Center for P...