Buradasınız

ÇOK AMAÇLI LİNEER PROGLAMLAMA PROBLEMLERİ İÇİN AĞIRLIKLARI BULMADA OYUNLAR KURAMININ KULLANIMINA İLİŞKİN BİR ÖNERİ

A PROPOSAL ON UTILIZATION OF GAME THEORY TO FIND WEIGHTS FOR MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEMS

Journal Name:

Publication Year:

Abstract (2. Language): 
In this paper Multiple Objective Linear Programming (MOLP) problem is transformed into Linear Programming (LP) problem by using suitable weights for each function. Game Theory and Decision Matrix are used to find the weights.
Abstract (Original Language): 
Bu çalışmada Çok Amaçlı Lineer Programlama problemi uygun ağırlıklar kullanılarak Lineer Programlama problemine dönüştürül¬' inektedir. Ağırlıkların bulunmasında Oyunlar Kuramı ve Karar Matrisi kullanılmaktadır.
1-8

REFERENCES

References: 

[1]
BELENSON
, S.M. arid KAPUR, K.C.
[2]
GEOFFRION
, A.M.
[3] IS ERMANN, H.
[4]
M
c KINSEY, J.
[5]
ROBERTS
, A'.W. and VARBERG, D.E.
[6] STEUER, R.E.
REFERENCES
An Algorithm for Solving Multicriterion Linear Programming Problems With Examples, Operational Research Quarterly, 24 (1973), No. I, 65-77.
Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, 22 (1968), 618-630.
Proper Efficiency and the Linear Vector Maximization Problem, Operations Research, 22 (1974), 189-191.
Introduction to the Theory of Games, McGraw - Hill Book Company, Inc., 1952, pg. 24.
Convex Functions, Academic Press, New York and London, 1973, pg. 75.
Multiple Criteria Optimization: Theory, Computation and the Applications, John Wiley and Sons, 1986, pg. 215.

Thank you for copying data from http://www.arastirmax.com