Hongwei Jiao
School of Mathematical Science, Henan Institute of Science and Technology, 453003, Xinxiang, China
Kun Li
Department of Basic Science, Henan Mechanical and Electrical Engineering College, 453002, Xinxiang, China
Jianping Wang
School of Mathematical Science, Henan Institute of Science and Technology, 453003, Xinxiang, China
ABSTRACT
In this study, a branch and bound algorithm is presented for globally solving a class of linear fractional programming problems. In the algorithm, a linear relaxation method is introduced to generate the linear relaxation programming problem of the investigated linear fractional programming problems. In this study, we pay more attention to the numerical experiments. Several test problems are used to verify the feasibility and computational efficiency of the proposed branch and bound algorithm.
PDF References Citation
How to cite this article
Hongwei Jiao, Kun Li and Jianping Wang, 2013. Numerical Algorithm for a Class of Linear Fractional Programming Problem. Information Technology Journal, 12: 6871-6876.
DOI: 10.3923/itj.2013.6871.6876
URL: https://scialert.net/abstract/?doi=itj.2013.6871.6876
DOI: 10.3923/itj.2013.6871.6876
URL: https://scialert.net/abstract/?doi=itj.2013.6871.6876
REFERENCES
- Ahmad, I. and Z. Husain, 2006. Duality in nondifferentiable minimax fractional programming with generalized convexity. Applied Math. Comput., 176: 545-551.
CrossRef - Feng, Q.G., H.P. Mao and H.W. Jiao, 2011. A feasible method for a class of mathematical problems in manufacturing system. Key Eng. Mater., 460-461: 806-809.
CrossRef - Phuong, N.T.H. and H. Tuy, 2003. A unified monotonic approach to generalized linear fractional programming. J. Global Optim., 26: 229-259.
CrossRef