Please use this identifier to cite or link to this item: http://148.72.244.84:8080/xmlui/handle/xmlui/3610
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSnoor O. Abdalla, Ayad M. Ramadan and Ronak M. Abdullah-
dc.date.accessioned2023-10-16T08:03:16Z-
dc.date.available2023-10-16T08:03:16Z-
dc.date.issued2020-
dc.identifier.citationhttps://dx.doi.org/10.24237/djps.16.04.531C%C2%A0en_US
dc.identifier.issn2222-8373-
dc.identifier.urihttp://148.72.244.84:8080/xmlui/handle/xmlui/3610-
dc.description.abstractMulti-objective optimization also known as multi-objective programming is an area of multiple criteria decision making that is concerned with mathematical optimization problems involving more than one objective function to be optimized simultaneously. In such circumstance, we have to be discovered out compromise arrangement which is ideal for all the objectives in a few senses. In this paper, we transformed multi-objective linear plus linear fractional programming problems to single QPP and then solved by methods of QPP. Illustrative numerical examples are displayed for exhibit reason. We have explored an arrangement to the MOLPLFP issue based on a hypothesis already considered by Dinkelbach. He clearly delineated a calculation for fractional programming with nonlinear as well as linear terms within numerator and denominator.en_US
dc.description.sponsorshiphttps://djps.uodiyala.edu.iq/en_US
dc.language.isoenen_US
dc.publisherUniversity of Diyalaen_US
dc.subjectFractional linear programming, Multi-objective linear programming, Linear programming, Quadratic programming problem.en_US
dc.titleTransforming and Solving Multi-Objective Linear Plus Linear Fractional Programming Problemen_US
dc.title.alternativeالبرمجة الخطية متعددة االهداف الخطية مع مشكلة البرمجة الكسرية الخطيةen_US
dc.typeArticleen_US
Appears in Collections:مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.)

Files in This Item:
File Description SizeFormat 
4-E(531).pdf650.49 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.