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

Tri-level transmission expansion planning under intentional attacks: virtual attacker approach - part I: formulation

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2019年第3期13卷 390-398页

作者： Nemati, Hadi Latify, Mohammad Amin Yousefi, Gholam Reza Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran

The first part of this two-part paper proposes tri-level transmission expansion planning (TTEP) under physical intentional attacks. In the first level, the network planner looks for an optimal transmission expansion plan to fortify the power network. In the second level, the attacker tries to maximise damages to the network. In the third level, the adverse effects of the attacks on the network operation are minimised by the network operator. Since the third level problem is a linear programming (LP) problem, the second and third levels are converted into a single-level model by using primal-dual transformation, and consequently, TTEP is converted into a bi-level programming problem. To achieve a single-level model, instead of assuming a unique attacker, a cooperative game of multiple virtual attackers (VAs) of which every VA is to maximise the damage by attacking one transmission line is introduced and modelled. The conditions that enforce Nash and Pareto equilibria of this game are derived as linear constraints which are lower level equivalent. By using this equivalence, the aforementioned bi-level TTEP model is converted into a single-level model that can be recast as a mixed integer LP problem. The numerical results are provided in the second part.

关键词： integer programming linear programming power transmission planning game theory physical attacks network operator network operation linear programming problem single-level model bi-level programming problem multiple virtual attackers virtual attacker approach tri-level transmission expansion planning model physical intentional attacks network planner problem optimal transmission expansion plan power network bi-level TTEP model Pareto equilibrium Nash equilibrium linear constraints

来源：评论

学校读者我要写书评

暂无评论

Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

引用

OPERATIONS RESEARCH LETTERS 2000年第5期27卷 199-207页

作者： McCormick, ST Shioura, A Univ British Columbia Fac Commerce & Business Adm Vancouver BC V6T 1Z2 Canada Sophia Univ Dept Mech Engn Chiyoda Ku Tokyo 1028554 Japan

This paper shows that the minimum ratio canceling algorithm of Wallacher (Unpublished manuscript, Institut fur Ange-wandte Mathematik, Technische Universitat, Braunschweig (1989)) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with geometric convergence. This implies that when we have a negative cycle oracle, this algorithm will compute an optimal solution in (weakly) polynomial time. We then specialize the algorithm to linear programming on unimodular linear spaces, and to the minimum cost flow and (dual) tension problems. We construct instances proving that even in the network special cases the algorithm is not strongly polynomial. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： negative cycle canceling algorithm minimum ratio cycle linear programming problem unimodular linear space minimum cost flow minimum cost tension

来源：评论

学校读者我要写书评

暂无评论

Parameter configurations for hole extraction in cellular neural networks (CNN)

引用

ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING 2002年第2期32卷 149-155页

作者： Anguita, M Fernández, FJ Díaz, AF Cañas, A Pelayo, FJ Univ Granada Fac Ciencias Dept Arquitectura & Tecnol Comp E-18071 Granada Spain

It is shown that the holes of the objects in an input image with a CT-CNN [1] or a DT-CNN [2] may be obtained in a single transient using just one linear parameter configuration. A set of local rules is given that describe how a CNN with a linear configuration may extract the hole of the objects of an input image in a single transient. The parameter configuration for DT-CNNs or for CT-CNNs is obtained as the solution of a single linear programming problem, including robustness as an objective. The tolerances to multiplicative and additive errors caused by circuit inaccuracies for the linear hole-extraction configurations proposed have been deduced. These tolerable errors have been corroborated by simulations. The tolerance to errors and the speed of the CT-CNN linear configuration proposed for hole extraction are compared with those of the CT-CNN nonlinear configuration found in the bibliography [3].

关键词： cellular neural networks hole extraction tolerance to errors linear programming problem

来源：评论

学校读者我要写书评

暂无评论

An alternative approach for compatibility of two discrete conditional distributions

引用

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS 2016年第15期45卷 4416-4432页

作者： Ghosh, Indranil Nadarajah, Saralees Austin Peay State Univ Dept Math Clarksville TN 37044 USA Univ Manchester Sch Math Manchester Lancs England

Conditional specification of distributions is a developing area with increasing applications. In the finite discrete case, a variety of compatible conditions can be derived. In this paper, we propose an alternative approach to study the compatibility of two conditional probability distributions under the finite discrete setup. A technique based on rank-based criterion is shown to be particularly convenient for identifying compatible distributions corresponding to complete conditional specification including the case with *** proposed methods are illustrated with several examples.

关键词： Compatible conditional distribution linear programming problem Rank-based criterion 62E20

来源：评论

学校读者我要写书评

暂无评论

Optimum coordination of overcurrent relay timing using continuous genetic algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第9期38卷 11286-11292页

作者： Bedekar, Prashant P. Bhide, Sudhir R. Visvesvaraya Natl Inst Technol Dept Elect Engn Nagpur 440010 Maharashtra India

Overcurrent relays (OCR) are the major protection devices in a distribution system. To reduce the power outages, mal-operation of the backup relays should be avoided, and therefore. OCR time coordination in power distribution network is a major concern of protection engineer. The OCR time coordination in ring fed distribution networks is a highly constrained optimization problem. The purpose is to find an optimum relay setting to minimize the time of operation of relays and at the same time, to avoid the mal-operation of relays. This paper presents continuous genetic algorithm (CGA) technique for optimum coordination of OCR in a ring fed distribution system. Constraints are incorporated in the fitness function making use of the penalty method. The CGA is inherently faster than binary genetic algorithm (GA) because the chromosomes do not have to be decoded. Also the CGA gives an advantage of requiring less storage than binary GA. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Constrained optimization Continuous genetic algorithms linear programming problem Overcurrent relay coordination

