A substitution method for linear programming is presented that associates variable elimination criteria with the objective function and claims strong polynomiality inherited from classical linear system substitution.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear Programming Problem Solved By a Special Substitution Method
A substitution method for linear programming is presented that associates variable elimination criteria with the objective function and claims strong polynomiality inherited from classical linear system substitution.