Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...

In this paper, we propose a nonlinear multi-objective optimization problem whose parameters in the objective functions and constraints vary in between some lower and upper bounds. Existence of the efficient solution of this model is studied and gradient based as well as gradient free optimality conditions are derived. The theoretical developments are illustrated through numerical examples.

In the design of a cellular manufacturing system (CMS), one of the important problems is the cell formation in the form of machine grouping and parts family. This paper investigates an allocation of parts to common and specific cells; in such a way that each common cell is able to process all required parts. Further, this paper presents a mathematical programming model comprising such constrain...

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.

Objectives optimization and constraints satisfaction are two equally important goals to solve constrained many-objective problems (CMaOPs). However, most existing studies for CMaOPs can be classified as feasibility-driven-constrained evolutionary algorithms (CMaOEAs), they always give priority satisfy constraints, while ignoring the maintenance of population diversity dealing with conflicting o...

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...