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

2nd International Conference on Decision Science and Management, ICDSM 2019

作者： Xie, Meihua Deng, Lixin Hunan International Economic University ChangshaHunan410205 China Hunan Newsun Technology Co. Ltd. ChangshaHunan410100 China

ISBN: (纸本)9789811535871

It is an NP-complete problem to find several figures from a given set of figures and make their sum equal to a designated figure. In this paper, the linear programming model is used to model it, and its Excel solution method and processing scheme in the case of a large amount of figures are given. It is of great value to solve practical application problems. The application case shows that this method has good realizability. © Springer Nature Singapore Pte Ltd. 2020.

关键词： linear programming

来源：评论

学校读者我要写书评

暂无评论

Determination of optimal breakpoint set of overcurrent relays using modified depth-first search and mixed-integer linear programming

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2020年第23期14卷 5607-5616页

作者： Ghotbi-Maleki, Mahdi Chabanloo, Reza Mohammadi Ebadi, Mohammad Amin Savaghebi, Mehdi Shahid Beheshti Univ Dept Elect Engn AC Tehran Iran Univ Southern Denmark Dept Mech & Elect Engn Elect Engn Sect DK-5230 Odense Denmark

In the process of determination of breakpoints for overcurrent relays (OCR), different sets with equal number of OCRs can be selected as minimum breakpoint set (MBPS). Therefore, determination of the most appropriate MBPS is an issue which must be considered. This paper proposes a prioritization between different MBPSs based on the sum of operating times of OCRs. In this case, a set which results the minimum sum of operating times is selected as the appropriate MBPS. For this purpose, the proposed method combines two problems: determination of MBPS and coordination of OCRs, and is expressed in mixed-integer linear programming (MILP) form. Also, a modified depth-first search (DFS) algorithm is applied to determine the OCRs contained loops of studied networks. It is shown that the proposed method has the capability to be combined with previous defined expert rules in this field in order to consider the network conditions in the process of determination of optimal breakpoint set (OBPS). The proposed method has been implemented on various size networks, and the results show the effectiveness of proposed method in determining breakpoint set with the least number in first priority and minimum operating times of relays in second priority.

关键词： relay protection overcurrent protection integer programming linear programming search problems minimum breakpoint set mixed-integer linear programming optimal breakpoint set 14-bus 30-bus 118-bus 3120-bus overcurrent relays power delivery systems modified depth-first search network conditions expert rule

来源：评论

学校读者我要写书评

暂无评论

Minimum-Fuel Energy Management of a Hybrid Electric Vehicle via Iterative linear programming

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2020年第12期69卷 14575-14587页

作者： Robuschi, Nicolo Salazar, Mauro Viscera, Nicola Braghin, Francesco Onder, Christopher H. Politecn Milan Dept Mech Engn Via Giuseppe La Masa 1 I-20156 Milan Italy Eindhoven Univ Technol TU e Control Syst Technol Grp NL-5600 MB Eindhoven Netherlands Swiss Fed Inst Technol Inst Dynam Syst & Control Sonneggstr CH-8092 Zurich Switzerland

This paper presents models and optimization algorithms to compute the fuel-optimal energy management strategies for a parallel hybrid electric powertrain on a given driving cycle. Specifically, we first identify a mixed-integer model of the system, including the engine on/off signal and the gear-shift commands. Thereafter, by carefully relaxing the fuel-optimal control problem to a linear program, we devise an iterative algorithm to rapidly compute the minimum-fuel energy management strategies including the optimal gear-shift trajectory. We validate our approach by comparing its solution with the globally optimal one obtained solving the mixed-integer linear program and with the one resulting from the implementation of the optimal strategies in a high-fidelity nonlinear simulator. We showcase the effectiveness of the presented algorithm by assessing the impact of different powertrain configurations and electric motor size on the achievable fuel consumption. Our numerical results show that the proposed algorithm can assess fuel-optimal control strategies with low computational burden, and that powertrain design choices significantly affect the achievable fuel consumption of the vehicle.

关键词： Hybrid electric vehicles energy management supervisory control mixed-integer linear programming convex optimization linear programming

来源：评论

学校读者我要写书评

暂无评论

ROBUST SENSITIVITY ANALYSIS FOR linear programming WITH ELLIPSOIDAL PERTURBATION

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2020年第4期16卷 2029-2044页

作者： Gao, Ruotian Xing, Wenxun Tsinghua Univ Dept Math Sci Beijing 100086 Peoples R China

Sensitivity analysis is applied to the robust linear programming problem in this paper. The coefficients of the linear program are assumed to be perturbed in three perturbation manners within ellipsoidal sets. Our robust sensitivity analysis is to calculate the maximal radii of the perturbation sets to keep some properties of the robust feasible set. Mathematical models are formulated for the robust sensitivity analysis problems and all models are either reformulated into linear programs or convex quadratic programs except for the bi-convex programs where more than one row of the constraint matrix is perturbed. For the bi-convex programs, we develop a binary search algorithm.

