Results 11  20
of
40
Exact Arithmetic at Low Cost  a Case Study in Linear Programming
 Computational Geometry  Theory and Applications
, 1999
"... We describe a new exactarithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is an implementation of the simplex method which combines exact (multiple precision) arithmetic with inexact (floating point ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
We describe a new exactarithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is an implementation of the simplex method which combines exact (multiple precision) arithmetic with inexact (floating point) arithmetic, where the number of exact arithmetic operations is small and usually bounded by a function of min(n; m). Combining this with a "partial pricing" scheme (based on a result by Clarkson [8]) which is particularly tuned for the problems under consideration, we obtain a correct and practically efficient algorithm that even competes with the inexact stateoftheart solver CPLEX 1 for small values of min(n; m) and and is far superior to methods that use exact arithmetic in any operation. 1 Introduction Linear Programming (LP)  the problem of maximizing a linear objective function in n variables subject to m linear (in)equality constraints  is the most prominent optimization ...
A Survey on Pivot Rules for Linear Programming
 ANNALS OF OPERATIONS RESEARCH. (SUBMITTED
, 1991
"... The purpose of this paper is to survey the various pivot rules of the simplex method or its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with the finiteness property of simplex type pivot rules. Th ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The purpose of this paper is to survey the various pivot rules of the simplex method or its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with the finiteness property of simplex type pivot rules. There are some other important topics in linear programming, e.g. complexity theory or implementations, that are not included in the scope of this paper. We do not discuss ellipsoid methods nor interior point methods. Well known classical results concerning the simplex method are also not particularly discussed in this survey, but the connection between the new methods and the classical ones are discussed if there is any. In this paper we discuss three classes of recently developed pivot rules for linear programming. The first class (the largest one) of the pivot rules we discuss is the class of essentially combinatorial pivot rules. Namely these rules only use labeling and signs of the variab...
Degeneracy in Interior Point Methods for Linear Programming
, 1991
"... ... In this paper, we survey the various theoretical and practical issues related to degeneracy in IPM's for linear programming. We survey results which for the most part already appeared in the literature. Roughly speaking, we shall deal with four topics: the effect of degeneracy on the conver ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
... In this paper, we survey the various theoretical and practical issues related to degeneracy in IPM's for linear programming. We survey results which for the most part already appeared in the literature. Roughly speaking, we shall deal with four topics: the effect of degeneracy on the convergence of IPM's, on the trajectories followed by the algorithms, the effect of degeneracy in numerical performance, and on finding basic solutions.
A Column Generation Approach to Bus Driver Scheduling
, 1996
"... This paper outlines an alternative solution method which has been incorporated into a system which originated from IMPACS. Improved results on a selection of real bus driver problems are presented. THE DRIVER SCHEDULING PROBLEM ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
This paper outlines an alternative solution method which has been incorporated into a system which originated from IMPACS. Improved results on a selection of real bus driver problems are presented. THE DRIVER SCHEDULING PROBLEM
Parallelizing the Dual Simplex Method
, 1995
"... We study the parallelization of the steepestedge version of the dual simplex ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We study the parallelization of the steepestedge version of the dual simplex
A Homogenized Cutting Plane Method To Solve The Convex Feasibility Problem
, 1999
"... : We present a cutting plane algorithm for the feasibility problem that uses a homogenized selfdual approach to regain an approximate center when adding a cut. The algorithm requires a fully polynomial number of Newton steps. One novelty in the analysis of the algorithm is the use of a powerful pro ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
: We present a cutting plane algorithm for the feasibility problem that uses a homogenized selfdual approach to regain an approximate center when adding a cut. The algorithm requires a fully polynomial number of Newton steps. One novelty in the analysis of the algorithm is the use of a powerful proximity measure which is widely used in interior point methods but not previously used in the analysis of cutting plane methods. Moreover, a practical implementation of a variant of the homogenized cutting plane for solution of LPs is presented. Computational results with this implementation show that it is possible to solve a problem having several thousand constraints and about one million variables on a standard PC in a moderate amount of time. Key words: Interiorpoint, Homogeneous, cutting plane, setpartitioning. Permanent address: Math Sciences, RPI, Troy NY 12180, USA. Supported in part by fellowships from NWO and TU Delft 1 2 1 INTRODUCTION We are trying to nd a point y in a...
A.: Duty scheduling in public transit
 MATHEMATICS—Key Technology for the Future
, 2003
"... Abstract. This article is about adaptive column generation techniques for the solution of duty scheduling problems in public transit. The current optimization status is exploited in an adaptive approach to guide the subroutines for duty generation, LP resolution, and schedule construction toward rel ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This article is about adaptive column generation techniques for the solution of duty scheduling problems in public transit. The current optimization status is exploited in an adaptive approach to guide the subroutines for duty generation, LP resolution, and schedule construction toward relevant parts of 9. large problem. Computational results for three European scenarios are reported. 1
A Formal Description of the Transportation Problem
, 1992
"... In this paper we provide a compact, formal description for an important class of problems involving the deployment of diverse equipment (e.g., planes, ships, trucks) to transport cargo (e.g., personnel and material) throughout large geographical areas for private, government, and military purposes. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper we provide a compact, formal description for an important class of problems involving the deployment of diverse equipment (e.g., planes, ships, trucks) to transport cargo (e.g., personnel and material) throughout large geographical areas for private, government, and military purposes. The problem is particularly interesting for its combination of static and dynamic sources of complexity, and the fact that it allows and in some cases strongly encourages distributed solutions. The merit of this formalization is shown by its application to both understanding the complexities in existing restricted transportation problems and creating new natural restrictions on the general problem. Starting from the general formulation we are able to isolate the static and dynamic sources of complexity in transportation problems and relate them to existing research in computer science and operations research. In addition, we describe techniques for constructing algorithms for the transportat...
A Decision Support System for Crew Planning in Passenger Transportation using a Flexible BranchandPrice Algorithm
 ComputerAided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems
, 2001
"... This paper discusses a decision support system for airline and railway crew planning. The system is a stateoftheart branchandprice solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the Opera ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper discusses a decision support system for airline and railway crew planning. The system is a stateoftheart branchandprice solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the Operations Research literature. Crew scheduling is crew planning for one or a few days that results in crew duties or pairings, and crew rostering is crew planning for at least one week for individual crew members. Technical issues about the system and its implementation are covered in more detail, as well as several applications. In particular, we focus on a specific aircrew rostering application. The computational results contain an interesting comparison of results obtained with, on one hand, the approach in which crew scheduling is carried out before crew rostering, and, on the other hand, an approach in which these two planning problems are solved in an integrated manner.
Computational and economic limitations of dispatch operations in the nextgeneration power grid. IEEE Conference on Innovative Technologies for and Efficient and Reliable Power Supply, 2010. Aswin Kannan is a predoctoral researcher in the Mathematics and C
"... Abstract—We study the interactions between computational and economic performance of dispatch operations under highly dynamic environments. In particular, we discuss the need for extending the forecast horizon of the dispatch formulation in order to anticipate steep variations of renewable power and ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We study the interactions between computational and economic performance of dispatch operations under highly dynamic environments. In particular, we discuss the need for extending the forecast horizon of the dispatch formulation in order to anticipate steep variations of renewable power and highly elastic loads. We present computational strategies to solve the increasingly larger optimization problems in real time. To illustrate the developments, we use a detailed dispatch model of the entire Illinois system with outofstate wind generation. Power [MW]