Moreover, a new, ratio-test-free pivoting rule is proposed, significantly reducing computational cost at each iteration. Our numerical experiments show that the method is very promising, at least for ...

In addition, two algorithms are presented for approximately solving fractional programming (FP) problems. The first algorithm is based on an objective space cut and bound method for solving convex FP ...

About the same time, he invented the “simplex method,” an algorithm for solving linear programming problems.