An algorithm for solution of interval games
by Prasun Kumar Nayak; Sibasis Bandyopadhyay; Madhumangal Pal
International Journal of Operational Research (IJOR), Vol. 20, No. 2, 2014

Abstract: A new method of solution of a two person interval game without saddle point is proposed and treated in this paper. The solution is obtained by using multisection technique, whose concept is the multiple bi-section technique and the basis is the inequality relation of interval numbers. On the basis of multisection technique, max min and min max algorithm is given. An algorithm has been given and a numerical example is provided to illustrate the methodology.

Online publication date: Sat, 21-Jun-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 Operational Research (IJOR):
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