Solution procedures for some multiobjective network problems

dc.contributor	Graduate Program in Industrial Engineering.
dc.contributor.advisor	Ulusoy, Gündüz.
dc.contributor.author	Menlioğlu, A. Tarık.
dc.date.accessioned	2023-03-16T10:30:44Z
dc.date.available	2023-03-16T10:30:44Z
dc.date.issued	1981.
dc.identifier.other	IE 1981 M52
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/13485
dc.description.abstract	In this thesis, solution procedures for mUltiobjective linear network problems and bicriteria fixed charge network problems are presented. A labeling algorithm for multobjective linear network simplex method is developed by incorporating a method of multiobjective LP and extended to the case with lower and upper bounds on the arc flows. A branch and bbund algorithm is given for the bicriteria fixed charge problem in order to generate the efficient extreme points.
dc.format.extent	30 cm.
dc.publisher	Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1981.
dc.subject.lcsh	Network analysis (Planning)
dc.subject.lcsh	Branch and bound algorithms.
dc.subject.lcsh	Linear programming.
dc.title	Solution procedures for some multiobjective network problems
dc.format.pages	90 leaves;