Some ratio sharing models

A linear sharing problem is defined as a mathematical programming problem with a max-min objective function comprised of continuous, non-decreasing trade-off functions and linear constraints. In this paper several sharing models are proposed where the objective function involves ratios in various forms. For such ratio-sharing problems, some properties are derived, efficient algorithms are proposed, and computational experience is reported.