搜索资源列表
考虑网络安全约束的机组组合新算法
- 市场机制驱使电网运行于安全极限的边缘, 考虑网络 安全约束的机组组合问题变得尤为重要, 基于对偶原理的拉 格朗日松弛法是解决这一问题的有效途径。文章提出了一种 解决网络安全约束下的机组组合问题的新算法, 在拉格朗日 对偶分解的基础上结合变量复制技术, 通过引入附加人工约 束将网络约束嵌入单机子问题中, 实现在机组组合中考虑网 络安全约束口该算法摆脱了现有各种处理手段在解决网络安 全约束的机组组合问题时将网络安全约束与机组启停相分 离的不足, 揭示了安全经济调度和安全约束下的机组组
lagrange
- 拉格朗日松弛法的机组组合程序，采用三节点算例-Lagrangian relaxation unit commitment program, the use of three-node example
optimization
- 最优化算法的总结，包括了主要的搜索算法，NP问题，遗传算法，神经网络，拉格朗日松弛，对计算机优化计算提供理论基础。-Summary of optimization algorithms, including the main search algorithm, NP problems, genetic algorithms, neural networks, Lagrangian relaxation, to provide a theoretical basis for computer op
algorithm
- 超松弛迭代法、最小二乘法、拉格朗日插值法、牛顿插值法、牛顿迭代法、雅克比迭代-Over relaxation method, least squares, Lagrange interpolation, Newton interpolation, Newton' s iterative method, Jacobi iteration
20lagrangian_relaxation_1_2.pdf
- 拉格朗日松弛方法 基于分解的方法. 开始于 简单约束 复杂约束 把复杂的约束放入目标. 我们将得到关于最小化问题的最优解的下界. 在许多情况中,这种边界接近最优解的值. -The Lagrangian relaxation method is based on the decomposition method begins with the simple constraints of complex constraints into complex constra
gaodengshuxue
- 可实现的算法：软件说明： 1.全主元高斯约当消去法2.LU分解法3.追赶法4.五对角线性方程组解法5.线性方程组解的迭代改善6.范德蒙方程组解法7.托伯利兹方程组解法8.奇异值分解9.线性方程组的共轭梯度法10.对称方程组的乔列斯基分解法11.矩阵的QR分解12.松弛迭代法第2章插值1.拉格朗日插值2.有理函数插值3.三次样条插值4.有序表的检索法5.插值多项式6.二元拉格朗日插值-The algorithm can be realized: Software Descr iption:
shuffle
- 利用拉格朗日松弛法求解机组组合问题，考虑领域搜索的随机性-Using Lagrangian relaxation method to solve the unit combination problem, considering the randomness of the search field
A-New-Unit-Commitment-Algorithm
- 考虑网络 安全约束的机组组合问题变得尤为重要,基于对偶原理的拉 格朗日松弛法是解决这一问题的有效途径。 - Considering the network Security constraints of unit combination problem is particularly important, based on the duality principle Grant, relaxation method is an effective way to solve
facility-location-problem
- 解决闭环供应链环境下基于拉格朗日松弛算法的逆向物流设施选址问题-Closed-loop supply chain environment to solve problems based on Lagrangian relaxation algorithm siting of reverse logistics facilities
adjustPower
- 拉格朗日松弛法的分支 调节机组组合的功率平衡-This function is used to adjust the power balance constraints
Lagrangian-relaxation
- 拉格朗日松弛,将目标函数中造成问题难的约束吸收到目标函数中，并保持目标函数的线性，使问题更加容易求解。-Lagrangian relaxation
UnitCommitment-Lagrange
- 使用拉格朗日松弛最小化方法处理简单的机组组合问题（UC）算例程序，源自电力系统运行与控制一书-Lagrangian relaxation minimization method is used to deal with simple unit combination problem (UC) example program, starts the power system operation and control
subgradient optimization
- 在最优化问题中，运用拉格朗日松弛时为了解决其对偶问题，可以使用次梯度方法进行求解拉格朗日乘子。(Lagrangean relaxation, a technique of quite general applicability, is studied in the particular context of the optimization problem with arbitrary additional constraints. To solve the Lagrangian dual, w
拉格朗日松弛法的机组组合
- 用拉格朗日松弛法编写的matlab电力系统机组组合程序(Matlab power system unit commitment program written by Lagrange relaxation method)