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

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

We introduce in this paper a new starting mechanism for multiple-objective linear programming (MOLP) algorithms. This makes it possible to start an algorithm from any solution in objective space. The original problem is first augmented in such a way that a given starting solution is feasible. The augmentation is explicitly or implicitly controlled by one parameter during the search process, whi...

this paper surveys parallel scheduling problems and metrics correlated to and then applys metrics to make decision in comparison to other policy schedulers. parallel processing is new trend in computer science especially in embedded and multicore systems whereas needs more power consumption to reach speed up. the qos requirement for users is to have good responsiveness and for service providers...

We study an extension of the Linear Multiple Choice Knapsack (LMCK) Problem that considers two criteria. The problem can be used to find the optimal allocation of an available resource to a group of disjoint sets of activities, while also ensuring that a certain balance on the resource amounts allocated to the activity sets is attained. The first criterion maximizes the profit incurred by the i...