Implementing interior point linear programming methods in the Optimization Subroutine Library. This paper discusses the implementation of interior point (barrier) methods for linear programming within the framework of the IBM Optimization Subroutine Library. This class of methods uses quite different computational kernels than the traditional simplex method. In particular, the matrices we must deal with are symmetric and, although still sparse, are considerably denser than those assumed in simplex implementations. Severe rank deficiency must also be accommodated, making it difficult to use off-the-shelf library routines. These features have particular implications for the exploitation of the newer IBM machine architectural features. In particular, interior methods can benefit greatly from use of vector architectures on the IBM $3090^{TM}$ series computers and “super-scalar” processing on the RISC System/$6000^{TM}$ series.

References in zbMATH (referenced in 107 articles )

Showing results 1 to 20 of 107.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Wang, I-Lin: Multicommodity network flows: A survey. II: Solution methods (2018)
  2. Gould, Nicholas I. M.; Orban, Dominique; Toint, Philippe L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (2015)
  3. Sokolinskaya, I. M.; Sokolinskii, L. B.: Parallel algorithm for solving linear programming problem under conditions of incomplete data (2010)
  4. Liao, Chao-Ning; Önal, Hayri; Chen, Ming-Hsiang: Average shadow price and equilibrium price: a case study of tradable pollution permit markets (2009)
  5. Quintero, José Luis; Crema, Alejandro: An algorithm for multiparametric 0-1-integer programming problems relative to a generalized min Max objective function (2009)
  6. Xia, Yu: A global optimization method for semi-supervised clustering (2009) ioport
  7. Boschetti, M. A.; Mingozzi, A.; Ricciardelli, S.: A dual ascent procedure for the set partitioning problem (2008)
  8. Hofer, A.: Two controller reduction methods based on convex optimization (2008)
  9. Zeng, Liangzhao; Ngu, Anne H. H.; Benatallah, Boualem; Podorozhny, Rodion; Lei, Hui: Dynamic composition and optimization of web services (2008) ioport
  10. Dahal, Keshav P.; Aldridge, Chris J.; Galloway, Stuart J.: Evolutionary hybrid approaches for generation scheduling in power systems (2007)
  11. Long, Christopher E.; Polisetty, Pradeep K.; Gatzke, Edward P.: Deterministic global optimization for nonlinear model predictive control of hybrid dynamic systems (2007)
  12. Peters, Emmanuel; De Matta, Renato; Boe, Warren: Short-term work scheduling with job assignment flexibility for a multi-fleet transport system (2007)
  13. Sylva, John; Crema, Alejandro: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (2007)
  14. Thompson, Gary M.; Pullman, Madeleine E.: Scheduling workforce relief breaks in advance versus in real-time (2007)
  15. Barahona, Francisco; Bermon, Stuart; Gnlk, Oktay; Hood, Sarah: Robust capacity planning in semiconductor manufacturing (2005)
  16. Fréville, Arnaud; Hanafi, Saïd: The multidimensional 0-1 knapsack problem -- bounds and computational aspects (2005)
  17. Fügenschuh, Armin; Martin, Alexander: Computational integer programming and cutting planes (2005)
  18. Ladanyi, Laszlo; Lee, Jon; Lougee-Heimer, Robin: Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (2005)
  19. Quintero, José Luis; Crema, Alejandro: An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function (2005)
  20. Tsodikov, Yu. M.; Tsodikova, Ya. Yu.: Regularizing functions in many-period production optimization models (2005)

1 2 3 4 5 6 next