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

Power Systems Computation Conference (PSCC)

作者： Djelassi, Hatim Mitsos, Alexander Fliscounakis, Stephane Panciatici, Patrick Rhein Westfal TH Aachen AVT Proc Syst Engn SVT Aachen Germany Reseau Transport Elect Versailles France

ISBN: (纸本)9781910963104

The aim of the present paper is to provide (n-1)-reliability to a power grid, guaranteeing nominal operation after the failure of any one out of n present grid components. Building on previous work (Fliscounakis et al., IEEE Transactions on Power Systems, 2013), a hierarchical programming problem is proposed to characterize the worst-case behavior of a power grid under a given contingency. The formulation is a mixed integer linear generalized semi-infinite program with a max-min program embedded. The different levels correspond to the choice of preventive actions, realization of uncertainties in the power supply and demand, and the choice of corrective actions. In order to model active components of the grid, models are proposed for load balancing and the behavior of phase-shifting transformers. Since no rigorous solution approaches are published for the problem at hand, the possibility of extending generalized semi infinite programming approaches to the present problem is discussed.

关键词： hierarchical programming mixed-integer linear programming operation under uncertainty security-constrained optimal power flow worst-case analysis

来源：评论

学校读者我要写书评

暂无评论

Combining approximation and exact penalty in hierarchical programming

引用

OPTIMIZATION 2022年第8期71卷 2403-2419页

作者： Bigi, Giancarlo Lampariello, Lorenzo Sagratella, Simone Univ Pisa Dept Comp Sci Pisa Italy Roma Tre Univ Dept Business Studies Rome Italy Sapienza Univ Rome Dept Comp Control & Management Engn Antonio Ruber Rome Italy

We address the minimization of an objective function over the solution set of a (non-parametric) lower-level variational inequality. This problem is a special instance of semi-infinite programs and encompasses, as particular cases, simple (smooth) bilevel and equilibrium selection problems. We resort to a suitable approximated version of the hierarchical problem. We show that this, on the one hand, does not perturb the original (exact) program 'too much', on the other hand, allows one to rely on some suitable exact penalty approaches whose convergence properties are established.

关键词： hierarchical programming optimization problems with variational inequality constraints approximation approaches penalty techniques

来源：评论

学校读者我要写书评

暂无评论

hierarchical and bilevel programming

引用

JOURNAL OF GLOBAL OPTIMIZATION 1996年第3期8卷 209-215页

作者： Migdalas, A Pardalos, PM LINKOPING INST TECHNOL DEPT MATH DIV OPTOMIZAT S-58183 LINKOPING SWEDEN UNIV FLORIDA CTR APPL OPTOMIZAT GAINESVILLE FL 32611 USA UNIV FLORIDA DEPT IND & SYST ENGN GAINESVILLE FL 32611 USA

Approximately twenty years ago the modern interest for hierarchical programming was initiated by J. Bracken and J.M. McGill [9], [10]. The activities in the field have ever grown lively, both in terms of theoretical developments and terms of the diversity of the applications. The collection of seven papers in this issue covers a diverse number of topics and provides a good picture of recent research activities in the field of bilevel and hierarchical programming. The papers can be roughly divided into three categories;Linear bilevel programming is addressed in the first two papers by Gendreau et al and Moshirvaziri et al;The following three papers by Nicholls, Loridan & Morgan, and Kalashnikov & Kalashnikova are concerned with nonlinear bilevel programming;and, finally, Wen & Lin and Nagase & Aiyoshi address hierarchical decision making issues relating to both biobjective and bilevel programming.

关键词： hierarchical programming bilevel programming global optimization multiobjective programming Stackelberg game

来源：评论

学校读者我要写书评

暂无评论

ADDRESSING hierarchical JOINTLY CONVEX GENERALIZED NASH EQUILIBRIUM PROBLEMS WITH NONSMOOTH PAYOFFS

引用

SIAM JOURNAL ON OPTIMIZATION 2025年第1期35卷 445-475页

作者： Lampariello, Lorenzo Sagratella, Simone Sasso, Valerio giuseppe Roma Tre Univ Dept Business Studies Rome Italy Sapienza Univ Rome Dept Comp Control & Management Engn Antonio Rubert Rome Italy

We consider a generalized Nash equilibrium problem whose joint feasible region is implicitly defined as the solution set of another Nash game. This structure arises, e.g., in multiportfolio selection contexts, whenever agents interact at different hierarchical levels. We consider nonsmooth terms in all players' objectives, to promote, for example, sparsity in the solution. Under standard assumptions, we show that the equilibrium problems we deal with have a nonempty solution set and turn out to be jointly convex. To compute variational equilibria, we devise different first-order projection Tikhonov-like methods whose convergence properties are studied. We provide complexity bounds and equip our analysis with numerical tests using real-world financial datasets.

关键词： generalized Nash equilibrium problems hierarchical programming generalized variational inequality numerical methods complexity bounds

来源：评论

学校读者我要写书评

暂无评论

Optimizing flexibility in power systems by maximizing the region of manageable uncertainties

引用

OPTIMIZATION AND ENGINEERING 2025年 1-23页

作者： Zingler, Aron Fliscounakis, Stephane Panciatici, Patrick Mitsos, Alexander JARA CSD D-52056 Aachen Germany Forschungszentrum Julich Inst Climate & Energy Syst Energy Syst Engn ICE 1 D-52425 Julich Germany Rhein Westfal TH Aachen Proc Syst Engn AVTSVT D-52074 Aachen Germany Reseau Transport Electr Paris France

Motivated by the increasing need to hedge against load and generation uncertainty in the operation of power grids, we propose flexibility maximization during operation. We consider flexibility explicitly as the amount of uncertainty that can be handled while still ensuring nominal grid operation in the worst case. We apply the proposed flexibility optimization in the context of a DC flow approximation. By using a corresponding parameterization, we can find the maximal range of uncertainty and a range for the manageable power transfer between two parts of a network subject to uncertainty. We formulate the corresponding optimization problem as an (existence-constrained) semi-infinite optimization problem and specialize an existing algorithm for its solution.

关键词： Flexibility analysis hierarchical programming Operation under uncertainty Optimal power flow

来源：评论

学校读者我要写书评

暂无评论

On linear programs with linear complementarity constraints

引用

JOURNAL OF GLOBAL OPTIMIZATION 2012年第1期53卷 29-51页

作者： Hu, Jing Mitchell, John E. Pang, Jong-Shi Yu, Bin Univ Illinois Dept Ind & Enterprise Syst Engn Urbana IL 61801 USA Market Analyt Inc Evanston IL 60201 USA Rensselaer Polytech Inst Dept Math Sci Troy NY 12180 USA Rensselaer Polytech Inst Dept Decis Sci & Engn Syst Troy NY 12180 USA

The paper is a manifestation of the fundamental importance of the linear program with linear complementarity constraints (LPCC) in disjunctive and hierarchical programming as well as in some novel paradigms of mathematical programming. In addition to providing a unified framework for bilevel and inverse linear optimization, nonconvex piecewise linear programming, indefinite quadratic programs, quantile minimization, and a"" (0) minimization, the LPCC provides a gateway to a mathematical program with equilibrium constraints, which itself is an important class of constrained optimization problems that has broad applications. We describe several approaches for the global resolution of the LPCC, including a logical Benders approach that can be applied to problems that may be infeasible or unbounded.

关键词： Linear programs with linear complementarity constraints Inverse programming hierarchical programming Piecewise linear programming Quantile minimization Cross-validated support vector regression

来源：评论

学校读者我要写书评

暂无评论

Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective vs Bi-Level Modeling Approaches

引用

INTERNATIONAL JOURNAL OF INFORMATION SYSTEMS AND SUPPLY CHAIN MANAGEMENT 2012年第1期5卷 20-37页

作者： Golias, Mihalis M. Saharidis, Georgios K. D. Boile, Maria Theofanis, Sotirios Univ Memphis Dept Civil Engn Memphis TN 38152 USA Kathikas Inst Res & Technol Paphos Cyprus Rutgers State Univ Dept Civil & Environm Engn Transportat Piscataway NJ 08855 USA Rutgers State Univ CAIT Strateg Planning Piscataway NJ 08855 USA

This paper examines the problem of scheduling of inbound trucks to the inbound doors at a cross-docking facility. The authors optimize for two conflicting objectives: minimize the total service time for all the inbound trucks and minimize the delayed completion of service for a subset of the inbound trucks, which are considered as preferential customers. The problem is formulated as a bi-objective and as a bi-level mixed integer problem. Due to the nature of the former and the complexity of the latter formulation, a genetic algorithm and a k-th best based algorithm are proposed as the solution approaches. Computational examples are used to discuss the advantages and drawbacks of each formulation.

关键词： Assignment Problem Bi-Level Optimization Cross-Docking Heuristics hierarchical programming Multiple Objectives programming Supply Chain Management Transportation Warehousing

来源：评论

学校读者我要写书评

暂无评论

Cooperative Problem-Solving's programming for Multi-Intelligent-Nodes

引用

IFAC Proceedings Volumes 1992年第18期25卷 281-286页

作者： Han Wenxiu Liu Shuhua Xu Xiaojun Institute of Systems Engineering Tianjin University Tianjin 300072 PRC

In this paper, cooperative problem-solving in Distributed Artificial Intelligent System is analyzed. A formal model for Multi-Node Cooperative Processing is proposed. programming for multi—intelligent—node cooperative solving of well-structured problem is studied. An hierarchical programming approach of multi—intelligent—node cooperative solving is put forward. A processing model is built up. And finally, cooperative solving process and steps are given.

关键词： Cooperative problem-solving's programming Distributed Artificial Intelligence hierarchical programming Multi-intelligent-node

来源：评论

学校读者我要写书评

暂无评论

A hierarchical Optimization Method to Solve Environmental-Economic Power Generation and Dispatch Problem with Fuzzy Data Uncertainty 2

A Hierarchical Optimization Method to Solve Environmental-Ec...

引用

2nd International Conference on Information Systems Design and Intelligent Applications (INDIA)

作者： Pal, Bijay Baran Kumar, Mousumi Univ Kalyani Dept Math Kalyani 741235 W Bengal India Alipurduar Coll Dept Math Alipurduar 736122 W Bengal India

ISBN: (纸本)9788132222507;9788132222491

This paper presents how the hierarchical decision structure can be effectively used for modeling and solving an environmental-economic thermal power generation and dispatch problems in a fuzzy decision environment. In the proposed approach, minimization of the functions of fuel-cost, environmental-emission and transmission-loss are considered at the three hierarchical levels to solve the problem within a power plant operational system. In the model formulation, a priority based linear fuzzy goal programming (LFGP) method is employed to achieve the highest membership value (unity) of the defined fuzzy goals to the extent possible on the basis of priorities in the decision making horizon. To illustrate the effective use of the approach, the problem of standard IEEE 6-Generator 30-Bus System is considered.

关键词： Fuzzy goal programming Goal programming hierarchical programming Power generation and dispatch Taylor series approximation Trilevel programming

来源：评论

学校读者我要写书评

暂无评论

Specification of Abstract Data Types in Modula

引用

ACM Transactions on programming Languages and Systems (TOPLAS) 1980年第4期2卷 522-543页

作者： Ernst, George W. Ogden, William F. Computer Engineering and Science Department Case Western Reserve University Cleveland OH 44106 United States Department of Computer and Information Sciences Ohio State University Columbus OH 43210 United States

The programming language MODULA is extended to permit the formal specification of the structure and functional capabilities of modules. This makes true hierarchical programming possible in MODULA by allowing programmers of higher level parts of a system to ignore completely the internal structure of lower level modules and to rely entirely on the specifications of the capabilities of these modules. An example is included to illustrate this technique. We show that our specification mechanisms are sufficiently powerful to support formal verification rules for modules that have disjoint representations for abstract objects. © 1980, ACM. All rights reserved.

关键词： abstract data types hierarchical programming MODULA modularization program verification proof rules software specification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：