关键词： linear programming sensitivity analysis robust optimization convex quadratic programming fractional programming

来源：评论

学校读者我要写书评

暂无评论

Event-triggered control of positive switched systems based on linear programming

引用

IET CONTROL THEORY AND APPLICATIONS 2020年第1期14卷 145-155页

作者： Liu, Laiyou Zhang, Junfeng Shao, Yu Deng, Xuanjin Hangzhou Dianzi Univ Sch Automat Hangzhou 310018 Zhejiang Peoples R China Minist Educ China Key Lab Syst Control & Informat Proc Shanghai 200240 Peoples R China Univ Lille INRIA CNRS CRIStALUMR 9189 F-59000 Lille France

This study focuses on the problem of event-triggered control for positive switched systems without/with input saturation in both continuous-time and discrete-time contexts. First, a 1-norm based event-triggering mechanism is established for continuous-time positive switched systems. By means of the matrix decomposition technique, an event-triggered controller for the systems is designed by decomposing controller gain matrix into non-positive and non-negative components. Under the designed controller, the resulting closed-loop systems are positive and stable. For the systems with input saturation, the saturation term is transformed into interval form under the event-triggering condition. Then, an event-triggered controller gain matrix and a cone domain of attraction gain matrix are designed for the corresponding interval systems in terms of linear programming, respectively. Furthermore, the presented approaches are extend to discrete-time positive switched systems without/with input saturation. Compared with existing results on positive switched systems, the designed event-triggered controller can reduce sampling frequency and save resources. Finally, two numerical examples are provided to verify the effectiveness of the obtained results.

关键词： control system synthesis closed loop systems discrete time systems linear programming continuous time systems matrix decomposition switching systems (control) sampling methods stability control nonlinearities linear programming input saturation 1-norm based event-triggering mechanism continuous-time positive switched systems closed-loop systems event-triggering condition event-triggered controller gain matrix interval systems discrete-time positive switched systems matrix decomposition nonnegative components nonpositive components attraction gain matrix sampling frequency reduction resource saving

来源：评论

学校读者我要写书评

暂无评论

Mitigating the impact of light rail on urban traffic networks using mixed-integer linear programming

引用

IET INTELLIGENT TRANSPORT SYSTEMS 2020年第6期14卷 523-533页

作者： Guilliard, Iain Trevizan, Felipe Sanner, Scott Australian Natl Univ Res Sch Comp Sci Canberra ACT Australia Univ Toronto Data Driven Decis Making Lab Mech & Ind Engn Toronto ON Canada

As urban traffic congestion is on the increase worldwide, many cities are increasingly looking to inexpensive public transit options such as light rail that operate at street-level and require coordination with conventional traffic networks and signal control. A major concern in light rail installation is whether enough commuters will switch to it to offset the additional constraints it places on traffic signal control and the resulting decrease in conventional vehicle traffic capacity. In this study, the authors study this problem and ways to mitigate it through a novel model of optimised traffic signal control subject to light rail schedule constraints solved in a mixed-integer linear programming (MILP) framework. The authors' key results show that while this MILP approach provides a novel way to optimise fixed-time control schedules subject to light rail constraints, it also enables a novel optimised adaptive signal control method that virtually nullifies the impact of the light rail presence, reducing average delay times in microsimulations by up to 58.7% versus optimal fixed-time control.

关键词： linear programming traffic engineering computing integer programming traffic control road traffic scheduling optimisation road traffic control urban traffic networks urban traffic congestion increase worldwide inexpensive public transit options street-level conventional traffic networks light rail installation resulting decrease conventional vehicle traffic capacity authors study optimised traffic signal control light rail schedule constraints mixed-integer linear programming framework fixed-time control schedules light rail constraints adaptive signal control method light rail presence 58 7% versus optimal fixed-time control

来源：评论

学校读者我要写书评

暂无评论

Adaptive linear programming Decoding of Nonbinary linear Codes Over Prime Fields

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第3期66卷 1281-1317页

作者： Rosnes, Eirik Helmling, Michael Simula UiB N-5020 Bergen Norway Univ Koblenz Landau Math Inst D-50722 Koblenz Germany Fraunhofer Inst Ind Math ITWM D-67663 Kaiserslautern Germany

