• ON THE SOLUTION OF ROUGH GOAL BI-LEVEL QUADRATIC PROGRAMMING PROBLEM

O. E. Emam*, M. A. Abd-ElFattah, N. A. Ebeid

Abstract


This paper presents a bi- level quadratic multi-objective programming problem with linear constraints, in which the non-linear objective functions are to be maximized with different rough goals. First discussion how to turn a constrained model with random rough variables into crisp equivalent models. Then using the approach of the iterative goal programming method of Dauer and Krueger to develop the optimal solution of the bi-level decision- maker, and then use the concepts of tolerance membership function technique to generate the optimal solution for this problem. Finally, a numerical example is introduced to clarify the developed theory.

Keywords


Bi-level programming, Quadratic programming, Rough programming, goal programming.

Full Text:

pdf


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/