期刊
COMPUTERS & OPERATIONS RESEARCH
卷 162, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2023.106471
关键词
Linear programming Instance generation
This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据