Biobjective Minimum Cost Flow Problem

Simple item page
dc.contributor.advisorGuta, Berhanu (PhD)
dc.contributor.authorTsige, Bedilu
dc.date.accessioned2018-07-12T05:39:47Z
dc.date.accessioned2023-11-04T12:32:11Z
dc.date.available2018-07-12T05:39:47Z
dc.date.available2023-11-04T12:32:11Z
dc.date.issued2013-07-24
dc.description.abstractIn 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 methoden_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/8137
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectNetwork Programmingen_US
dc.subjectBiobjective Minimum Cost Ow Problemen_US
dc.subjectE_Cient Extreme Pointsen_US
dc.subjectBiobjective Network Simplex Methoden_US
dc.subjectTwo Phase Methoden_US
dc.subjectWeighted Metric Methoden_US
dc.titleBiobjective Minimum Cost Flow Problemen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Bedilu Tsige.pdf
Size:
615.98 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download

Collections

Mathematics