In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, the modified version exploits information of the optimal ...

Concave objective functions which are both piecewise linear and separable are often encountered in a wide variety of management science problems. Provided the constraints are linear, problems of this ...

The problem is now in the standard form for linear programming problems: an objective function that is to be maximized, subject to a number of constraints. We go on to examine solution methods.