Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

NONLINEAR FRACTIONAL PROGRAMMING PROBLEM WITH INEXACT PARAMETER

  • Bhurjee, A.K. (Department of Mathematics, Indian Institute of Technology Kharagpur) ;
  • Panda, G. (Department of Mathematics, Indian Institute of Technology Kharagpur)
  • Received : 2012.12.10
  • Accepted : 2013.03.10
  • Published : 2013.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper a methodology is developed to solve a nonlinear fractional programming problem, whose objective function and constraints are interval valued functions. Interval valued convex fractional programming problem is studied. This model is transformed to a general convex programming problem and relation between the original problem and the transformed problem is established. These theoretical developments are illustrated through a numerical example.

Keywords

References

  1. A.K. Bhurjee and G. Panda, Efficient solution of interval optimization problem, Math Meth Oper Res 76 (3) (2012), 273-288. https://doi.org/10.1007/s00186-012-0399-0
  2. G. Liu C. Jiang, X. Han and G. Liu., A nonlinear interval number programming method for uncertain optimization problems., Eur J Oper Res 188(1) (2008), 1-13. https://doi.org/10.1016/j.ejor.2007.03.031
  3. Walster G.W. Hansen, E., Global optimization using interval analysis, Marcel Dekker, Inc., 2004.
  4. M Hladik, Generalized linear fractional programming under interval uncertainty, Eur J Oper Res 205 (2010), 42-46. https://doi.org/10.1016/j.ejor.2010.01.018
  5. Milan Hladik, Optimal value bounds in nonlinear programming with interval data, TOP 19 (2011), no. 1, 93-106. https://doi.org/10.1007/s11750-009-0099-y
  6. B. Hu and S. Wang, A novel approch in uncertain programming. part i: new arithemetic and order relation ofr interval numbers, J Ind Manag Optim 2(4) (2006), 351-371. https://doi.org/10.3934/jimo.2006.2.351
  7. Hisao Ishibuchi and Hideo Tanaka, Multiobjective programming in optimization of the interval objective function, Eur J Oper Res 48 (1990), no. 2, 219 - 225. https://doi.org/10.1016/0377-2217(90)90375-L
  8. Anurag Jayswal, Ioan Stancu-Minasian, and I. Ahmad, On sufficiency and duality for a class of interval-valued programming problems, Appl Math Comput 218 (2011), no. 8, 4119 - 4127. https://doi.org/10.1016/j.amc.2011.09.041
  9. V. Jeyakumar and G. Y. Li, Robust duality for fractional programming problems with constraint-wise data uncertainty, Eur J Oper Res 151(2) (2011), no. 2, 292-303.
  10. W Li and X Tian, Numerical solution method for general interval quadratic programming, Appl Math Comput 202 (2008), no. 2, 589-595. https://doi.org/10.1016/j.amc.2008.02.039
  11. Shiang-Tai Liu and Rong-Tsu Wang, A numerical solution method to interval quadratic programming, Appl Math Comput 189 (2007), no. 2, 1274 -1281. https://doi.org/10.1016/j.amc.2006.12.007
  12. G. S. Mahapatra and T. K. Mandal, Posynomial parametric geometric programming with interval valued coefficient, J Optim Theory Appl 154 (2012), no. 1, 120-132. https://doi.org/10.1007/s10957-012-9996-6
  13. R.E. Moore, Interval analysis, Prentice-Hall, 1966.
  14. Carla Oliveira and Carlos Henggeler Antunes, Multiple objective linear programming models with interval coefficients an illustrated overview, Eur J Oper Res 181 (2007), no. 3, 1434 - 1463. https://doi.org/10.1016/j.ejor.2005.12.042
  15. Hsien-Chung Wu, On interval-valued nonlinear programming problems, J Math Anal Appl 338 (2008), no. 1, 299-316. https://doi.org/10.1016/j.jmaa.2007.05.023

Cited by

  1. Sufficiency and duality for optimization problems involving interval-valued invex functions in parametric form vol.15, pp.1, 2015, https://doi.org/10.1007/s12351-015-0172-2
  2. An Evolutionary Algorithm Using Parameter Space Searching for Interval Linear Fractional Bilevel Programming Problems vol.30, pp.04, 2016, https://doi.org/10.1142/S0218001416590114
  3. Construction of the fractional-nonlinear optimization method vol.100, pp.4, 2019, https://doi.org/10.15587/1729-4061.2019.174079
  4. A Branch-Bound Cut Technique for Non-linear Fractional Multi-objective Optimization Problems vol.6, pp.2, 2013, https://doi.org/10.1007/s40819-020-0771-3
  5. Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems vol.70, pp.5, 2013, https://doi.org/10.1080/02331934.2020.1819276