Relatively Optimal Solutions In Multicriterion Programming

Miroslav Karakulakov ()
Additional contact information
Miroslav Karakulakov: Varna University of Economics

Business & Management Compass, 2011, issue 4, 53-63

Abstract: The optimization of real processes in the economy leads most frequently to multicriterion models. When solving the respective problems there is used the wellknown Pareto’s principle of optimality and one usually ends up with a set of an infinite number of plans, which are at once equivalent (after Pareto ), but different by realization. In the article there are worked out and formalized two principles for comparing Paretooptimal solutions and as a result of their use there is achieved a relatively optimal solution. The latter is dominant for a maximum subs et of the set of the feasible plans. There are discussed examples and presented charts, illustrating relative optimality in multicriterion programming.

JEL-codes: C60 (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://journal.ue-varna.bg/uploads/20140726092034_23906805453d372e26d728.pdf (application/pdf)

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:vrn:journl:y:2011:i:4:p:53-63

Access Statistics for this article

Business & Management Compass is currently edited by Julian Vasilev

More articles in Business & Management Compass from University of Economics Varna Contact information at EDIRC.
Bibliographic data for series maintained by Yana Doneva ().