Separability is a concept that is very difficult to define, and yet much of our scientific method is implicitly based upon the assumption that systems can sensibly be reduced to a set of interacting components. This paper examines the notion of separability in the creation of bi-ambiguous compounds that is based upon the CHSH and CH inequalities. It reports results of an experiment showing that...

This study considers pricing, production and transportation decisions in a Stackelberg game between three-stage, multi-product, multi-source and single-period supply chains called leader and follower. These chains consist of; manufacturers, distribution centers (DCs) and retailers. Competition type is horizontal and SC vs. SC. The retailers in two chains try to maximize their profit through pri...

The Generalised Nash Equilibrium Problem (GNEP) is a Nash game with the distinct feature that the feasible strategy set of a player depends on the strategies chosen by all her opponents in the game. This characteristic distinguishes the GNEP from a conventional Nash Game. These shared constraints on each player’s decision space, being dependent on decisions of others in the game, increases its ...

multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...

We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...

This paper deals with fuzzy goal programming approach to bilevel multi-objective programming problem with fuzzy parameters. In the proposed approach, the tolerance membership functions for the fuzzily described objective functions are defined by determining individual optimal solution of the objective functions of each of the decision makers. Since the objectives are potentially conflicting in ...

This paper presents a parametric bi-level quadratic programming problem with random rough coefficient in objective functions. An approach combines the convert technique of rough coefficient and Stackelberg strategy. An auxiliary problem is discussed and an algorithm as well as an example is presented.