A note on solving multi-objective integer indefinite quadratic fractional programs

  • Prerna Kushwah
  • Vikas SharmaEmail author
Short Note


In this note we have discussed that a simplex like algorithm to solve a indefinite quadratic fractional programming problem proposed by Mekhilef et al. (Ann Oper Res, 2019. fails to find its optimal solution and so it may not generate the actual set of efficient points of the corresponding multi-objective integer indefinite quadratic fractional programs. A counter example in support of this argument is also given.


Multi-objective programming Integer programming Linear programming Quadratic programming Fractional programming Efficient cut Branch and cut 

Mathematics Subject Classification

90C29 90C10 90C20 90C57 



  1. Martos, B. (1965). The direct power of adjacent vertex programming methods. Management Science, 12(3), 241–252.CrossRefGoogle Scholar
  2. Mekhilef, A., Moulaï, M., & Drici, W. (2019). Solving multi-objective integer indefinite quadratic fractional programs. Annals of Operations Research,. Scholar
  3. Sharma, V. (2012). Multiobjective integer nonlinear fractional programming problem: A cutting plane approach. Opsearch, 49(2), 133–153.CrossRefGoogle Scholar
  4. Sharma, V., Dhaiya, K., & Verma, V. (2017). A ranking algorithm for bi-objective quadratic fractional integer programming problems. Optimization, 66(11), 1913–1929.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of MathematicsThapar Institute of Engineering and TechnologyPatialaIndia

Personalised recommendations