In this work, we consider adaptive linear programming (ALP) decoding of linear codes over prime fields, i.e., the finite fields F-p of size p where p is a prime, when used over a p-ary input memoryless channel. In particular, we provide a general construction of valid inequalities (using no auxiliary variables) for the codeword polytope (or the convex hull) of the so-called constant-weight embedding of a single parity-check (SPC) code over any prime field. The construction is based on sets of vectors, called building block classes, that are assembled to form the left-hand side of an inequality according to several rules. In the case of almost doubly-symmetric valid classes we prove that the resulting inequalities are all facet-defining, while we conjecture this to be true if and only if the class is valid and symmetric. Valid symmetric classes impose certain symmetry conditions on the elements of the vectors from the class, while valid doubly-symmetric classes impose further technical symmetry conditions. For p=3, there is only a single valid symmetric class and we prove that the resulting inequalities together with the so-called simplex constraints give a complete and irredundant description of the codeword polytope of the embedded SPC code. For p>5, we show that there are additional facets beyond those from the proposed construction. As an example, for p=7, we provide additional inequalities that all define facets of the embedded codeword polytope. The resulting overall set of linear (in)equalities is conjectured to be irredundant and complete. Such sets of linear (in)equalities have not appeared in the literature before, have a strong theoretical interest, and we use them to develop an efficient (relaxed) ALP decoder for general (non-SPC) linear codes over prime fields. The key ingredient is an efficient separation algorithm based on the principle of dynamic programming. Furthermore, we construct a decoder for linear codes over arbitrary fields F-q with q=p(m) an

关键词： Maximum likelihood decoding linear codes Parity check codes Lattices Heuristic algorithms linear programming Adaptive linear programming (LP) decoding dynamic programming low-density parity-check (LDPC) codes pseudocodewords nonbinary codes

来源：评论

学校读者我要写书评

暂无评论

On the Convergence Time of a Natural Dynamics for linear programming

引用

ALGORITHMICA 2020年第2期82卷 300-315页

作者： Bonifaci, Vincenzo CNR IASI Natl Res Council Italy Rome Italy

We consider a system of nonlinear ordinary differential equations for the solution of linear programming (LP) problems that was first proposed in the mathematical biology literature as a model for the foraging behavior of acellular slime mold Physarum polycephalum, and more recently considered as a method to solve LP instances. We study the convergence time of the continuous Physarum dynamics in the context of the linear programming problem, and derive a new time bound to approximate optimality that depends on the relative entropy between projected versions of the optimal point and of the initial point. The bound scales logarithmically with the LP cost coefficients and linearly with the inverse of the relative accuracy, establishing the efficiency of the dynamics for arbitrary LP instances with positive costs.

关键词： linear programming Natural algorithm Physarum dynamics Relative entropy Mirror Descent

来源：评论

学校读者我要写书评

暂无评论

A linear programming-based framework for handling missing data in multi-granular data warehouses

引用

DATA & KNOWLEDGE ENGINEERING 2020年 128卷 101832-101832页

作者： Bimonte, Sandro Ren, Libo Koueya, Nestor Univ Clermont INRAE TSCF Campus Cezaux Aubiere France Univ Clermont CRCGM Campus Cezaux Aubiere France Univ Clermont LIMOS Campus Cezaux Aubiere France

Data Warehouse (DW) and OLAP systems are first citizens of Business Intelligence tools. They are widely used in the academic and industrial communities for numerous different fields of application. Despite the maturity of DW and OLAP systems, with the advent of Big Data, more and more sources of data are available, and warehousing this data can lead to important quality issues. In this work, we focus on missing numerical and categorical in presence of aggregated facts. Motivated by the lack of a formal approach for the imputation of this kind of data taking into account all type of aggregation functions (distributive, algebraic and holistic), we propose an new methodology based on linear programming. Our methodology allows dealing with the relaxed constraints over classical SQL aggregation functions. The proposed approach is tested on two well-known datasets. Experiments show the effectiveness of the proposed approach.

关键词： linear programming

来源：评论

学校读者我要写书评

暂无评论

Symmetric and Right-Hand-Side Hesitant Fuzzy linear programming

引用

IEEE TRANSACTIONS ON FUZZY SYSTEMS 2020年第2期28卷 215-227页

作者： Ranjbar, Mahdi Effati, Sohrab Ferdowsi Univ Mashhad Dept Appl Math Mashhad *** Razavi Khorasan Iran Ferdowsi Univ Mashhad Ctr Excellent Soft Comp & Intelligent Informat Pr Mashhad *** Razavi Khorasan Iran

Fuzzy set theory has been extensively employed in mathematical programming, especially in linear programming problems. As a generalization of fuzzy sets, a hesitant fuzzy set is a very useful tool in places where there are some hesitations in determining the membership of an element to a set. There are few studies on hesitant fuzzy linear programming problems;therefore, in this paper, we have studied such problems. For this purpose, at first, the motivation of this paper is explained;then, types of hesitant fuzzy linear programming models are introduced. Since it is not easy to examine all of the hesitant fuzzy models for the linear programming problems in one paper, we have restricted ourselves to symmetric and right-hand-side hesitant fuzzy linear programming problems with the flexible approach and then proposed two new approaches to solve them. Finally, to illustrate the applicability of the proposed approaches, three examples under hesitant fuzzy information are given.

关键词： Fuzzy sets Hafnium linear programming Mathematical programming Decision making Mathematical model Fuzzy linear programming (FLP) hesitant fuzzy linear programming (HFLP) hesitant fuzzy set (HFS)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：