检索结果-内蒙古大学图书馆

Multiparametric linear programming with applications to control

EUROPEAN JOURNAL OF CONTROL 2007年第2-3期13卷 152-170页

作者： Jones, C. N. Baric, M. Morari, M. ETH Automat Control Lab Zurich Switzerland

parametric programming has received a lot of attention in the control literature in the past few years because model predictive controllers (MPC) can be posed in a parametric framework and hence pre-solved offline, resulting in a significant decrease in on-line computation effort. In this paper we survey recent work on parametric linear programming (pLP) from the point of view of the control engineer. We identify three types of algorithms, two arising from standard convex hull paradigms and one from a geometric intuition, and classify all currently proposed methods tinder these headings. Through this classification, we identify a third standard convex hull approach that offers significant potential for approximation of pLPs for the purpose of control. We present the resulting algorithm, based on the beneath/beyond paradigm, that computes low-complexity approximate controllers that guarantee stability and feasibility.

关键词： parametric linear programming approximation explicit model predictive control

来源：评论

学校读者我要写书评

暂无评论

Multiparametric linear programming for Control

引用

第二十七届中国控制会议

作者： Morari M. Jones C.N. Zeilinger M.N. Bari M. Automatic Control Lab ETH ZurichPhysikstrasse 3ETL I28CH-8092 ZurichSwitzerland

ISBN: (纸本)9787811243901

Constrained finite time optimal control problems can be expressed as mathematical programs parameterized by the current state of the system:the so-called multi-parametric *** problems have received a great deal of attention in the control community during the last few years because solving the parametric program is equivalent to synthesizing the optimal state-feedback *** many cases of interest,the resulting synthesized controllers are simple piecewise-affine functions,which enables receding horizon control to be used not only in slowly sampled systems requiring powerful computers but now also in high-speed embedded *** primary limitation of these optimal’explicit solutions’is that the complexity can grow quickly with problem *** this talk I will introduce new methods to compute approximate explicit and online control laws that can trade-off time and space complexity against sub-optimality while providing guarantees of stability and feasibility.

关键词： parametric linear programming Approximation Explicit model predictive control

来源：评论

学校读者我要写书评

暂无评论

Multiparametric linear programming with applications to control

Multiparametric linear programming with applications to cont...

引用

44th IEEE Conference on Decision Control/European Control Conference (CCD-ECC)

作者： Jones, C. N. Baric, M. Morari, M. ETH Automat Control Lab Zurich Switzerland

关键词： parametric linear programming approximation explicit model predictive control

来源：评论

学校读者我要写书评

暂无评论

POWER ARRIVAL EVALUATION OF BULK SYSTEM INCLUDING NETWORK CONSTRAINTS BASED ON linear-programming APPROACH

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1991年第1期6卷 37-42页

作者： CHEN, LN SUWA, H TOYODA, J Department of Electrical Engineering University of Tohoku Sendai Japan

This paper provides several useful support tools of power system scheduling and planning. First, we propose a fast method, which is used to evaluate the generating units and transmission capability of power system, and calculate the optimal reserve of each demand side, based on two-step linear programming technique. Then, a new support tool of power system planning is described by using the parametric linear programming. The proposed support tool does not only fast give a optimal reserve curve of the system, but also provides some diagnosis information of system weak location for the expansion planning and maintenance scheduling decision of transmission lines or generating units. Third, we take into account the outages of generators and transmission lines, and show a possible method to estimate the reliability(LOLP) of multi-area power system by making use of linear programming. Several examples have been used to verify the proposed methodology and illustrate the application. The results show that our approaches are very simple, fast and efficient for the generation and transmission capability evaluation or the contingency test of power system as support tools.

关键词： EXPANSION PLANNING MAINTENANCE SCHEDULING NETWORK CONSTRAINTS SUPPORT TOOL POWER ARRIVAL CAPABILITY 2-STEP LP APPROACH RELIABILITY ESTIMATION parametric linear programming

来源：评论

学校读者我要写书评

暂无评论

IDENTIFYING THE EFFICIENT EXTREME-POINTS OF THE 3-OBJECTIVE linear-programming PROBLEM

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 1993年第1期44卷 81-85页

作者： BRYSON, N HOWARD UNIV SCH BUSINESSDEPT INFORMAT SYST & ANALWASHINGTONDC 20059 USA

In this paper a new method for generating the set of efficient extreme-points for the three-objective linear programming problem is presented. This method successfully exploits the fact that vectors that are strictly efficient in associated multi-objective problems of lower dimensions are also efficient in the full multi-objective problem.

关键词： MULTIOBJECTIVE linear programming parametric linear programming

来源：评论

学校读者我要写书评

暂无评论

Another look at linear programming for feature selection via methods of regularization

引用

STATISTICS AND COMPUTING 2014年第5期24卷 885-905页

