Biobjective Minimum Cost Flow Problem

No Thumbnail Available

Date

2013-07-24

Journal Title

Journal ISSN

Volume Title

Publisher

Addis Ababa University

Abstract

In this project basically theory and algorithms for a single commodity ow problems simultaneously optimizing two objectives ( Biobjective ) are addressed. For both con- tinuous and integer case methods like Biobjective network simplex method, two phase method and weighted metric methods are presented to compute the complete set of ecient solution in the objective space . In addition to these main ideas, the project also explains some points about multiobjective optimization problem and network ow problems. Keywords: Network programming; Biobjective minimum cost ow problem; Ecient extreme points; Biobjective Network simplex method; Two phase method; weighted metric method

Description

Keywords

Network Programming, Biobjective Minimum Cost Ow Problem, E_Cient Extreme Points, Biobjective Network Simplex Method, Two Phase Method, Weighted Metric Method

Citation

Collections