In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work to effectively implement ?-constraint method produce complete set of non dominated points. convergence algorithm has been established theoretically. Further comparative study some existing also made.

Abstract In this article we introduce robustness measures in the context of multi-objective integer linear programming problems. The proposed are line with concept decision robustness, which considers uncertainty respect to implementation a specific solution. An efficient solution is considered be robust if many solutions its neighborhood as well. This rather new area research differs from conc...

Multi-objective De Novo linear programming (MODNLP) is problem for designing optimal system by reshaping the feasible set (Fiala [3] ). This paper deals with MODNLP having possibilistic objective functions coefficients. The problem is considered by inserting possibilistic data in the objective functions coefficients. The solution of the problem is defined and established under the using of effi...