scientific article; zbMATH DE number 4049374

zbMATH Open0643.90042MaRDI QIDQ3786267FDOQ3786267

Authors: J. L. Nazareth 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 47963
• Linear programming computation
• scientific article; zbMATH DE number 3177183
• Linear programming computation
• Computational techniques of the simplex method

zbMATH Keywords

Lagrange multipliersDantzig-Wolfe decompositionsimplex methodhomotopy principlefeasible directionsdual simplex algorithmBland's pivoting rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (21)

• An Implementation of Variable Upper Bounds via SUB Methodology
• A projective simplex algorithm using LU decomposition
• An explicit finite difference approach to the pricing problems of perpetual Bermudan options
• Load balancing in the parallel optimization of block-angular linear programs
• The implementation of linear programming algorithms based on homotopies
• The BPMPD interior point solver for convex quadratic problems
• LOQO user's manual — version 3.10
• Dual simplex algorithm with implicit representation of variable upper bounds
• The D_LP decision support system and its extension to stochastic programming^∗
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Title not available (Why is that?)
• Linear programming computation
• Computer Codes for the Analysis of Infeasible Linear Programs
• The decomposition principle and algorithms for linear programming
• A practical anti-cycling procedure for linearly constrained optimization
• Title not available (Why is that?)
• MINOS(IIS): Infeasibility analysis using MINOS
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†
• Partitioning mathematical programs for parallel solution
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Pivot versus interior point methods: Pros and cons

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786267)