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 ...
https://doi.org/10.2307/2582400 • https://www.jstor.org/stable/2582400 Copy URL This paper offers a new approach to the solution of zero-one goal-programming ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results