作者： Yao, Yonggang Lee, Yoonkyung SAS Inst Inc Cary NC 27513 USA Ohio State Univ Dept Stat Columbus OH 43210 USA

We consider statistical procedures for feature selection defined by a family of regularization problems with convex piecewise linear loss functions and penalties of l (1) nature. Many known statistical procedures (e.g. quantile regression and support vector machines with l (1)-norm penalty) are subsumed under this category. Computationally, the regularization problems are linear programming (LP) problems indexed by a single parameter, which are known as 'parametric cost LP' or 'parametric right-hand-side LP' in the optimization theory. Exploiting the connection with the LP theory, we lay out general algorithms, namely, the simplex algorithm and its variant for generating regularized solution paths for the feature selection problems. The significance of such algorithms is that they allow a complete exploration of the model space along the paths and provide a broad view of persistent features in the data. The implications of the general path-finding algorithms are outlined for several statistical procedures, and they are illustrated with numerical examples.

关键词： Grouped regularization l(1)-norm penalty parametric linear programming Quantile regression Simplex method Structured learning Support vector machines

来源：评论

学校读者我要写书评

暂无评论

APPLICATIONS OF THE parametric programming PROCEDURE

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1991年第1期54卷 66-73页

作者： BRYSON, N HOWARD UNIV SCH BUSINESSWASHINGTONDC 20059 USA

Many classes of mathematical programming problems can be formulated as a linear program with a parametric objective function. Gass and Saaty developed in the early 1950's a parametric programming procedure for solving the latter problem. This procedure is relevant to solution strategies for many problem types but is underutilized, often because the relationship of the procedure to the relevant problem class is not recognized. In this paper five recent applications of the parametric programming procedure are presented.

关键词： parametric linear programming LAGRANGIAN RELAXATION CLUSTERING MULTIOBJECTIVE programming NETWORK programming

来源：评论

学校读者我要写书评

暂无评论

A construction method in parametric programming

引用

Mathematical programming 1979年第1期16卷 21-36页

作者： Klein Haneveld, W.K. van der Meer, C.L.J. Peters, R.J. University of Groningen Groningen Netherlands

We consider a linear programming problem, with two parameters in the objective function, and present an algorithm for finding the decomposition of the parameter space into maximal polyhedral areas in which particular basic solutions are optimal. Special attention is paid to fill up areas of degenerate solutions. © 1979 The Mathematical programming Society.

关键词： Construction Method Degeneracy parametric linear programming Primal Lexicographic Method

来源：评论

学校读者我要写书评

暂无评论

On the complexity of the convex liftings-based solution to inverse parametric convex programming problems

On the complexity of the convex liftings-based solution to i...

引用

European Control Conference (ECC)

作者： Nguyen, N. A. Olaru, S. Rodriguez-Ayerbe, P. Univ Paris Sud CentraleSupelec L2S CNRSUMR 8506 3 Rue Joliot Curie F-91192 Gif Sur Yvette France

ISBN: (纸本)9783952426937

The link between linear model predictive control (MPC) and parametric linear/quadratic programming has reached maturity in terms of the characterization of the structural properties and the numerical methods available for the effective resolution. The computational complexity is one of the current bottlenecks for these control design methods and inverse optimality has been recently shown to provide a new perspective for this challenge. However, the question of the minimal complexity of inverse optimality formulation is still open and much under discussion. In this paper we revisit some recent results by pointing out unnecessary geometrical complications which can be avoided by the interpretation of the optimality conditions. Two algorithms for fine-tuning inverse optimality formulation will be proposed and the results will be interpreted via two illustrative examples in comparison with existing formulations.

关键词： computational complexity convex programming linear programming predictive control quadratic programming MPC convex lifting-based solution fine-tuning inverse optimality formulation inverse parametric convex programming problem linear model predictive control parametric linear programming parametric quadratic programming Computational complexity Cost function Europe programming Redundancy

来源：评论

学校读者我要写书评

暂无评论

A problem expanding parametric programming method for solving the job shop scheduling problem

引用

Annals of Operations Research 1985年第1期4卷 327-342页

作者： Thompson, G.L. Zawack, D.J. Graduate School of Industrial Administration Carnegie-Mellon University Pittsburgh 15213 PA United States American Airlines Dallas 75261-9616 Texas P.O. Box 619616 United States

A new zero-one integer programming model for the job shop scheduling problem with minimum makespan criterion is presented. The algorithm consists of two parts: (a) a branch and bound parametric linear programming code for solving the job shop problem with fixed completion time;(b) a problem expanding algorithm for finding the optimal completion time. Computational experience for problems having up to thirty-six operations is presented. The largest problem solved was limited by memory space, not computation time. Efforts are under way to improve the efficiency of the algorithm and to reduce its memory requirements. © 1985 J.C. Baltzer A.G., Scientific Publishing Company.

关键词： branch and bound Job shop scheduling algorithm parametric linear programming problem expansion zero-one integer program

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：