A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
1976 Volume 19 Issue 3 Pages 228-244
Details
1976 Volume 19 Issue 3 Pages 228-244
A primal cutting plane algorithm is proposed for the integer fractional programming problem: [numerical formula] The algorithm is obtained by slightly modifying Young's simplified primal algorithm developed for the ordinary integer programming problem, and is based on the parametric programming approach to the fractional problem given by Jagannathan and Dinkelbach.
