SOLVING QUADRATIC PROGRAMMING PROBLEM WITH INTERVAL COEFFICIENTS USING BEAL’S METHOD

Show simple item record

dc.contributor.author Ketemaw Demeke Getahun
dc.contributor.author (PhD) Alemayehu
dc.contributor.author (PhD) Getachew Teshome
dc.date.accessioned 2024-11-08T12:22:45Z
dc.date.available 2024-11-08T12:22:45Z
dc.date.issued 2024-01
dc.identifier.uri http://ir.haramaya.edu.et//hru/handle/123456789/7910
dc.description 61p. en_US
dc.description.abstract Formulating and solving IQPP is a very interesting and challenging problem. The main difficulty is that if the constraints have interval coefficients, then the feasible region is not fixed. Instead there are an infinite number of possible feasible regions and gives different optimal values. In addition, if the coefficient of the objective function has interval coefficients then there is also an infinite choice of possible objective functions. For practical purpose, the problem is to determine the coefficient setting, that produce the best optimum and the worst optimum problem. This gives an idea of the range of solution spanned by imprecise interval model. Based on this idea we reduced the IQPP into two classical Quadratic Programming (QP) problems, one is the best problem and the other is the worst problem. Afterwards these classical QPP are solved using Beal’s algorithm. Numerical example is presented to strengthen the idea en_US
dc.description.sponsorship Haramaya University en_US
dc.language.iso en en_US
dc.publisher Haramaya University en_US
dc.subject two level programming, best and worst problem, interval analysis, interval optimization and Beal’s method of QPP en_US
dc.title SOLVING QUADRATIC PROGRAMMING PROBLEM WITH INTERVAL COEFFICIENTS USING BEAL’S METHOD en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search HU-IR System


Advanced Search

Browse

My Account