In this paper we develop a primal-dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal-dual simplex algorithm for multi-objective linear prog...
详细信息
In this paper we develop a primal-dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal-dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483-497, 2007). We illustrate the algorithm with an example and provide numerical results.
We develop a primal-dual simplex algorithm for multicriteria linear programming. It is based on the scalarization theorem of Pareto optimal solutions of multicriteria linear programs and the single objective primal-du...
详细信息
We develop a primal-dual simplex algorithm for multicriteria linear programming. It is based on the scalarization theorem of Pareto optimal solutions of multicriteria linear programs and the single objective primal-dual simplex algorithm. We illustrate the algorithm by an example, present some numerical results, give some further details on special cases and point out future research.
暂无评论