A note on min-max goal programming approach for solving multi-objective de novo programming problems
by Susanta Banik; Debasish Bhattacharya
International Journal of Operational Research (IJOR), Vol. 37, No. 1, 2020

Abstract: Min-max goal programming approach for solving multi-objective de novo programming problems was studied by Nurullah Umarusman in 2013. The present study is a further attempt to examine the approach and present an improved version of the approach. In Umarusman's method, each of the goal constraints is having both positive and negative deviation variables, whereas in the proposed approach only one deviation variable has been used. The method of solution has been illustrated with the numerical examples. The solution obtained by proposed method yields objective values which are better than those obtained by Umarusman for the same set of weights.

Online publication date: Mon, 23-Dec-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

Username:        Password:          Forgotten your 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