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

Prerna Kushwah and Vikas Sharma ()
Additional contact information
Prerna Kushwah: Thapar Institute of Engineering and Technology
Vikas Sharma: Thapar Institute of Engineering and Technology

Annals of Operations Research, 2020, vol. 289, issue 2, No 17, 459-462

Abstract: 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.

Keywords: Multi-objective programming; Integer programming; Linear programming; Quadratic programming; Fractional programming; Efficient cut; Branch and cut; 90C29; 90C10; 90C20; 90C57 (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-019-03408-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:289:y:2020:i:2:d:10.1007_s10479-019-03408-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-019-03408-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().