微电网两阶段鲁棒优化(Matlab代码实现)

news2025/7/11 18:14:26

 💥💥💞💞欢迎来到本博客❤️❤️💥💥

🏆博主优势:🌞🌞🌞博客内容尽量做到思维缜密,逻辑清晰,为了方便读者。

⛳️座右铭:行百里者,半于九十。

目录

💥1 概述

📚2两阶段鲁棒模型及求解方法

2.1 两阶段鲁棒优化模型

2.2求解方法 

🎁 3 目标函数和约束条件

3.1 目标函数

3.2 约束条件

3.3 两阶段鲁棒模型:

🎉4 参考文献

🌈5 Matlab代码实现


💥1 概述

站在巨人的肩膀上:

参考文献:

 

📚2两阶段鲁棒模型及求解方法

2.1 两阶段鲁棒优化模型

2.2求解方法 

🎁 3 目标函数和约束条件

3.1 目标函数

3.2 约束条件

3.3 两阶段鲁棒模型:

高峰电价时段为9:00-11:00和19:00-23:00,电价均为1.35元/kWh,低谷电价时段为24:00-8:00和12:00-18:00,电价分别为0.48元/kWh和0.9元/kWh。

光伏出力:  光伏出力归一值 

风机出力: 风机出力归一值 

CPXPARAM_MIP_Display                             1
Tried aggregator 1 time.
MIP Presolve eliminated 779 rows and 47 columns.
MIP Presolve modified 576 coefficients.
Reduced MIP has 1823 rows, 1110 columns, and 9311 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (5.00 ticks)
Probing fixed 0 vars, tightened 11 bounds.
Probing time = 0.00 sec. (1.69 ticks)
Tried aggregator 1 time.
Reduced MIP has 1823 rows, 1110 columns, and 9311 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (3.87 ticks)
Probing time = 0.00 sec. (1.59 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.558508e+06  Node =       0  Best node =   2.128983e+04
Best integer =   5.306653e+04  Node =       0  Best node =   2.128983e+04
Best integer =   4.746628e+04  Node =       0  Best node =   4.745700e+04
Best integer =   4.746130e+04  Node =       0  Best node =   4.745700e+04
Implied bound cuts applied:  3
Mixed integer rounding cuts applied:  6
Gomory fractional cuts applied:  5
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 3609 rows and 1057 columns.
MIP Presolve modified 3183 coefficients.
Aggregator did 61 substitutions.
Reduced MIP has 3054 rows, 2726 columns, and 21043 nonzeros.
Reduced MIP has 1318 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (30.72 ticks)
Probing fixed 3 vars, tightened 122 bounds.
Probing time = 0.02 sec. (1.13 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 129 rows and 103 columns.
MIP Presolve modified 618 coefficients.
Aggregator did 79 substitutions.
Reduced MIP has 2846 rows, 2544 columns, and 20519 nonzeros.
Reduced MIP has 1201 binaries, 1 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (24.01 ticks)
Probing time = 0.00 sec. (1.04 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -1.749242e+04  Node =       0  Best node =  -2.422582e+04
Best integer =  -1.769821e+04  Node =       0  Best node =  -2.422582e+04
Best integer =  -2.418924e+04  Node =       0  Best node =  -2.422582e+04
Clique cuts applied:  12
Cover cuts applied:  6
Implied bound cuts applied:  52
Mixed integer rounding cuts applied:  151
Gomory fractional cuts applied:  52
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.53 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.64 ticks)
Probing time = 0.00 sec. (0.26 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435047e+06  Node =       0  Best node =   4.559537e+04
Best integer =   1.601358e+05  Node =       0  Best node =   4.559537e+04
Best integer =   6.747812e+04  Node =       0  Best node =   6.747487e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 3639 rows and 1096 columns.
MIP Presolve modified 3189 coefficients.
Aggregator did 60 substitutions.
Reduced MIP has 3025 rows, 2688 columns, and 20940 nonzeros.
Reduced MIP has 1306 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (30.45 ticks)
Probing fixed 2 vars, tightened 129 bounds.
Probing time = 0.00 sec. (1.35 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 145 rows and 116 columns.
MIP Presolve modified 592 coefficients.
Aggregator did 73 substitutions.
Reduced MIP has 2807 rows, 2499 columns, and 20394 nonzeros.
Reduced MIP has 1187 binaries, 1 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (23.83 ticks)
Probing fixed 0 vars, tightened 2 bounds.
Probing time = 0.00 sec. (1.22 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -2.149270e+04  Node =       0  Best node =  -2.676388e+04
Best integer =  -2.181844e+04  Node =       0  Best node =  -2.676289e+04
Clique cuts applied:  16
Cover cuts applied:  23
Implied bound cuts applied:  100
Flow cuts applied:  7
Mixed integer rounding cuts applied:  143
Gomory fractional cuts applied:  60
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.02 sec. (0.50 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.64 ticks)
Probing time = 0.00 sec. (0.22 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.434795e+06  Node =       0  Best node =   4.387395e+04
Best integer =   1.597238e+05  Node =       0  Best node =   4.387395e+04
Best integer =   6.835990e+04  Node =       0  Best node =   6.835665e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 3833 rows and 1275 columns.
MIP Presolve modified 3181 coefficients.
Aggregator did 67 substitutions.
Reduced MIP has 2824 rows, 2502 columns, and 20363 nonzeros.
Reduced MIP has 1221 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (30.34 ticks)
Probing fixed 0 vars, tightened 97 bounds.
Probing time = 0.00 sec. (1.31 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 137 rows and 108 columns.
MIP Presolve modified 552 coefficients.
Aggregator did 61 substitutions.
Reduced MIP has 2626 rows, 2333 columns, and 19897 nonzeros.
Reduced MIP has 1122 binaries, 3 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (19.99 ticks)
Probing time = 0.00 sec. (1.14 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -2.439674e+04  Node =       0  Best node =  -2.890634e+04
Best integer =  -2.886494e+04  Node =     524  Best node =  -2.890295e+04
Clique cuts applied:  16
Cover cuts applied:  16
Implied bound cuts applied:  31
Flow cuts applied:  7
Mixed integer rounding cuts applied:  100
Gomory fractional cuts applied:  56
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.02 sec. (0.49 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.64 ticks)
Probing time = 0.00 sec. (0.22 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435291e+06  Node =       0  Best node =   4.228469e+04
Best integer =   1.616469e+05  Node =       0  Best node =   4.228469e+04
Best integer =   6.925787e+04  Node =       0  Best node =   6.925463e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 3924 rows and 1372 columns.
MIP Presolve modified 3186 coefficients.
Aggregator did 72 substitutions.
Reduced MIP has 2728 rows, 2400 columns, and 20066 nonzeros.
Reduced MIP has 1180 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (30.04 ticks)
Probing fixed 0 vars, tightened 82 bounds.
Probing time = 0.00 sec. (1.30 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 150 rows and 120 columns.
MIP Presolve modified 451 coefficients.
Reduced MIP has 2578 rows, 2280 columns, and 19692 nonzeros.
Reduced MIP has 1130 binaries, 6 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (8.66 ticks)
Probing time = 0.00 sec. (1.16 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.044507e+04  Node =       0  Best node =  -3.202296e+04
Best integer =  -3.044582e+04  Node =       0  Best node =  -3.093878e+04
Best integer =  -3.044609e+04  Node =       0  Best node =  -3.089980e+04
Best integer =  -3.050281e+04  Node =       0  Best node =  -3.089980e+04
Clique cuts applied:  12
Cover cuts applied:  44
Implied bound cuts applied:  19
Flow cuts applied:  7
Mixed integer rounding cuts applied:  53
Gomory fractional cuts applied:  28
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.48 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (3.64 ticks)
Probing time = 0.00 sec. (0.21 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435399e+06  Node =       0  Best node =   4.081637e+04
Best integer =   1.629365e+05  Node =       0  Best node =   4.081637e+04
Best integer =   6.995436e+04  Node =       0  Best node =   6.995241e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 3888 rows and 1329 columns.
MIP Presolve modified 3183 coefficients.
Aggregator did 72 substitutions.
Reduced MIP has 2764 rows, 2443 columns, and 20191 nonzeros.
Reduced MIP has 1195 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (30.24 ticks)
Probing fixed 1 vars, tightened 95 bounds.
Probing time = 0.02 sec. (1.36 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 143 rows and 113 columns.
MIP Presolve modified 522 coefficients.
Aggregator did 51 substitutions.
Reduced MIP has 2570 rows, 2279 columns, and 19730 nonzeros.
Reduced MIP has 1102 binaries, 6 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.03 sec. (19.77 ticks)
Probing time = 0.00 sec. (1.23 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.229320e+04  Node =       0  Best node =  -3.386904e+04
Best integer =  -3.229448e+04  Node =       0  Best node =  -3.274230e+04
Best integer =  -3.231160e+04  Node =      36  Best node =  -3.273753e+04
Best integer =  -3.267385e+04  Node =     527  Best node =  -3.273693e+04
Clique cuts applied:  10
Cover cuts applied:  31
Implied bound cuts applied:  27
Flow cuts applied:  2
Mixed integer rounding cuts applied:  50
Gomory fractional cuts applied:  31
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.46 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.64 ticks)
Probing time = 0.02 sec. (0.19 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435498e+06  Node =       0  Best node =   3.945881e+04
Best integer =   1.641265e+05  Node =       0  Best node =   3.945881e+04
Best integer =   7.050950e+04  Node =       0  Best node =   7.050625e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 3969 rows and 1400 columns.
MIP Presolve modified 3173 coefficients.
Aggregator did 73 substitutions.
Reduced MIP has 2682 rows, 2371 columns, and 19965 nonzeros.
Reduced MIP has 1161 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (30.19 ticks)
Probing fixed 1 vars, tightened 86 bounds.
Probing time = 0.02 sec. (1.35 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 143 rows and 113 columns.
MIP Presolve modified 482 coefficients.
Aggregator did 41 substitutions.
Reduced MIP has 2498 rows, 2217 columns, and 19535 nonzeros.
Reduced MIP has 1078 binaries, 10 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (19.45 ticks)
Probing time = 0.02 sec. (1.27 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.433272e+04  Node =       0  Best node =  -3.434461e+04
Clique cuts applied:  23
Cover cuts applied:  19
Implied bound cuts applied:  64
Flow cuts applied:  19
Mixed integer rounding cuts applied:  91
Gomory fractional cuts applied:  51
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.46 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.64 ticks)
Probing time = 0.00 sec. (0.19 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435587e+06  Node =       0  Best node =   3.820272e+04
Best integer =   1.652181e+05  Node =       0  Best node =   3.820272e+04
Best integer =   7.091213e+04  Node =       0  Best node =   7.090888e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 4084 rows and 1509 columns.
MIP Presolve modified 3167 coefficients.
Aggregator did 80 substitutions.
Reduced MIP has 2560 rows, 2255 columns, and 19615 nonzeros.
Reduced MIP has 1109 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (30.05 ticks)
Probing fixed 1 vars, tightened 69 bounds.
Probing time = 0.00 sec. (1.38 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 149 rows and 117 columns.
MIP Presolve modified 435 coefficients.
Aggregator did 31 substitutions.
Reduced MIP has 2380 rows, 2107 columns, and 19204 nonzeros.
Reduced MIP has 1037 binaries, 14 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (21.84 ticks)
Probing time = 0.02 sec. (1.32 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.531202e+04  Node =       0  Best node =  -3.670811e+04
Clique cuts applied:  15
Cover cuts applied:  47
Implied bound cuts applied:  57
Flow cuts applied:  14
Mixed integer rounding cuts applied:  102
Gomory fractional cuts applied:  72
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.45 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.65 ticks)
Probing time = 0.00 sec. (0.18 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435666e+06  Node =       0  Best node =   3.703968e+04
Best integer =   7.123725e+04  Node =       0  Best node =   3.703968e+04
Best integer =   7.117944e+04  Node =       0  Best node =   7.117749e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 4124 rows and 1544 columns.
MIP Presolve modified 3156 coefficients.
Aggregator did 78 substitutions.
Reduced MIP has 2522 rows, 2222 columns, and 19509 nonzeros.
Reduced MIP has 1094 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (30.03 ticks)
Probing fixed 2 vars, tightened 69 bounds.
Probing time = 0.02 sec. (1.55 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 158 rows and 124 columns.
MIP Presolve modified 429 coefficients.
Aggregator did 31 substitutions.
Reduced MIP has 2333 rows, 2067 columns, and 19089 nonzeros.
Reduced MIP has 1023 binaries, 17 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (21.70 ticks)
Probing time = 0.00 sec. (1.32 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.655283e+04  Node =       0  Best node =  -3.786446e+04
Best integer =  -3.692724e+04  Node =       0  Best node =  -3.693466e+04
Clique cuts applied:  16
Cover cuts applied:  10
Implied bound cuts applied:  50
Flow cuts applied:  13
Mixed integer rounding cuts applied:  96
Zero-half cuts applied:  1
Lift and project cuts applied:  1
Gomory fractional cuts applied:  36
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.45 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.65 ticks)
Probing time = 0.00 sec. (0.18 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435737e+06  Node =       0  Best node =   3.596200e+04
Best integer =   7.145608e+04  Node =       0  Best node =   3.596200e+04
Best integer =   7.139956e+04  Node =       0  Best node =   7.139632e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 4159 rows and 1563 columns.
MIP Presolve modified 3122 coefficients.
Aggregator did 61 substitutions.
Reduced MIP has 2504 rows, 2220 columns, and 19481 nonzeros.
Reduced MIP has 1091 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (30.08 ticks)
Probing fixed 1 vars, tightened 66 bounds.
Probing time = 0.00 sec. (1.43 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 143 rows and 113 columns.
MIP Presolve modified 416 coefficients.
Aggregator did 28 substitutions.
Reduced MIP has 2333 rows, 2079 columns, and 19119 nonzeros.
Reduced MIP has 1028 binaries, 21 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.03 sec. (18.87 ticks)
Probing time = 0.00 sec. (1.35 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.761882e+04  Node =       0  Best node =  -3.873746e+04
Clique cuts applied:  14
Cover cuts applied:  24
Implied bound cuts applied:  39
Flow cuts applied:  7
Mixed integer rounding cuts applied:  69
Gomory fractional cuts applied:  49
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.45 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (3.66 ticks)
Probing time = 0.00 sec. (0.18 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.435804e+06  Node =       0  Best node =   3.496271e+04
Best integer =   7.166073e+04  Node =       0  Best node =   3.496271e+04
Best integer =   7.160422e+04  Node =       0  Best node =   7.160097e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 4184 rows and 1592 columns.
MIP Presolve modified 3120 coefficients.
Aggregator did 59 substitutions.
Reduced MIP has 2481 rows, 2193 columns, and 19405 nonzeros.
Reduced MIP has 1082 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (29.99 ticks)
Probing fixed 0 vars, tightened 54 bounds.
Probing time = 0.02 sec. (1.41 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 140 rows and 113 columns.
MIP Presolve modified 378 coefficients.
Aggregator did 14 substitutions.
Reduced MIP has 2327 rows, 2066 columns, and 19068 nonzeros.
Reduced MIP has 1023 binaries, 23 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (18.77 ticks)
Probing time = 0.00 sec. (1.25 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.841269e+04  Node =       0  Best node =  -3.942486e+04
Best integer =  -3.869170e+04  Node =       0  Best node =  -3.868681e+04
Clique cuts applied:  13
Cover cuts applied:  3
Implied bound cuts applied:  23
Flow cuts applied:  6
Mixed integer rounding cuts applied:  94
Gomory fractional cuts applied:  31
CPXPARAM_MIP_Display                             1
Tried aggregator 2 times.
MIP Presolve eliminated 829 rows and 2 columns.
MIP Presolve modified 1008 coefficients.
Aggregator did 144 substitutions.
Reduced MIP has 1053 rows, 723 columns, and 7241 nonzeros.
Reduced MIP has 192 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (7.29 ticks)
Probing fixed 0 vars, tightened 24 bounds.
Probing time = 0.00 sec. (0.45 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 144 rows and 72 columns.
Reduced MIP has 909 rows, 651 columns, and 6953 nonzeros.
Reduced MIP has 120 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (3.67 ticks)
Probing time = 0.00 sec. (0.18 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =   1.436049e+06  Node =       0  Best node =   3.422789e+04
Best integer =   7.175970e+04  Node =       0  Best node =   3.422789e+04
Best integer =   7.170318e+04  Node =       0  Best node =   7.169994e+04
CPXPARAM_MIP_Display                             1
Tried aggregator 3 times.
MIP Presolve eliminated 4181 rows and 1592 columns.
MIP Presolve modified 3115 coefficients.
Aggregator did 55 substitutions.
Reduced MIP has 2488 rows, 2197 columns, and 19425 nonzeros.
Reduced MIP has 1086 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.03 sec. (29.92 ticks)
Probing fixed 1 vars, tightened 57 bounds.
Probing time = 0.00 sec. (1.40 ticks)
Tried aggregator 3 times.
MIP Presolve eliminated 138 rows and 112 columns.
MIP Presolve modified 381 coefficients.
Aggregator did 14 substitutions.
Reduced MIP has 2336 rows, 2071 columns, and 19091 nonzeros.
Reduced MIP has 1027 binaries, 26 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (18.81 ticks)
Probing time = 0.00 sec. (1.43 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 16 threads.

Node log . . .
Best integer =  -3.896327e+04  Node =       0  Best node =  -3.993966e+04
Best integer =  -3.897429e+04  Node =       0  Best node =  -3.923728e+04
Best integer =  -3.914657e+04  Node =      17  Best node =  -3.923781e+04
Clique cuts applied:  10
Cover cuts applied:  19
Implied bound cuts applied:  30
Flow cuts applied:  11
Mixed integer rounding cuts applied:  60
Gomory fractional cuts applied:  43
时间已过 39.528332 秒。
>> 

🎉4 参考文献

[1]晏鸣宇,艾小猛,张艺镨,舒康安,甘伟,文劲宇.考虑机组禁止运行区间的含风电鲁棒机组组合[J].中国电机工程学报,2018,38(11):3195-3203.DOI:10.13334/j.0258-8013.pcsee.171138.

🌈5 Matlab代码实现

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.coloradmin.cn/o/19703.html

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈,一经查实,立即删除!

相关文章

LeetCode刷题复盘笔记—一文搞懂62. 不同路径 63. 不同路径 II(动态规划系列第三篇)

今日主要总结一下动态规划的两道题目,62. 不同路径 && 63. 不同路径 II 题目一:62. 不同路径 题目描述: 一个机器人位于一个 m x n 网格的左上角 (起始点在下图中标记为 “Start” )。 机器人每次只能向下或…

HTML CSS 网页设计作业「体育小站」(梅西足球 6页 )

⛵ 源码获取 文末联系 ✈ Web前端开发技术 描述 网页设计题材,DIVCSS 布局制作,HTMLCSS网页设计期末课程大作业 | 校园篮球网页设计 | 足球体育运动 | 体育游泳运动 | 兵乓球 | 网球 | 等网站的设计与制作| HTML期末大学生网页设计作业,Web大学生网页 HT…

JavaScript之PC端网页特效(55th)

在前面学习了JS基础、DOM 和 BOM 的基本操作后,这部分主要学习这些知识的拓展应用 1、元素偏移量 offset 系列 1、offset 概述 offset 翻译过来就是偏移量,我们使用 offset 系列相关属性可以动态的得到该元素的位置(偏移)、大小…

SpringBoot SpringBoot 开发实用篇 4 数据层解决方案 4.7 SpringBoot 操作 Redis 客户端实现技术切换【jedis】

SpringBoot 【黑马程序员SpringBoot2全套视频教程,springboot零基础到项目实战(spring boot2完整版)】 SpringBoot 开发实用篇 文章目录SpringBootSpringBoot 开发实用篇4 数据层解决方案4.7 SpringBoot 操作 Redis 客户端实现技术切换【je…

数据结构实验教程-第二套

5.一棵左子树为空的二叉树在先序线索化后,其中空的链域的个数是 a.不确定 b.0 c.1 d.2在先序线索化之后,相当于只有开始节点没有前驱,最后的节点没有后继,因此空链域只有2个,分别是开始节点的左孩子和最后节…

【笔试题】【day23】

文章目录第一题(二叉树度结点的计算)第二题(平衡查找二叉树)第三题(堆的插入)第四题(哈希表的查找)第五题(大数排序)第一题(二叉树度结点的计算&a…

功能测试

功能测试 按照是否覆盖源代码 黑盒测试(输入和输出) 白盒测试(代码内部实现逻辑) 灰盒测试(输入输出和代码逻辑) 介于白盒测试和黑盒测试之间的测试,多用于集成阶段,不仅关注输入输…

智能制造与数字化工厂

智能制造是基于新一代信息技术,贯穿设计、生产、管理、服务等制造活动各个环节,具有信息深度自感知、智慧优化自决策、精准控制自执行等功能的先进制造过程、系统与模式的总称。具有以智能工厂为载体,以关键制造环节智能化为核心,…

通信用多模光纤主要有哪些类型?OM1~OM5有什么区别

1 前言 根据光纤内光信号传输模式的不同,光纤可分为单模光纤和多模光纤,见《常用通信光纤是如何分类的》一文。 在传送网和有线接入网中,我们接触到的光纤类型主要有:G.652、G.654和G.657,这些都是单模光纤。多模光纤…

Linux 系统启动过程

linux启动时我们会看到许多启动信息。 Linux系统的启动过程并不是大家想象中的那么复杂,其过程可以分为5个阶段: 内核的引导。运行 init。系统初始化。建立终端 。用户登录系统。init程序的类型: SysV: init, CentOS 5之前, 配置文件&#…

通关算法题之 ⌈二叉树⌋ 上

二叉树深度 104、求二叉树最大深度 二叉树的深度为根节点到最远叶子节点的最长路径上的节点数,叶子节点是指没有子节点的节点。 示例: 给定二叉树[3,9,20,null,null,15,7], 3/ \9 20/ \15 7返回它的最大深度 3。 解法一:递…

Linux进阶-Shell编程

目录 定义变量: 使用变量: 将命令的结果赋值给变量: 删除变量:unset 退出当前进程:exit 读取从键盘输入的数据 :read 对整数进行数字运算:(()) 逻辑与或: 检测某个条件是否成…

Qt QSqlQueryModel详解

1.功能概述 QSqlQueryModel是QSqlTableModel的父类。QSqlQueryModel封装了执行SELECT语句从数据库查询数据的功能,但是QSqlQueryModel只能作为只读数据源使用,不可以编辑数据。 2.常用API void clear() //清除数据模型,释放所有获得的数据…

投资有风险,入市需谨慎

投资有风险,入市需谨慎投资有风险,入市需谨慎股票的分类股票的分时图股票K线图股票交易规则股票趋势股票买卖机制投资有风险,入市需谨慎 感谢平台和大家支持,今天不聊技术,了解了解其他方面,比如股市&…

编程思维是一种什么思维?

hello wordl!    keep coding!🏃 学编程不是将来要当程序猿,而是在学习编程思维。比尔盖茨、扎克伯格、乔布斯用经验告诉我们,拥有编程思维的人,就相当于成功了一半——不但逻辑清晰心思缜密,…

vue + el-checkbox 单选功能

需求: 用 el-checkboc 实现单选功能并且当选中某一项时则回填到input框里,当点击 enter 键或者是 按下搜索图标按键,来实现页面搜索内容的同步展示;如图: <el-checkbox-group placeholder"请选择"size"small"v-model"checkedCols"clearablefi…

Android BLE HIDS Data ,从问询DB 到写入Android 节点的flow之二

问题点4&#xff1a;Android BLE具体连接flow 并问询DB的API flow 之第一阶段问询&#xff1b; 当前确认原生BT当作为GATT Client 连接上GATT Server时&#xff0c;在连接上后会有自动启动问询的动作(以下Tracing 基于Android 9(P), 测试 8.1的代码和Android 8.0有差异&#x…

Web大学生网页作业成品——抗击疫情网站设计与实现(HTML+CSS)实训素材

⛵ 源码获取 文末联系 ✈ Web前端开发技术 描述 网页设计题材&#xff0c;DIVCSS 布局制作,HTMLCSS网页设计期末课程大作业 | 击疫情致敬逆行者感人类题材 | 致敬逆行者网页设计作品 | 大学生抗疫感动专题网页设计作业模板 | 等网站的设计与制作 | HTML期末大学生网页设计作业 …

第3阶段-运维线上实战-3.2企业级nginx使用

企业级nginx使用 nginx实现平滑升级 [rootlnmp nginx-1.16.0]# cd /usr/local/nginx/sbin/ [rootlnmp sbin]# ls nginx nginx.old [rootlnmp sbin]# ./nginx -v nginx version: nginx/1.16.0 [rootlnmp sbin]# ./nginx.old -v nginx version: nginx/1.14.2 [rootlnmp sbin]#操…

【Spring】Spring的AspectJ的AOP

Spring学习笔记(10)Spring的AspectJ的AOP 在Spring中使用AspectJ实现AOP AspectJ 是一个面向切面的框架&#xff0c; 它扩展了 Java 语言。 AspectJ 定义了 AOP 语法所以它有一个专门的编译器用来生成遵守 Java 字节编码规范的 Class 文件。AspectJ 是一个基于 Java 语言的 A…