In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve ...
This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback