ISSN:
1436-4646
Keywords:
Linear programming
;
Integer programming
;
Mixed integer programming
;
Large scale programming
;
Branch and bound
;
Triangular factorization
;
etc. Sparse matrix methods
;
Degeneracy
;
Numerical stability
;
Computational results
;
Mathematical programming language
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract First, this paper presents the results of experiments with algorithmic techniques for efficiently solving medium and large scale linear and mixed integer programming problems. The techniques presented here are either original or recent. The solution of a great number of problems has shown that efficient problem solving requires automatic adaptation of algorithmic techniques upon problem characteristics. We show when a given technique should be used for a particular problem. The last part of this paper describes an attempt to provide a powerful mathematical programming language, allowing an easy programming of specific studies on medium-size models such as the recursive use of LP or the build-up of algorithms based on the simplex method. All these features have been implemented in the IBM Mathematical Programming System, MPSX/370, and its feature MIP/370. Extensive numerical results and comparisons on real-life problems are provided and commented upon.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01584344
Permalink