A multiobjective interval goal programming method using penalty function

Shyamal Sen

International Journal of Operational Research, 2016, vol. 27, issue 1/2, 232-251

Abstract: This article demonstrates how the penalty function can efficiently be used for solving multiobjective linear programming problem with interval valued objective functions. In the proposed approach, first the target intervals are obtained for the defined objectives. Then, using interval arithmetic and the concept of interval goal programming (IGP) the interval goals are transformed into crisp goals. In the process of solution, the goal achievement function is constructed as a convex combination of the sum of total penalty and the maximum penalty associated with unwanted deviations of the respective goals. Numerical examples are provided to illustrate the proposed approach.

Keywords: interval arithmetic; interval programming; interval goal programming; IGP; penalty function; multiobjective linear programming. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=78464 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:27:y:2016:i:1/2:p:232-251

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().