A global pricing extension of the simplex method

DOI10.37190/ORD/211685MaRDI QIDQ6840572zbMATH OpenFDO

Authors Biressaw Chali Wolde, Torbjörn Larsson

Publication date 23 March 2026

Published in Operations Research and Decisions (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.37190/ORD/211685

zbMATH Keywords

external pivotingfeasible directionlinear programmingpricingsimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Extreme-point and pivoting methods (90C49)

Cites work

• A feasible direction method for linear programming
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
• A new polynomial-time algorithm for linear programming
• A practicable steepest-edge simplex algorithm
• A steepest feasible direction extension of the simplex method
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
• A technical review of column generation in integer programming
• Computational behavior of a feasible direction method for linear programming
• Computational techniques of the simplex method
• Experiments with external pivoting
• Fourier's Method of Linear Programming and Its Dual
• Global pricing and feasible directions in linear programming
• scientific article; zbMATH DE number 3856810 (Why is no real title available?)
• scientific article; zbMATH DE number 3825556 (Why is no real title available?)
• scientific article; zbMATH DE number 3961338 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 966292 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• scientific article; zbMATH DE number 3069636 (Why is no real title available?)
• Khachiyan’s algorithm for linear programming
• Linear programming and its application.
• Linear programming computation
• Nonlinear Programming
• On scaling linear programs—some experimental results
• On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
• Pivot selection methods of the Devex LP code
• Pivot versus interior point methods: Pros and cons
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Selected Topics in Column Generation
• Steepest-edge simplex algorithms for linear programming
• The double pivot simplex method
• The Simplex Method: Two Basic Variables Replacement

This page was built for publication: A global pricing extension of the simplex method

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