In this paper an enumeration technique for solving linear fractional fuzzy set covering problem is defined. Set covering problems belong to the class of 0-1 integer programming problems that are NP-complete. Many applications arises having the set covering problems, switching theory, testing of VLSI circuits and line balancing often take on a set covering structure. Linear fractional set coveri...

The 0-1 fractional programming problem minimizes the fractional objective function (c 1 x 1 + c 2 x 2 + + c n x n )=(d 1 x 1 + d 2 x 2 + + d n x n ) = cx=dx under the condition that x = (x 1 ; ; x n ) 2 f0; 1g n ; where is the set of feasible solutions. For a fractional programming problem, Dinkelbach developed an algorithm which obtains an optimal solution of the given problem by solving a seq...

In this paper, we study the classical sensitivity analysis when the right hand – side vector, and the coefficients of the objective function are allowed to vary.

AlcOa'act. In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality tI-.cory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate tI'.e t~eory in this connecti...

this paper aims to investigate the integrated production/distribution and inventory planning for perishable products with fixed life time in the constant condition of storage throughout a two-echelon supply chain by integrating producers and distributors. this problem arises from real environment in which multi-plant with multi-function lines produce multi-perishable products with fixed life ti...

in this paper we investigate multi-objective integer linear programming (moilp) problems with unbounded feasible region and introduce recession direction for moilp problems. then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of moilp problems. finally we present some examples with unbounded feasible region and fi...