Linearization of a 0–1 quadratic fractional programming problem
Theoretical Paper
First Online:
Received:
- 7 Downloads
Abstract
In this paper, the considered problem is the reduction of 0–1 Quadratic Fractional Programming Problem (0–1 QF) to 0–1 Linear Mixed Programming problem (0–1 MLP). The method used to solve the linearized problem is based upon the branch and bound method. Numerical problems are solved with the help of the software ‘Lindo’.
Keywords
Fractional programming Linearization 0–1 programming Quadratic programmingPreview
Unable to display preview. Download preview PDF.
References
- 1.C.T. Chang, “An efficient linearization approach for mixed integer problem”, European Journal of Operational Research 123 (2000) 652–659.CrossRefGoogle Scholar
- 2.C.T. Chang, “On the polynomial mixed 0–1 fractional programming problems”, European Journal of Operational Research 131 (2001) 224–227.CrossRefGoogle Scholar
- 3.Fred Glover, “Improved Linear Integer programming Formulations of Non-linear Integer Problems”, Management Science, Vol. 22, No. 4, (1975).Google Scholar
- 4.H.L. Li, “A global approach for general 0–1 fractional programming”, European Journal of Operational Research 73 (1994) 590–596.CrossRefGoogle Scholar
- 5.Siegfired Schaible, “Fractional Programming : Application and Algorithm”, European Journal of Operational Research 7 (1981), 111–120.CrossRefGoogle Scholar
- 6.T.H. Wu, “A. note on a global approach for general 0–1 fractional programming”, European Journal of Operational Research 101 (1997) 220–223.CrossRefGoogle Scholar
- 7.Wonpracha Chaovalitowangse, Panos M. Pardalas, Oleg A. Prokopyev, “A New linearization technique for multi quadratic 0–1 programming problems”, Operation Research Letters 32 (2004) 517–522.CrossRefGoogle Scholar
Copyright information
© Operational Research Society of India 2006