.png){kind=icon}
返回
An algorithm for optimizing a linear function over an integer efficient set
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.02.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Optimizing a linear function over the efficient set of a multiobjective integer linear programming (MOILP) problem is a topic of unquestionable practical as well as mathematical interest within the field of multiple criteria decision making. As known, those problems are particularly difficult to deal with due to the discrete nature of the efficient set, which is not explicitly known, nor a suitable implicit description is available. In this work an exact algorithm is presented to optimize a linear function over the efficient set of a MOILP. The approach here proposed defines a sequence of progressively more constrained single-objective integer problems that successively eliminates undesirable points from further consideration. The algorithm has been coded in C Sharp, using CPLEX solver, and computational experiments have been undertaken in order to analyze performance properties of the algorithm over different problem instances randomly generated. (c) 2008 Elsevier B.V. All rights reserved.
Keyword:
Multiple objective programming
Optimization over the efficient set
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏A method for finding the set of non-dominated vectors for multiple objective integer linear programs一种求多目标整数线性规划非支配向量集的方法
PREAI
分享收藏
分享收藏A review of interactive methods for multiobjective integer and mixed-integer programming多目标整数和混合整数规划的交互式方法综述
OAAI
OAAI分享收藏A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs一种多目标混合整数线性规划非支配向量分散良好子集的寻找方法
PREAI
分享收藏
查看更多内容