来源：评论

学校读者我要写书评

暂无评论

The s-monotone index selection rules for pivot algorithms of linear programming

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年第3期221卷 491-500页

作者： Csizmadia, Zsolt Illes, Tibor Nagy, Adrienn Eotvos Lorand Univ Sci Dept Operat Res Budapest Hungary

In this paper we introduce the concept of s-monotone index selection rule for linear programming problems. We show that several known anti-cycling pivot rules like the minimal index, Last-In-First-Out and the most-often-selected-variable pivot rules are s-monotone index selection rules. Furthermore, we show a possible way to define new s-monotone pivot rules. We prove that several known algorithms like the primal (dual) simplex, MBU-simplex algorithms and criss-cross algorithm with s-monotone pivot rules are finite methods. We implemented primal simplex and primal MBU-simplex algorithms, in MATLAB, using three s-monotone index selection rules, the minimal-index, the Last-In-First-Out (LIFO) and the Most-Often-Selected-Variable (MOSV) index selection rule. Numerical results demonstrate the viability of the above listed s-monotone index selection rules in the framework of pivot algorithms (c) 2012 Elsevier B.V. All rights reserved.

关键词： linear programming problem Pivot algorithms Anti-cycling pivot rules s-Monotone index selection rules

来源：评论

学校读者我要写书评

暂无评论

Augmented Lagrangian method for large-scale linear programming problems

引用

OPTIMIZATION METHODS & SOFTWARE 2005年第4-5期20卷 515-524页

作者： Evtushenko, YG Golikov, AI Mollaverdy, N Russian Acad Sci Dorodnicyn Comp Ctr Moscow 119991 Russia

The augmented Lagrangian and Newton methods are used to simultaneously solve the primal and dual linear programming problems. The proposed approach is applied to the primal linear programming problem with a very large number (approximate to 10(6)) of nonnegative variables and a moderate (approximate to 10(3)) number of equality-type constraints. Computation results such as the solution of a linear programme with 10 million primal variables are presented.

关键词： linear programming problem augmented Lagrangian Newton method

来源：评论

学校读者我要写书评

暂无评论

A NEURAL-NET APPROACH TO DISCRETE WALSH TRANSFORM

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1994年第11期E77A卷 1882-1886页

作者： KAMIO, T NINOMIYA, H ASAI, H Shizuoka Univ Hamamatsu-shi Japan

In this letter we present an electronic circuit based on a neural net to compute the discrete Walsh transform. We show both analytically and by simulation that the circuit is guaranteed to settle into the correct values.

关键词： NEURAL NETWORK linear programming problem ENERGY FUNCTION DISCRETE WALSH TRANSFORM WALSH FUNCTION HADAMARD MATRIX

来源：评论

学校读者我要写书评

暂无评论

Decentralised stabilisation of positive fractional-order interconnected systems

引用

IET CONTROL THEORY AND APPLICATIONS 2017年第14期11卷 2391-2395页

作者： Le Van Hien Chu Trong Kinh Hanoi Natl Univ Educ Dept Math 136 Xuan Thuy Hanoi Vietnam Hanoi Pedag Univ Dept Math 2 Phuc Yen Vinhphuc Vietnam

This study addresses the stabilisation problem via decentralised controllers for continuous-time positive fractional-order (FO) interconnected systems. By virtue of the positivity, a necessary and sufficient condition is first derived for asymptotic stability of the interconnected closed-loop system. Then, necessary and sufficient conditions for designing a decentralised state-feedback controller are formulated in the form of a linear programming problem which can be effectively solved by using various convex optimisation algorithms. The effectiveness of the obtained theoretical results is demonstrated by a numerical example in positive FO circuits.

关键词： interconnected systems asymptotic stability continuous time systems closed loop systems state feedback linear programming convex programming decentralised control decentralised controllers decentralised stabilisation positive fractional-order interconnected systems continuous-time FO systems asymptotic stability closed-loop system state-feedback controller linear programming problem convex optimisation algorithms

来源：评论

学校读者我要写书评

暂无评论

A dynamic optimal solution approach for solving neutrosophic transportation problem

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2023年第2期44卷 3441-3458页

作者： Robinson, M. Joseph Veeramani, C. Vasanthi, S. Gojansch Business & Technol Dept Math Chennai Tamil Nadu India PSG Coll Technol Dept Appl Sci Math Coimbatore Tamil Nadu India Rajalakshmi Engn Coll Dept Math Chennai Tamil Nadu India

Neutrosophic Set (NS) allows us to handle uncertainty and indeterminacy of the data. Several researchers have investigated the Transportation problems (TP) with various forms of input data. This paper emphasizes a dynamic optimal solution framework for TPs in a neutrosophic setting. This paper investigates a Neutrosophic Transportation problem (NTP) in which supply, demand, and transportation cost are considered as Single-Valued Neutrosophic Trapezoidal Numbers (SVNTrNs). The weighted possibilistic mean value of their truth, indeterminacy, and facility membership function are calculated. Then, NTP is modelled as a parametric linear programming problem (LPP) and solved. Further, the drawbacks of the existing approaches and advantages of the developed method are discussed. Finally, the real-time problem and numerical illustrations are presented and compared to existing solutions. This study helps the Decision-Makers (DMs) in budgeting their transportation expenses through strategic distribution.

关键词： Single valued neutrosophic trapezoidal number transportation problem linear programming problem weighted possibilistic mean

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：