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

In this paper we report on the solution to optimality of 10 large-scale zero-one linear programming problems. All problem data come from real-world industrial applications and are characterized by ...

Solving linear programming problems in a spreadsheet yields equations for maximizing business profits. As applied to business, linear programming typically involves an objective formula, such as ...