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.
