A Stackelberg location with fuzzy random demands based upon possibility and necessity measures
by Takeshi Uno; Kosuke Kato; Hideki Katagiri
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 4, No. 3, 2014

Abstract: This paper focuses on a competitive facility location between a leader and a follower on a tree network with demands given uncertainly and vaguely. By representing them as fuzzy random variables, it can be formulated as a fuzzy random programming problem for finding a Stackelberg equilibrium. For solving the problem, new Stackelberg location problems are proposed by utilising possibility and necessity measures for the leader and the follower under some chance constraints. Several properties can be shown based upon the characteristics of Stackelberg location.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com