.png){kind=icon}
返回
Generating linear programming instances with controllable rank and condition number
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2023.106471.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Instance generation is crucial for linear programming algorithms, especially for the evaluation and verification of corresponding methods. This study proposes a general framework for designing linear programming instances based on the preset optimal solution. First, we give a constraint matrix generation method with controllable condition number and rank from the perspective of matrix decomposition. Based on the preset optimal solution, a bounded feasible linear programming instance is generated with the right-hand side and objective coefficients satisfying the primal feasibility and dual feasibility. In addition, we provide three neighborhood exchange operators and prove that instances generated under this method can fill the entire space of feasible bounded linear programming instances. We experimentally validate that the proposed schedule generates more controllable linear programming instances in rank and condition number, while neighborhood exchange operators construct more complex instances.
Keyword:
Linear programming Instance generation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Clinicopathologic features and oncologic outcomes of colorectal cancer patients with extremely high carcinoembryonic antigen极高风险癌胚抗原升高的结直肠癌患者的临床病理特征与肿瘤学结局
PREAI
分享收藏分享收藏Instance space analysis and algorithm selection for the job shop scheduling problem作业车间调度问题的实例空间分析与算法选择
PREAI
分享收藏
查看更多内容