Mekuria, Bedilu Tsige (2013) Biobjective Minimum Cost Flow Problem. Masters thesis, Addis Ababa University.
![[img]](http://thesisbank.jhia.ac.ke/style/images/fileicons/application_pdf.png) |
PDF (Biobjective Minimum Cost Flow Problem)
Bedilu, Tsige Mekuria.pdf - Accepted Version Restricted to Repository staff only Download (630kB) | Request a copy |
Abstract
In this project basically theory and algorithms for a single commodity flow problems simultaneously optimizing two objectives ( Biobjective ) are addressed. For both continuous and integer case methods like Biobjective network simplex method, two phase method and weighted metric methods are presented to compute the complete set of efficient solution in the objective space . In addition to these main ideas, the project also explains some points about multiobjective optimization problem and network flow problems.
| Item Type: | Thesis (Masters) |
|---|---|
| Uncontrolled Keywords: | Network programming; Biobjective minimum cost flow problem; Efficient extreme points; Biobjective Network simplex method; Two phase method; weighted metric method. |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Africana |
| Depositing User: | Selom Ghislain |
| Date Deposited: | 10 Sep 2018 13:46 |
| Last Modified: | 10 Sep 2018 13:46 |
| URI: | http://thesisbank.jhia.ac.ke/id/eprint/5117 |
Actions (login required)
 |
View Item |