A note of a global approach for general 0–1 fractional programming

A note of a global approach for general 0–1 fractional programming

0.00 Avg rating0 Votes
Article ID: iaor19991989
Country: Netherlands
Volume: 101
Issue: 1
Start Page Number: 220
End Page Number: 223
Publication Date: Aug 1997
Journal: European Journal of Operational Research
Authors:
Keywords: programming: integer
Abstract:

Based on an approach recently proposed for obtaining global optimal solution of general 0–1 fractional programming (G-FP) problem, a theorem is presented in this research. Through this theorem, the nonlinear terms appearing in the formulation transformed from G-FP can be directly replaced by a set of linear inequalities. The G-FP problem can hence be easily and more efficiently solved as a mixed integer program.

Reviews

Required fields are marked *. Your email address will not be published.