.png){kind=icon}
返回
Solving the interval linear programming problem: A new algorithm for a general case
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2017.10.020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Based on the binding constraint indices of the optimal solution to the linear programming (LP) model, a feasible system of linear equations can be formed. Because an interval linear programming (ILP) model is the union of numerous LP models, an interval linear equations system (ILES) can be formed, which is the union of these conventional systems. Hence, a new algorithm is introduced in which an arbitrary characteristic model of the ILP model is chosen and solved. The set of indices of its binding constraints is then obtained. This set is used to form and solve an ILES using the enclosure method. If all the components of the interval solutions to this system are strictly non-negative, the optimal solution set (OSS) of the ILP model is determined as the subscription of the zone created by reversing the signs of the binding constraints of the worst model and the binding constraints of the best model. The solutions to several problems obtained by the new algorithm and a Monte Carlo simulation are compared. The proposed algorithm is applicable to large-scale problems. To this end, an ILP model with 270 constraints and 270 variables is solved. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Optimal solution set
Interval linear programming
Interval linear equations system
Monte Carlo simulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Patients Who Had Highly Active RRMS and an Inadequate Response to Prior Therapy Demonstrated Durable Efficacy with Alemtuzumab: 5-Year Follow-Up of the CARE-MS II Study (P6.164).png)
Neurology
NeurologyIF0
PREAI
分享收藏
查看更多内容