• Deutsch
Login

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
  • MSC-Classification
  • 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMIN...
  • 90Cxx Mathematical programming [See also 49Mxx, 65...

90C05 Linear programming

Refine

Author

  • Gleixner, Ambros (9)
  • Koch, Thorsten (8)
  • Rehfeldt, Daniel (4)
  • Shinano, Yuji (4)
  • Gamrath, Gerald (3)
  • Berthold, Timo (2)
  • Fischer, Tobias (2)
  • Gally, Tristan (2)
  • Heinz, Stefan (2)
  • Hendel, Gregor (2)
+ more

Year of publication

  • 2020 (1)
  • 2019 (1)
  • 2017 (1)
  • 2016 (2)
  • 2015 (1)
  • 2012 (4)
  • 2009 (1)
  • 2003 (1)
  • 1999 (1)

Document Type

  • ZIB-Report (10)
  • In Proceedings (1)
  • Habilitation (1)
  • Master's Thesis (1)

Language

  • English (12)
  • Japanese (1)

Has Fulltext

  • yes (12)
  • no (1)

Is part of the Bibliography

  • no (13)

Keywords

  • block structure (3)
  • linear programming (3)
  • energy system models (2)
  • high performance computing (2)
  • interior-point method (2)
  • parallelization (2)
  • preprocessing (2)
  • presolving (2)
  • Exact linear programming (1)
  • Iterative refinement (1)
+ more

Institute

  • Mathematical Optimization (12)
  • Mathematical Optimization Methods (5)
  • ZIB Allgemein (2)
  • Applied Algorithmic Intelligence Methods (1)
  • Mathematics of Transportation and Logistics (1)

13 search hits

  • 1 to 10
  • BibTeX
  • CSV
  • RIS
  • XML
  • 10
  • 20
  • 50
  • 100

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method (2020)
Gleixner, Ambros ; Kempke, Nils-Christian ; Koch, Thorsten ; Rehfeldt, Daniel ; Uslu, Svenja
In linear optimization, matrix structure can often be exploited algorithmically. However, beneficial presolving reductions sometimes destroy the special structure of a given problem. In this article, we discuss structure-aware implementations of presolving as part of a parallel interior-point method to solve linear programs with block-diagonal structure, including both linking variables and linking constraints. While presolving reductions are often mathematically simple, their implementation in a high-performance computing environment is a complex endeavor. We report results on impact, performance, and scalability of the resulting presolving routines on real-world energy system models with up to 700 million nonzero entries in the constraint matrix.
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method (2019)
Gleixner, Ambros ; Kempke, Nils-Christian ; Koch, Thorsten ; Rehfeldt, Daniel ; Uslu, Svenja
In linear optimization, matrix structure can often be exploited algorithmically. However, beneficial presolving reductions sometimes destroy the special structure of a given problem. In this article, we discuss structure-aware implementations of presolving as part of a parallel interior-point method to solve linear programs with block-diagonal structure, including both linking variables and linking constraints. While presolving reductions are often mathematically simple, their implementation in a high-performance computing environment is a complex endeavor. We report results on impact, performance, and scalability of the resulting presolving routines on real-world energy system models with up to 700 million nonzero entries in the constraint matrix.
The SCIP Optimization Suite 4.0 (2017)
Maher, Stephen J. ; Fischer, Tobias ; Gally, Tristan ; Gamrath, Gerald ; Gleixner, Ambros ; Gottwald, Robert Lion ; Hendel, Gregor ; Koch, Thorsten ; Lübbecke, Marco ; Miltenberger, Matthias ; Müller, Benjamin ; Pfetsch, Marc ; Puchert, Christian ; Rehfeldt, Daniel ; Schenker, Sebastian ; Schwarz, Robert ; Serrano, Felipe ; Shinano, Yuji ; Weninger, Dieter ; Witt, Jonas T. ; Witzig, Jakob
The SCIP Optimization Suite is a powerful collection of optimization software that consists of the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear programming solver SoPlex, the modeling language Zimpl, the parallelization framework UG, and the generic branch-cut-and-price solver GCG. Additionally, it features the extensions SCIP-Jack for solving Steiner tree problems, PolySCIP for solving multi-objective problems, and SCIP-SDP for solving mixed-integer semidefinite programs. The SCIP Optimization Suite has been continuously developed and has now reached version 4.0. The goal of this report is to present the recent changes to the collection. We not only describe the theoretical basis, but focus on implementation aspects and their computational consequences.
On the In-Flight Rest Assignment Problem (2016)
Wenzel, Ron
The airplane has changed the world in a tremendous way. Efficient scheduling of airmen and aircrafts is of considerable importance for cost-effectiveness of compa- nies. Attentiveness of flight crew members is vital as fatigue can lead to severe accidents. Therefore, duty times of flight crews are strictly limited. Long distance flights may be difficult to schedule with only one set of crew members. Furthermore, pertu- bations of the schedules may entail exchanging the entire crew, which confounds multiday schedules. A new EU regulation introduced in-flight rest: a schedule may extend pilots’ duty times if they rest for a certain time in designated crew compart- ments provided aboard airplanes. Of course they have to be replaced in that period of time. This thesis examines the in-flight rest assignment problem, which is the decision problem whether a given schedule allows for all crew members to take their compul- sory rest. The problem can be seen as multimachine scheduling problem. Efficient algorithms for special cases were developed and an alternative approach for entire hard cases is discussed.
The SCIP Optimization Suite 3.2 (2016)
Gamrath, Gerald ; Fischer, Tobias ; Gally, Tristan ; Gleixner, Ambros ; Hendel, Gregor ; Koch, Thorsten ; Maher, Stephen J. ; Miltenberger, Matthias ; Müller, Benjamin ; Pfetsch, Marc ; Puchert, Christian ; Rehfeldt, Daniel ; Schenker, Sebastian ; Schwarz, Robert ; Serrano, Felipe ; Shinano, Yuji ; Vigerske, Stefan ; Weninger, Dieter ; Winkler, Michael ; Witt, Jonas T. ; Witzig, Jakob
The SCIP Optimization Suite is a software toolbox for generating and solving various classes of mathematical optimization problems. Its major components are the modeling language ZIMPL, the linear programming solver SoPlex, the constraint integer programming framework and mixed-integer linear and nonlinear programming solver SCIP, the UG framework for parallelization of branch-and-bound-based solvers, and the generic branch-cut-and-price solver GCG. It has been used in many applications from both academia and industry and is one of the leading non-commercial solvers. This paper highlights the new features of version 3.2 of the SCIP Optimization Suite. Version 3.2 was released in July 2015. This release comes with new presolving steps, primal heuristics, and branching rules within SCIP. In addition, version 3.2 includes a reoptimization feature and improved handling of quadratic constraints and special ordered sets. SoPlex can now solve LPs exactly over the rational number and performance improvements have been achieved by exploiting sparsity in more situations. UG has been tested successfully on 80,000 cores. A major new feature of UG is the functionality to parallelize a customized SCIP solver. GCG has been enhanced with a new separator, new primal heuristics, and improved column management. Finally, new and improved extensions of SCIP are presented, namely solvers for multi-criteria optimization, Steiner tree problems, and mixed-integer semidefinite programs.
Iterative Refinement for Linear Programming (2015)
Gleixner, Ambros ; Steffy, Daniel ; Wolter, Kati
We describe an iterative refinement procedure for computing extended precision or exact solutions to linear programming problems (LPs). Arbitrarily precise solutions can be computed by solving a sequence of closely related LPs with limited precision arithmetic. The LPs solved share the same constraint matrix as the original problem instance and are transformed only by modification of the objective function, right-hand side, and variable bounds. Exact computation is used to compute and store the exact representation of the transformed problems, while numeric computation is used for solving LPs. At all steps of the algorithm the LP bases encountered in the transformed problems correspond directly to LP bases in the original problem description. We show that this algorithm is effective in practice for computing extended precision solutions and that it leads to a direct improvement of the best known methods for solving LPs exactly over the rational numbers. Our implementation is publically available as an extension of the academic LP solver SoPlex.
Factorization and update of a reduced basis matrix for the revised simplex method (2012)
Gleixner, Ambros
In this paper, we describe a method to enhance the FTRAN and BTRAN operations in the revised simplex algorithm by using a reduced basis matrix defined by basic columns and nonbasic rows. This submatrix of the standard basis matrix is potentially much smaller, but may change its dimension dynamically from iteration to iteration. For the classical product form update ("eta update"), the idea has been noted already by Zoutendijk, but only preliminarily tested by Powell in the early 1970s. We extend these ideas to Forrest-Tomlin type update formulas for an LU factorization of the reduced basis matrix, which are suited for efficient implementation within a state-of-the-art simplex solver. The computational advantages of the proposed method apply to pure LP solving as well as to LP-based branch-and-cut algorithms. It can easily be integrated into existing simplex codes.
Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite (2012)
Berthold, Timo ; Gamrath, Gerald ; Gleixner, Ambros ; Heinz, Stefan ; Koch, Thorsten ; Shinano, Yuji
This paper introduces the SCIP Optimization Suite and discusses the capabilities of its three components: the modeling language Zimpl, the linear programming solver SoPlex, and the constraint integer programming framework SCIP. We explain how these can be used in concert to model and solve challenging mixed integer linear and nonlinear optimization problems. SCIP is currently one of the fastest non-commercial MIP and MINLP solvers. We demonstrate the usage of Zimpl, SCIP, and SoPlex by selected examples, we give an overview of available interfaces, and outline plans for future development.
SCIP Optimization Suite を利用した 混合整数(線形/非線形) 計画問題の解法 (2012)
Berthold, Timo ; Gleixner, Ambros ; Heinz, Stefan ; Koch, Thorsten ; Shinano, Yuji
この論文ではソフトウェア・パッケージSCIP Optimization Suite を紹介し,その3つの構成要素:モデリン グ言語Zimpl, 線形計画(LP: linear programming) ソルバSoPlex, そして,制約整数計画(CIP: constraint integer programming) に対するソフトウェア・フレームワークSCIP, について述べる.本論文では,この3つの 構成要素を利用して,どのようにして挑戦的な混合整数線形計画問題(MIP: mixed integer linear optimization problems) や混合整数非線形計画問題(MINLP: mixed integer nonlinear optimization problems) をモデル化 し解くのかを説明する.SCIP は,現在,最も高速なMIP,MINLP ソルバの1つである.いくつかの例により, Zimpl, SCIP, SoPlex の利用方法を示すとともに,利用可能なインタフェースの概要を示す.最後に,将来の開 発計画の概要について述べる.
Improving the Accuracy of Linear Programming Solvers with Iterative Refinement (2012)
Gleixner, Ambros ; Steffy, Daniel ; Wolter, Kati
We describe an iterative refinement procedure for computing extended precision or exact solutions to linear programming problems (LPs). Arbitrarily precise solutions can be computed by solving a sequence of closely related LPs with limited precision arithmetic. The LPs solved share the same constraint matrix as the original problem instance and are transformed only by modification of the objective function, right-hand side, and variable bounds. Exact computation is used to compute and store the exact representation of the transformed problems, while numeric computation is used for solving LPs. At all steps of the algorithm the LP bases encountered in the transformed problems correspond directly to LP bases in the original problem description. We demonstrate that this algorithm is effective in practice for computing extended precision solutions and that this leads to direct improvement of the best known methods for solving LPs exactly over the rational numbers.
  • 1 to 10

OPUS4 Logo

  • Contact
  • Impressum und Datenschutz
  • Sitelinks