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 ...

Mathematics of Operations Research, Vol. 12, No. 4 (Nov., 1987), pp. 678-699 (22 pages) We consider generalizations of the steepest descent algorithm for solving asymmetric systems of equations. We ...

Researchers utilise models that blend bilevel optimisation, mixed-integer nonlinear programming (MINLP) and distributed algorithms such as the alternating direction method of multipliers (ADMM) to ...