A multiobjective interval goal programming method using penalty function Online publication date: Mon, 22-Aug-2016
by Shyamal Sen
International Journal of Operational Research (IJOR), Vol. 27, No. 1/2, 2016
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com