IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v332y2024i1d10.1007_s10479-022-05123-2.html
   My bibliography  Save this article

An algorithm to solve multi-objective integer quadratic programming problem

Author

Listed:
  • Prerna Kushwah

    (TIET)

  • Vikas Sharma

    (TIET)

Abstract

The multi-objective integer programming problem often occurs in multi-criteria decision-making situations, where the decision variables are integers. In the present paper, we have discussed an algorithm for finding all efficient solutions of a multi-objective integer quadratic programming problem. The proposed algorithm is based on the aspect that efficient solutions of a multi-objective integer quadratic programming problem can be obtained by enumerating ranked solutions of an integer quadratic programming problem. For determining ranked solutions of an integer quadratic programming problem, we have constructed a related integer linear programming problem and from ranked solutions of this integer linear programming problem, ranked solutions of the original integer quadratic programming problem are generated. Theoretically, we have shown that the developed method generates the set of all efficient solutions in a finite number of steps, and numerically we have elaborated the working of our algorithm and compared our results with existing algorithms. Further, we have analyzed that the developed method is efficient for solving a multi-objective integer quadratic programming problem with a large number of constraints, variables and objectives.

Suggested Citation

  • Prerna Kushwah & Vikas Sharma, 2024. "An algorithm to solve multi-objective integer quadratic programming problem," Annals of Operations Research, Springer, vol. 332(1), pages 433-459, January.
    • Handle: RePEc:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-022-05123-2
    DOI: 10.1007/s10479-022-05123-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05123-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-05123-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Iosif Pappas & Nikolaos A. Diangelakis & Efstratios N. Pistikopoulos, 2021. "The exact solution of multiparametric quadratically constrained quadratic programming problems," Journal of Global Optimization, Springer, vol. 79(1), pages 59-85, January.
    2. Amal Mekhilef & Mustapha Moulaï & Wassila Drici, 2021. "Solving multi-objective integer indefinite quadratic fractional programs," Annals of Operations Research, Springer, vol. 296(1), pages 821-840, January.
    3. B. Martos, 1965. "The Direct Power of Adjacent Vertex Programming Methods," Management Science, INFORMS, vol. 12(3), pages 241-252, November.
    4. Gupta, Renu & Bandopadhyaya, Lakshmisree & Puri, M. C., 1996. "Ranking in quadratic integer programming problems," European Journal of Operational Research, Elsevier, vol. 95(1), pages 231-236, November.
    5. Prerna Kushwah & Vikas Sharma, 2020. "A note on solving multi-objective integer indefinite quadratic fractional programs," Annals of Operations Research, Springer, vol. 289(2), pages 459-462, June.
    6. Riccardo Cambini & Claudio Sodini, 2002. "A Finite Algorithm for a Particular D.C. Quadratic Programming Problem," Annals of Operations Research, Springer, vol. 117(1), pages 33-49, November.
    7. M Jackson & M D Staunton, 1999. "Quadratic programming applications in finance using Excel," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(12), pages 1256-1266, December.
    8. Fatma Zohra Ouaïl & Mohamed El-Amine Chergui, 2018. "A branch-and-cut technique to solve multiobjective integer quadratic programming problems," Annals of Operations Research, Springer, vol. 267(1), pages 431-446, August.
    9. S. Geissel & H. Graf & J. Herbinger & F. T. Seifried, 2022. "Portfolio optimization with optimal expected utility risk measures," Annals of Operations Research, Springer, vol. 309(1), pages 59-77, February.
    10. Ekta Jain & Kalpana Dahiya & Vanita Verma, 2018. "Integer quadratic fractional programming problems with bounded variables," Annals of Operations Research, Springer, vol. 269(1), pages 269-295, October.
    11. Yue Qi, 2017. "On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 145-158, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Yuanrong & Aste, Tomaso, 2023. "Dynamic portfolio optimization with inverse covariance clustering," LSE Research Online Documents on Economics 117701, London School of Economics and Political Science, LSE Library.
    2. Petr Fiala, 2018. "Project portfolio designing using data envelopment analysis and De Novo optimisation," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(4), pages 847-859, December.
    3. Chunli Liu & Jianjun Gao, 2015. "A polynomial case of convex integer quadratic programming problems with box integer constraints," Journal of Global Optimization, Springer, vol. 62(4), pages 661-674, August.
    4. Frank Plastria, 2020. "On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 547-564, February.
    5. C. Bector, 1972. "Indefinite quadratic fractional functional programming," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 18(1), pages 21-30, December.
    6. Riccardo Cambini, 1995. "Funzioni scalari affini generalizzate," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 18(2), pages 153-163, September.
    7. Addis Belete Zewde & Semu Mitiku Kassa, 2023. "A novel approach for solving multi-parametric problems with nonlinear constraints," Journal of Global Optimization, Springer, vol. 85(2), pages 283-313, February.
    8. Angelo Aliano Filho & Antonio Carlos Moretti & Margarida Vaz Pato & Washington Alves Oliveira, 2021. "An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 35-69, January.
    9. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    10. Naqvi, Bushra & Rizvi, Syed Kumail Abbas & Hasnaoui, Amir & Shao, Xuefeng, 2022. "Going beyond sustainability: The diversification benefits of green energy financial products," Energy Economics, Elsevier, vol. 111(C).
    11. Timothy J. Lowe & Leroy B. Schwarz & Edward J. McGavin, 1988. "The determination of optimal base‐stock inventory policy when the costs of under‐ and oversupply are uncertain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 539-554, August.
    12. Riccardo Cambini, 2020. "Underestimation functions for a rank-two partitioning method," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 465-489, December.
    13. Amal Mekhilef & Mustapha Moulaï & Wassila Drici, 2021. "Solving multi-objective integer indefinite quadratic fractional programs," Annals of Operations Research, Springer, vol. 296(1), pages 821-840, January.
    14. Yuanrong Wang & Tomaso Aste, 2021. "Dynamic Portfolio Optimization with Inverse Covariance Clustering," Papers 2112.15499, arXiv.org, revised Jan 2022.
    15. Riccardo Cambini & Claudio Sodini, 2008. "A sequential method for a class of box constrained quadratic programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 223-243, April.
    16. S. Selcuk Erenguc, 1988. "Multiproduct dynamic lot‐sizing model with coordinated replenishments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 1-22, February.
    17. Riccardo Cambini & Giovanna D’Inverno, 2024. "Rank-two programs involving linear fractional functions," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 47(1), pages 299-325, June.
    18. Denizel, Meltem & Erenguc, Selcuk & Benson, Harold P., 1997. "Dynamic lot-sizing with setup cost reduction," European Journal of Operational Research, Elsevier, vol. 100(3), pages 537-549, August.
    19. Xingyu Dai & Dongna Zhang & Chi Keung Marco Lau & Qunwei Wang, 2023. "Multiobjective portfolio optimization: Forecasting and evaluation under investment horizon heterogeneity," Journal of Forecasting, John Wiley & Sons, Ltd., vol. 42(8), pages 2167-2196, December.
    20. Andrea Rigamonti & Katarína Lučivjanská, 2024. "Mean-semivariance portfolio optimization using minimum average partial," Annals of Operations Research, Springer, vol. 334(1), pages 185-203, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-022-05123-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.