We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...

In the classical problems of mathematical programming the coefficients are assumed to be exactly known. This assumption is seldom satisfied by great majority of real-life problems. Starting from the idea of K.D. Jamison and W.A. Lodwick which solve a fuzzy linear programming problem (2001), a linear fractional programming problem with fuzzy coefficients is described and a solving algorithm is o...

In this paper we present a new technique to compute non-dominated solutions, with an error that can be made as low as the user wants, in multiple objective linear fractional programming (MOLFP), using reference points. The basic idea is to divide, by the approximate ‘middle’, the non-dominate region in two sub-regions and to analyze each of them in order to try to discard one. The process is re...

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...

The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development ...