We show that previous filtering propositions on two-sided stability problems do not enforce arc consistency (AC), however they maintain Bound(D) Consistency (BC(D)). We propose an optimal algorithm achieving BC(D) with O(L) time complexity where L is the length of the preference lists. We also show an adaptation of this filtering approach to achieve AC. Next, we report the first polynomial time...

This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems.  All of the lower and upper approximatio...

We develop a model of many-to-one matching markets in which agents with multiunit demand aim to maximize cardinal linear objective subject multidimensional knapsack constraints. The choice functions are therefore not substitutable. As result, pairwise stable matchings may exist and even when they do, be highly inefficient. provide an algorithm that finds group-stable approximately satisfies all...

This paper is concerned with some feasibility issues in mathematical programs with equilibrium constraints (MPECs) where additional joint constraints are present that must be satis ed by the state and design variables of the problems. We introduce su cient conditions that guarantee the feasibility of these MPECs. It turns out that these conditions also guarantee the feasibility of the quadratic...

in this paper, a new alternative method for order reduction of high order systems is presented based on optimization of multi objective fitness function by using harmony search algorithm. at first, step response of full order system is obtained as a vector, then, a suitable fixed structure considered for model order reduction which order of original system is bigger than fixed structure model. ...