整数(计算机科学)
数学优化
整数规划
集合(抽象数据类型)
班级(哲学)
数学
线性规划
变量(数学)
空格(标点符号)
计算机科学
人工智能
操作系统
数学分析
程序设计语言
作者
Gökhan Ceyhan,Murat Köksalan,Banu Lokman
出处
期刊:Management Science
[Institute for Operations Research and the Management Sciences]
日期:2023-10-01
卷期号:69 (10): 6001-6020
被引量:1
标识
DOI:10.1287/mnsc.2023.4712
摘要
We consider a class of three-objective mixed-integer linear programs (MILPs) where at least one of the objective functions takes only discrete values. These problems commonly occur in MILPs where one or more of the three objective functions contain only integer decision variables. In such problems, the nondominated set consists of the union of nondominated edges and individual nondominated points. The nondominated edges can provide valuable insights on the trade-offs between the two continuous objectives at different levels of the discrete-valued objective. We develop an objective-space search algorithm that keeps partitioning the search space by progressively creating cones in the two-dimensional feasible space of the two continuous objectives for relevant values of the discrete-valued objective. The algorithm generates the nondominated points or edges in the nonincreasing order of the feasible values of the selected discrete-valued objective. Additionally, the algorithm uncovers all efficient integer variable vectors, including different vectors that lead to the same nondominated points or edges. We apply the algorithm to the day-ahead electricity market clearing problem. This paper was accepted by Chung Piaw Teo, optimization. Supplemental Material: The data files and e-companion are available at https://doi.org/10.1287/mnsc.2023.4712 .
科研通智能强力驱动
Strongly Powered by AbleSci AI