Solutions of multiple objective linear programming problems by applying T-sets in imprecise environment Online publication date: Wed, 26-Feb-2020
by Arindam Garai; Palash Mandal; Tapan Kumar Roy
International Journal of Operational Research (IJOR), Vol. 37, No. 2, 2020
Abstract: In this paper, technique to find Pareto optimal solutions to multiple objective linear programming problems under imprecise environment is discussed. In imprecise environment, we observe that more preferable optimal values may be obtained by allowing membership functions to take arbitrary values, i.e., by removing constraints that impose membership values to fall in range between zero and one, than existing fuzzy optimisation techniques. Further, membership functions are not utilised as per definitions in existing fuzzy optimisation techniques. Also, such constraints may make the model infeasible. Consequently, one set viz. T-set is defined to supersede fuzzy set to represent impreciseness. Next, one general algorithm comprising T-sets, is given to find Pareto optimal solutions to multiple objective linear programming problems in imprecise environment. Numerical examples further illustrate proposed algorithm. Finally conclusions are drawn.
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook