This is a preview. Log in through your library . Abstract The hyperbolic (or fractional) linear programming problem with only one aggregate constraint is solved by a simple and extremely efficient ...
A routine written in IML to solve this problem follows. The approach appends slack, surplus, and artificial variables to the model where needed. It then solves phase 1 to find a primal feasible ...
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback