scientific article
From MaRDI portal
Publication:3786267
zbMath0643.90042MaRDI QIDQ3786267
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrange multipliersDantzig-Wolfe decompositionsimplex methodhomotopy principlefeasible directionsdual simplex algorithmBland's pivoting rule
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)
Related Items
An explicit finite difference approach to the pricing problems of perpetual Bermudan options, The implementation of linear programming algorithms based on homotopies, An Implementation of Variable Upper Bounds via SUB Methodology, Dual simplex algorithm with implicit representation of variable upper bounds, Partitioning mathematical programs for parallel solution, A projective simplex algorithm using LU decomposition, A practical anti-cycling procedure for linearly constrained optimization, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†, The DLP decision support system and its extension to stochastic programming∗, The BPMPD interior point solver for convex quadratic problems, LOQO user's manual — version 3.10, Pivot versus interior point methods: Pros and cons, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, The decomposition principle and algorithms for linear programming, MINOS(IIS): Infeasibility analysis using MINOS, Load balancing in the parallel optimization of block-angular linear programs
