Graduate Program in Industrial Engineering.Ulusoy, Gündüz.Menlioğlu, A. Tarık.2023-03-162023-03-161981.IE 1981 M52https://digitalarchive.library.bogazici.edu.tr/handle/123456789/13485In 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.30 cm.Network analysis (Planning)Branch and bound algorithms.Linear programming.90 leaves;