.png){kind=icon}
返回
Enumeration-based approach to solving parametric linear complementarity problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2015.09.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a solution method for parametric linear complementarity problems (PLCP) that relies on an enumeration technique to discover all feasible bases. The enumeration procedure is based on evaluating all possible combinations of active constraints and testing for feasibility. Although the enumeration approach is known to grow exponentially in the number of constraints, the formulation of the PLCP allows incorporation of cheap rank tests to quickly prune the infeasible directions in the exploration. The motivation for the development of the enumeration based PLCP solver is that it represents a direct method to solve parametric linear and quadratic optimization problems as well as their mixed-integer counterparts. These types of problems often arise in the field of model predictive control for linear and hybrid systems. The enumeration based PLCP solver offers another alternative to compute explicit solutions in the field of hybrid model predictive control that can be extremely effective in some important cases. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Model predictive control
Multiparametric programming
Parametric linear-complementarity problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
查看更多内容