An exact method of fractional goal programming

An exact method of fractional goal programming

0.00 Avg rating0 Votes
Article ID: iaor2005382
Country: Netherlands
Volume: 29
Issue: 1
Start Page Number: 113
End Page Number: 120
Publication Date: May 2004
Journal: Journal of Global Optimization
Authors: , ,
Keywords: programming: goal, programming: quadratic
Abstract:

Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus optimal solutions can be obtained by using existing Global Optimization techniques. However, only heuristic procedures are suggested in the literature on the field. In this note we explore the practical applicability of a recent algorithm for nonconvex quadratic programming with quadratic constraints for this problem. Encouraging computational experiences for randomly generated instances with up to 14 fractional objectives are presented.

Reviews

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