Uncertain multi-objective programming model: a genetic algorithm approach
by Kailash Lachhwani
International Journal of Mathematics in Operational Research (IJMOR), Vol. 11, No. 2, 2017

Abstract: This paper aims at describing an uncertain multi-objective programming model involving uncertain variables with genetic algorithm approach. In this paper, the uncertain multiobjective programming model is converted into an equivalent crisp mathematical programming model. Then, a genetic algorithm is proposed to search the Stackelberg-Nash equilibrium of the uncertain multiobjective programming model with supporting numerical illustrations. Finally, sensitivity analysis study is carried out over parameters of algorithm and solution obtained to show efficiency and robustness of genetic algorithm for uncertain multiobjective programming model.

Online publication date: Mon, 04-Sep-2017

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 Mathematics in Operational Research (IJMOR):
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