DocumentCode
375357
Title
An interactive method by founding weights via bargaining sets to solve the multiple objective linear programming problems
Author
Ahlatcioglu, Mehmet ; Tiryaki, Fatma
Author_Institution
Dept. of Math., Yildiz Univ., Istanbul, Turkey
Volume
1
fYear
2001
fDate
2001
Firstpage
378
Abstract
In this paper, the authors consider the multiple objective linear programming (MOLP) problem which is defined as a linear type of the multiple objective mathematical programming. The bargaining set is obtained by considering the discussion that may actually take place during a play of the game. Thus the possible threats and counterthreats made by several players are considered. The solution of game corresponds to found nucleolus of the bargaining set
Keywords
linear programming; management science; operations research; bargaining sets; convex polyhedral set; management theory; multiple objective linear programming problems; weights founding; Art; Delta modulation; Equations; Linear programming; Mathematical programming; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Management of Engineering and Technology, 2001. PICMET '01. Portland International Conference on
Conference_Location
Portland, OR
Print_ISBN
1-890843-06-7
Type
conf
DOI
10.1109/PICMET.2001.952269
Filename
952269
Link To Document