Linearization of a 0–1 quadratic fractional programming problem

Linearization of a 0–1 quadratic fractional programming problem

0.00 Avg rating0 Votes
Article ID: iaor20073082
Country: India
Volume: 43
Issue: 2
Start Page Number: 190
End Page Number: 207
Publication Date: Jun 2006
Journal: OPSEARCH
Authors: ,
Keywords: programming: integer
Abstract:

In this paper, the considered problem is the reduction of 0–1 Quadratic Fractional Programming Problem to 0–1 Linear Mixed Programming problem. The method used to solve the linearization problem is based upon the branch and bound method. Numerical problems are solved with the help of the software ‘Lindo’.

Reviews

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