Bibliographic Details
| Title: |
A global pricing extension of the simplex methodX. |
| Authors: |
Wolde, Biressaw C.1, Larsson, Torbjörn1 torbjorn.larsson@liu.se |
| Source: |
Operations Research & Decisions. 2026, Vol. 36 Issue 1, p24-52. 29p. |
| Subject Terms: |
*Linear programming, Simplex algorithm, Cost functions, Topology, Optimization algorithms |
| Abstract: |
We introduce the use of a global, nonlinear price function in linear programming and the simplex method. The usual, linear price function of this method captures the objective's behavior over the cone of directions defined by the nonbasic columns, whereas the global price function adds information about the topology of the whole feasible set. This is achieved by using an exterior penalty function. Further, degeneracy is effectively handled through explicit degeneracy-breaking constraints. The use of the global price function leads to a pricing problem that yields an improving, non-edge feasible direction, which is converted to an auxiliary variable to be used in the simplex method. Preliminary computational results with nondegenerate and highly degenerate linear programs show that the introduction of a global price function in the simplex method, and degeneracy-breaking constraints if needed, may significantly enhance its performance. [ABSTRACT FROM AUTHOR] |
|
Copyright of Operations Research & Decisions is the property of Oficyna Wydawnicza Politechniki Wroclawskiej and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Index |