Speaker: Prof Jianming Shi
School of management, Tokyo University of Science
Time: 2018.9.30 Sunday, 14:00-15:00
Place: 数学楼二楼学术报告厅
Abstract: This talk concerns the multi-objective linear programming problems.The problem is known to be NP-hard. We show that this problem can be formulated as a mixed integer programming (MIP) problem and we propose an algorithm to give an optimal solution by solving the MIP problem.
We also give two applications of this problem below: 1) minimum maximal flow (MMF) problem, which needs a minimum maximal flow in a given network; 2) the least distance problem in data envelopment analysis. The preliminary computational experiments show that the proposed approach is very efficient.
威尼斯人