Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance
DOI:
https://doi.org/10.7146/brics.v3i48.20050Resumé
We analyze invariance of the conclusion of optimality for the linear
programming problem under scalings (linear, affine, . . . ) of various
problem parameters such as: the coefficients of the objective function,
the coefficients of the constraint vector, the coefficients of one or more
rows (columns) of the constraint matrix. Measurement theory concepts
play a central role in our presentation and we explain why such
approach is a natural one.
Keywords: Sensitivity Analysis, Scaling, Measurement
Downloads
Publiceret
1996-06-18
Citation/Eksport
Pekec, A. (1996). Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance. BRICS Report Series, 3(48). https://doi.org/10.7146/brics.v3i48.20050
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).