期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2011
卷号：3
期号：12
页码：3790-3799
出版社：Engg Journals Publications
摘要：Recent developments in multi objective programming by Geoffrion, Mond and Wolfe [3, 8, 13] show interesting results with convex functions and related scalar objective programs. In this paper we compare the solution of multi objective linear programming problem with this solution obtained in Zimmermann�s method. Zimmermann used membership function to solve the multi-objective linear programming problems. We have used ? -cut to solve the multi objective linear programming problems.
