TITLE

Addendum to 'Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method.'

AUTHOR(S)
Mészáros, Csaba; Gondzio, Jacek
PUB. DATE
April 2001
SOURCE
INFORMS Journal on Computing;Spring2001, Vol. 13 Issue 2, p169
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Focuses on issues related to linear programming. Analysis of linear programs prior to the application of interior point method; Importance of presolving techniques in saving solution time; Concerns over the precision of propositions 1 and 2.
ACCESSION #
5648455

 

Related Articles

  • DIRECT USE OF EXTREMAL PRINCIPLES IN SOLVING CERTAIN OPTIMIZING PROBLEMS INVOLVING INEQUALITIES. Klein, Bertram // Journal of the Operations Research Society of America;May55, Vol. 3 Issue 2, p168 

    It is shown how extremal principles may be used in their rigorous sense to solve certain optimizing problems involving inequalities. The method applies to both linear and non-linear type problems as illustrated by the examples included in the paper, and is particularly suited for electronic...

  • A NEW SIMPLIFIED APPROACH TO THE SIMPLEX METHOD OF LINEAR PROGRAMMING. Rifai, Ahmed K.; Mehta, Anal J. // Industrial Management;Dec75, Vol. 17 Issue 12, p8 

    Presents a simplified approach to the simplex method of linear programming (LP). Consideration of LP as the most successful and frequent method used in solving problems which require the determination of an optimum value of a linear function; Presentation of a step by step procedure of the...

  • Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method. Gondzio, Jacek // INFORMS Journal on Computing;Winter97, Vol. 9 Issue 1, p73 

    Addresses issues concerning an analysis of large and sparse linear programming problems prior to solving them with an interior point based optimizer. Types of presolve procedures; Discussion of the problem of identifying and aggregating linearly dependent columns; Description of the...

  • A Note on Computational Simplifications In Solving Generalized Transportation Problems. Glover, Fred; Klingman, D. // Transportation Science;Nov73, Vol. 7 Issue 4, p351 

    Efficient techniques are given for implementing the pricing-out and change-of-basis procedures for generalized transportation problems. Our approach avoids the necessity to `parameterize' the calculations, which is the more standard procedure. In addition, we show that the pricing-out and...

  • A combined CLP-MILP approach for scheduling commodities in a pipeline. Magat�o, L.; Arruda, L.; Neves-Jr, F. // Journal of Scheduling;Feb2011, Vol. 14 Issue 1, p57 

    This paper addresses the problem of developing an optimization model to aid the operational scheduling in a real-world pipeline scenario. The pipeline connects refinery and harbor, conveying different types of commodities (gasoline, diesel, kerosene, etc.). An optimization model was developed to...

  • Numerically Safe Gomory Mixed-Integer Cuts. Cook, William; Dash, Sanjeeb; Fukasawa, Ricardo; Marcos Goycoolea // INFORMS Journal on Computing;Fall2009, Vol. 21 Issue 4, p641 

    We describe a simple process for generating numerically safe cutting planes using floating-point arithmetic and the mixed-integer rounding procedure. Applying this method to the rows of the simplex tableau permits the generation of Gomory mixed-integer cuts that are guaranteed to be satisfied by...

  • On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Censor, Yair; Chen, Wei; Combettes, Patrick; Davidi, Ran; Herman, Gabor // Computational Optimization & Applications;Apr2012, Vol. 51 Issue 3, p1065 

    The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many real-world...

  • An algorithm to zero-one integer linear fractional programming problem. Azeem, Y. A. // Journal of Advanced Research in Scientific Computing;2011, Vol. 3 Issue 3, p47 

    We designed and implement an algorithm to solve the right-hand side parametric zero-one integer linear fractional programming (ILFP) problem, that is to solve a family of zero-one ILFP problems in which the problems are related by having identical objective and matrix coefficients. Our algorithm...

  • THE SET-PARTITIONING PROBLEM: SET COVERING WITH EQUALITY CONSTRAINTS. Garfinkel, R.S.; Nemhauser, G.L. // Operations Research;Sep/Oct69, Vol. 17 Issue 5, p848 

    This paper gives an enumerative algorithm for the set-partitioning problem, that is, the set-covering problem with equality constraints, and presents computational results for real and randomly generated problems. The fact that many problems can be solved more rapidly than the corresponding...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics