# An Inverse Optimization Model for Linear Fractional Programming

Author Affiliations

^{1}Department of Mathematical Sciences, Government College, Ajmer, Affiliated to M. D. S. University, Ajmer - 305 001, INDIA^{2}Department of Mathematics, Government Engineering College, Jhalawar, Affiliated to Rajasthan Technical University, Kota, INDIA

*Res. J. Recent Sci.,* **Volume 2, Issue (4),** Pages 56-58, April,2 **(2013)**

## Abstract

In this paper, we have proposed an inverse model for linear fractional programming (LFP) problem in which the parameters associated with the numerator of the objective function in the given LFP are adjusted as little as possible(under l norm) so that the given feasible solution become optimal. We formulate this problem as a linear programming problem. A numerical example is given in the last to show, how this model can apply for production planning problem to bring down the level of unemployment.

## References

- Burton, D. and Toint, Ph. L., On an instance of shortest paths problem, Mathematical Programming, 53, 45-61(1992)
- Zhang, J. and Liu, Z., Calculating some inverse linear programming problems, Journal of Computational and Applied Mathematics, 72, 261-273 (1996)
- Zhang, J. and Liu, Z., A further study on inverse linear programming problems, Journal of Computational and Applied Mathematics, 106, 345-359 (1999)
- Ahuja, R. K. and Orlin, J. B., Inverse Optimization, Operation Research 49,771-783 (2001)
- Huang, S. and Liu, Z., On the inverse problem of linear programming and its application to minimum weight perfect k-matching, European Journal of Operational Research, 112, 421-426 (1999)
- Amin, G.R. and Emrouznejad, A., Inverse Forecasting: A New approach for predictive modeling, Computers & Industrial Engineering, doi:10.1016/j.cie. 2007.05.007 (2007)
- Yibing, L., Tiesong, H. and Zhongping, W., A penalty function method for solving inverse optimal value problem, J. Comp. Appl. Math, 220(1-2),175-180 (2008)
- Zhang, J., Zhang, Li. and Xiao, X., A perturbation approach for an inverse quadratic programming problem. doi: 10.1007/s00186-010-0323-4(2010)
- Zhang, J. and Zhang, Li., An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems, Applied Math. & Opt., 61(1), 57-83 (2010)
- Zhang, J. and Zhang, Li., Solving a class of inverse QP problems by a smoothing Newton method, Journal of Computational Mathematics, 27(6), 787-801 (2009)
- Wang, L., Cutting plane algorithms for the inverse mixed integer linear programming problem, Operations Research Letters, 37, 114-116 (2009)
- Hladik, M., Generalized linear fractional programming under interval uncertainty, Eur. J. Oper. Res., 205(1), 42-46 (2010)
- Jaing, Y., Xiao, X., Zhang, Li. and Zhang, J., A perturbation approach for a type of inverse linear programming problem. doi: 10.1080/00207160903513003 (2011)
- Bajanilov, Erik B., Linear Fractional Programming: Theory, Methods, Applications and Software. Kluwer Academic Press (2003)
- Charnes, A. and Cooper, W. W., Programming with linear fractional functionals, Naval Research Log. Quart., , 181 – 186 (1962)
- Swarup, K., Linear Fractional Functional Programming, Operations Research, 13, 1029-1036 (1965)
- Chadha, S. S., A Linear Fractional Program with homogeneous Constraint, OPSEARCH, 36, 390-398 (1999)
- Chadha, S. S. and Chadha, V., Linear fractional programming and duality, doi: 10.1007/s10100-007-0021-3 (2007)
- Jain, S. and Mangal, A., Modified Fourier elimination technique for fractional programming problem, Acharya Nagaarjuna International Journal of Mathematics and Information Technology, , 121-131 (2004)
- Jain, S. and Mangal, A., Extended Gauss elimination technique for integer solution of linear fractional programming, Journal of Indian Mathematical Society, 75, 37-46 (2008)
- Jain, S., Mangal, A. and Parihar, P., Solution of fuzzy linear fractional programming problem, OPSEARCH, doi: 10.1007/s12597-011-0043-4 (2011)
- Borza, M., Rambely, A. and Saraj, M., Solving Linear Fractional Programming Problems with Interval Coefficients in the Objective Function. A New Approach, Applied Mathematical Sciences, 69(6), 3443-3452 (2012)