Abstract
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. https://doi.org/10.1007/s10479-019-03178-2) 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.
This is a preview of subscription content, log in via an institution to check access.
References
Martos, B. (1965). The direct power of adjacent vertex programming methods. Management Science, 12(3), 241–252.
Mekhilef, A., Moulaï, M., & Drici, W. (2019). Solving multi-objective integer indefinite quadratic fractional programs. Annals of Operations Research,. https://doi.org/10.1007/s10479-019-03178-2.
Sharma, V. (2012). Multiobjective integer nonlinear fractional programming problem: A cutting plane approach. Opsearch, 49(2), 133–153.
Sharma, V., Dhaiya, K., & Verma, V. (2017). A ranking algorithm for bi-objective quadratic fractional integer programming problems. Optimization, 66(11), 1913–1929.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kushwah, P., Sharma, V. A note on solving multi-objective integer indefinite quadratic fractional programs. Ann Oper Res 289, 459–462 (2020). https://doi.org/10.1007/s10479-019-03408-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-019-03408-7
Keywords
- Multi-objective programming
- Integer programming
- Linear programming
- Quadratic programming
- Fractional programming
- Efficient cut
- Branch and cut