In this paper, combinatorial arguments are used to derive a lower bound to the number of basic feasible solutions of a transport problem. A separate argument is given for degenerate and non-degenerate ...
This is a preview. Log in through your library . Abstract We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic ...
Perold, André. "Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming." SIAM Journal on Control and Optimization 19, no. 1 (1981): 52–63.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback