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

MULTIPERIOD SECURE ECONOMIC-DISPATCH FOR LARGE-SCALE POWER-SYSTEMS

IEE PROCEEDINGS-C GENERATION TRANSMISSION AND DISTRIBUTION 1989年第3期136卷 130-136页

作者： HINDI, KS GHANI, MRA Decision Technologies Group Department of Computation UMIST Manchester UK

Dynamic multi-period economic dispatch for large-scale power systems is considered; the formulation presented provides for loading and deloading rates, limits on generator outputs, spinning-reserve requirements and group power import-export limits. It is also suitable for implementation within a constraint relaxation strategy. The solution algorithm is based on a Dantzig-Wolfe decomposition, which yields a capacitated transshipment subproblem along with a master problem solved by the revised simplex method. The computational efficiency of the algorithm renders it suitable for on-line dispatch.

关键词： online dispatch spinning-reserve requirements power systems loading rates constraint relaxation strategy large-scale power systems economics Dantzig-Wolfe decomposition Power system management, operation and economics group power import-export limits computational efficiency deloading rates generator output limits solution algorithm secure economic dispatch load dispatching capacitated transshipment subproblem dynamic multiperiod dispatch revised simplex method

来源：评论

学校读者我要写书评

暂无评论

Enhanced-interval linear programming

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第2期199卷 323-333页

作者： Zhou, Feng Huang, Gordon H. Chen, Guo-Xian Guo, Huai-Cheng Peking Univ Coll Environm Sci & Engn Beijing 100871 Peoples R China Univ Regina Fac Engn Environm Syst Engn Program Regina SK S4S 0A2 Canada Peking Univ LMAM Beijing 100871 Peoples R China Peking Univ CCSE Sch Math Sci Beijing 100871 Peoples R China

An enhanced-interval linear programming (EILP) model and its solution algorithm have been developed that incorporate enhanced-interval uncertainty (e.g., A(+/-), B-+/- and C-+/-) in a linear optimization framework. As a new extension of linear programming, the EILP model has the following advantages. Its solution space is absolutely feasible compared to that of interval linear programming (ILP), which helps to achieve insight into the expected-value-oriented trade-off between system benefits and risks of constraint violations. The degree of uncertainty of its enhanced-interval objective function (EIOF) would be lower than that of ILP model when the solution space is absolutely feasible, and the EIOF's expected value could be used as a criterion for generating the appropriate alternatives, which help decision-makers obtain non-extreme decisions. Moreover, because it can be decomposed into two submodels. EILP's computational requirement is lower than that of stochastic and fuzzy LP models. The results of a numeric example further indicated the feasibility and effectiveness of EILP model. In addition, El nonlinear programming models, hybrid stochastic or fuzzy EILP models as well as risk-based trade-off analysis for El uncertainty within decision process can be further developed to improve its applicability. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Linear programming Optimization Uncertainty Feasibility solution algorithm Risk-based decision making

来源：评论

学校读者我要写书评

暂无评论

Fuzzy analysis of queueing systems with an unreliable server: A nonlinear programming approach

引用

APPLIED MATHEMATICS AND COMPUTATION 2006年第1期175卷 330-346页

作者： Ke, Jau-Chuan Lin, Chuen-Horng Natl Taichung Inst Technol Dept Stat Taichung 404 Taiwan Natl Taichung Inst Technol Dept Informat Management Taichung 404 Taiwan

This work constructs the membership functions of the system characteristics of a queuing model with an unreliable server, in which the arrival rate and the service rate of customers, as well as the breakdown rate and repair rate of server are all fuzzy numbers. The alpha-cut approach is used to transform a fuzzy queue with an unreliable server into a family of conventional crisp queues with an unreliable server. By means of the membership functions of the system characteristics, a set of parametric nonlinear programs is developed to describe the family of crisp queues with an unreliable server. An efficient algorithm is provided to find the optimal solutions at a different possibility level a. Three numerical examples are solved successfully to illustrate the validity of the proposed approach. Due to the system characteristics being expressed and governed by the membership functions, more information is provided for use by management. By extending the fuzzy environment, the fuzzy queues with an unreliable server can be represented more accurately by using the proposed approach, and the analysis results for such queuing model will be useful and significant for system designers and practitioners. (c) 2005 Elsevier Inc. All rights reserved.

关键词： fuzzy sets nonlinear programming queue solution algorithm unreliable server

来源：评论

学校读者我要写书评

暂无评论

Mathematical modeling of pressure on the strengthening vertical shaft support in "Mir" mine located in the Charsk saliferous rock series

引用

JOURNAL OF MINING SCIENCE 2006年第2期42卷 113-121页

作者： Konstantinova, S. A. Chernopazov, S. A. Ural Sci Res & Design Inst Halurgy Perm Russia

The problem statement and the solution algorithm are presented for the case of contact between strengthening vertical shaft support and rocks. Hereditary viscoelasticity equations are used as constitutive relations for saliferous rocks. An analysis of the dynamics of the growing pressure on the support is performed versus the shaft cross-section occurrence depth, saliferous rock strength on the contact, and spacing between the rock contour and the support in the shaft.

关键词： model of contact stress-strain state hereditary viscoelasticity solution algorithm pressure on support

来源：评论

学校读者我要写书评

暂无评论

Solving discrete linear bilevel optimization problems using the optimal value reformulation

引用

JOURNAL OF GLOBAL OPTIMIZATION 2017年第2期68卷 255-277页

作者： Dempe, S. Kue, F. Mefo TU Bergakad Freiberg Dept Math & Comp Sci Freiberg Germany

In this article, we consider two classes of discrete bilevel optimization problems which have the peculiarity that the lower level variables do not affect the upper level constraints. In the first case, the objective functions are linear and the variables are discrete at both levels, and in the second case only the lower level variables are discrete and the objective function of the lower level is linear while the one of the upper level can be nonlinear. algorithms for computing global optimal solutions using Branch and Cut and approximation of the optimal value function of the lower level are suggested. Their convergence is shown and we illustrate each algorithm via an example.

关键词： Bilevel programming solution algorithm Discrete parametric optimization Global optimization

来源：评论

学校读者我要写书评

暂无评论

Mathematical modeling of the stress-strain state in rock and artificial masses during slice chamber mining of underpit reserves in the "Internatsionalnaya" kimberlite pipe

引用

JOURNAL OF MINING SCIENCE 2005年第3期41卷 215-224页

作者： Konstantinova, SA Chernopazov, SA Ural Sci Res Perm Russia Planning Inst Halurgy Perm Russia

The statement and solution algorithm are proposed for the problem on the stress-strain state of a kimberlite body, filling massif, and enclosing rock during slice chamber mining with filling. The equations of nonlinea... 详细信息

关键词： stress-strain state filling model hereditary viscoelasticity solution algorithm

来源：评论

学校读者我要写书评

暂无评论

A customer selection and vehicle scheduling model for moving companies

引用

TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH 2020年第9期12卷 613-622页

作者： Yan, Shangyao Chu, James C. Hung, Wei-Che Natl Cent Univ Dept Civil Engn Taoyuan Taiwan Natl Taiwan Univ Dept Civil Engn 1 Roosevelt Rd Taipei 106 Taiwan

This study develops a model for customer selection and vehicle scheduling with time windows for moving companies. To reflect the actual operations of moving companies, the proposed model employs two major processes to extend the traditional vehicle routing models. First, loading and unloading activities of moving vehicles are explicitly modeled using the technique of time-space networks. Second, moving companies are flexible in selecting customers, thereby possibly maximizing the profit of companies. The model is formulated as an integer multi-commodity network with side constraints. A decomposition-based solution algorithm is developed to solve the problem efficiently. Results of a case study indicate that the proposed methodology efficiently generates reasonable plans of customer selection and vehicle scheduling. Sensitivity analysis shows that the proposed model properly responds to the change in critical parameters. Therefore, the proposed methodology has a strong potential to improve the operations and profitability of moving companies.

关键词： Moving company time-space network multi-commodity network flow model solution algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem

引用

IEEE ACCESS 2018年 6卷 44445-44458页

作者： Song, Zhiming Dai, Guangming Wang, Maocai Chen, Xiaoyu China Univ Geosci Sch Comp Wuhan 430074 Hubei Peoples R China China Univ Geosci Hubei Key Lab Intelligent Geoinformat Proc Wuhan 430074 Hubei Peoples R China

The constellation-to-ground coverage problem is a basic and important problem in satellite applications. The grid-point approach (GPA) is one of the most commonly used approaches to solving this problem. However, this approach also has some serious drawbacks. A group of strategies that can improve or overcome the drawbacks of this approach are proposed. The spatial and temporal characteristics of the GPA were analyzed, and a strategy that can compute the upper and lower bounds of the result was given. This strategy can not only acquire the result but can also yield the error range of the result. In addition, a strategy that uses low-precision results to compute a high-precision result is proposed. Simulation experiments of different types of coverage problems were conducted, and the results show that these strategies are effective.

关键词： Satellite Constellation Coverage Problem Grid Point Approach solution algorithm

来源：评论

学校读者我要写书评

暂无评论

Minimax problems of discrete optimization invariant under majority operators

引用

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2014年第8期54卷 1327-1336页

作者： Vodolazskii, E. V. Flach, B. Schlesinger, M. I. Int Sci Educ Ctr UA-03680 Kiev Ukraine Czech Tech Univ Prague 16636 Czech Republic

A special class of discrete optimization problems that are stated as a minimax modification of the constraint satisfaction problem is studied. The minimax formulation of the problem generalizes the classical problem to realistic situations where the constraints order the elements of the set by the degree of their feasibility, rather than defining a dichotomy between feasible and infeasible subsets. The invariance of this ordering under an operator is defined, and the discrete minimization of functions invariant under majority operators is proved to have polynomial complexity. A particular algorithm for this minimization is described.

关键词： discrete optimization problem minimax modification solution algorithm

来源：评论

学校读者我要写书评

暂无评论

Generalized Nash Equilibrium Problems

引用

ANNALS OF OPERATIONS RESEARCH 2010年第1期175卷 177-211页

作者： Facchinei, Francisco Kanzow, Christian Univ Roma La Sapienza Dept Comp & Syst Sci A Ruberti Via Ariosto 25 I-00185 Rome Italy Univ Wurzburg Inst Math D-97074 Wurzburg Germany

The Generalized Nash Equilibrium Problem is an important model that has its roots in the economic sciences but is being fruitfully used in many different fields. In this survey paper we aim at discussing its main prop... 详细信息

关键词： Nash Equilibrium Problem Pseudo game Social equilibrium Coupled constraints Existence Stability solution algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：