-
Notifications
You must be signed in to change notification settings - Fork 10
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[ANT-1224] Preparing loop around benders solver (#739)
steps: - [x] create a storage struct for cuts data - [x] interface and its implementation(s) to save cuts data - [x] re-use cuts - [x] external loop criterion check - [x] add external loop constraint - [x] add "mathematical" logs for external loop (think about data to print) - [x] improve operational logs with external loop - [x] Computation of initial lambda_max by solving investment free problem + check criterion -> raise warning / exception if not satisfied at this point - [ ] Handle infeasibility / errors / ... - [x] Write test #706
- Loading branch information
Showing
66 changed files
with
1,991 additions
and
323 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,4 @@ | ||
# Ignore everything in this directory | ||
* | ||
# Except this file | ||
!.gitignore |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
* Generated by MPModelProtoExporter | ||
* Name : | ||
* Format : Free | ||
* Constraints : 0 | ||
* Variables : 1 | ||
* Binary : 0 | ||
* Integer : 0 | ||
* Continuous : 1 | ||
NAME | ||
ROWS | ||
N COST | ||
COLUMNS | ||
G_p_max_0_0 COST 20 | ||
RHS | ||
BOUNDS | ||
UP BOUND G_p_max_0_0 10 | ||
ENDATA |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
NAME | ||
LL G_p_max_0_0 0 | ||
XU alpha R1 19 0 | ||
XL alpha_0 R2 19 -19 | ||
ENDATA |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,29 @@ | ||
{ | ||
"MAX_ITERATIONS": -1, | ||
"ABSOLUTE_GAP": 1e-04, | ||
"RELATIVE_GAP": 1e-06, | ||
"RELAXED_GAP": 1e-05, | ||
"AGGREGATION": false, | ||
"OUTPUTROOT": "data_test/external_loop_test/lp/", | ||
"TRACE": true, | ||
"SLAVE_WEIGHT": "CONSTANT", | ||
"SLAVE_WEIGHT_VALUE": 3, | ||
"MASTER_NAME": "master", | ||
"STRUCTURE_FILE": "data_test/external_loop_test/lp/structure.txt", | ||
"INPUTROOT": "data_test/external_loop_test/lp/", | ||
"CSV_NAME": "benders_output_trace", | ||
"BOUND_ALPHA": true, | ||
"SEPARATION_PARAM": 0.5, | ||
"BATCH_SIZE": 0, | ||
"JSON_FILE":"data_test/external_loop_test/expansion/out.json", | ||
"LAST_ITERATION_JSON_FILE":"data_test/external_loop_test/expansion/last_iteration.json", | ||
"MASTER_FORMULATION": "integer", | ||
"SOLVER_NAME": "XPRESS", | ||
"TIME_LIMIT": 1000000000000.0, | ||
"LOG_LEVEL": 1, | ||
"LAST_MASTER_MPS": "master_last_iteration", | ||
"LAST_MASTER_BASIS": "master_last_basis.bss", | ||
"EXT_LOOP_CRITERION_VALUE": 3.0, | ||
"EXT_LOOP_CRITERION_TOLERANCE": 1e-1, | ||
"EXT_LOOP_CRITERION_COUNT_THRESHOLD": 1e-1 | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,2 @@ | ||
master G_p_max_0_0 0 | ||
subproblem.mps G_p_max_0_0 24 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,88 @@ | ||
* Generated by MPModelProtoExporter | ||
* Name : | ||
* Format : Free | ||
* Constraints : 10 | ||
* Variables : 25 | ||
* Binary : 0 | ||
* Integer : 0 | ||
* Continuous : 25 | ||
NAME | ||
ROWS | ||
N COST | ||
E N0_Balance | ||
E N0_Balance_1 | ||
E N1_Balance | ||
E N1_Balance_2 | ||
E N2_Balance | ||
E N2_Balance_3 | ||
E N3_Balance | ||
E N3_Balance_4 | ||
L G_Max_generation | ||
L G_Max_generation_5 | ||
COLUMNS | ||
N0_NegativeUnsuppliedEnergy_0_0 COST 0.5 N0_Balance -1 | ||
N0_NegativeUnsuppliedEnergy_0_1 COST 0.5 N0_Balance_1 -1 | ||
PositiveUnsuppliedEnergy::N0::0::0 COST 5 N0_Balance 1 | ||
PositiveUnsuppliedEnergy::N0::0::1 COST 5 N0_Balance_1 1 | ||
N1_NegativeUnsuppliedEnergy_0_0 COST 0.5 N1_Balance -1 | ||
N1_NegativeUnsuppliedEnergy_0_1 COST 0.5 N1_Balance_2 -1 | ||
PositiveUnsuppliedEnergy::N1::0::0 COST 5 N1_Balance 1 | ||
PositiveUnsuppliedEnergy::N1::0::1 COST 5 N1_Balance_2 1 | ||
N2_NegativeUnsuppliedEnergy_0_0 COST 0.5 N2_Balance -1 | ||
N2_NegativeUnsuppliedEnergy_0_1 COST 0.5 N2_Balance_3 -1 | ||
PositiveUnsuppliedEnergy::N2::0::0 COST 5 N2_Balance 1 | ||
PositiveUnsuppliedEnergy::N2::0::1 COST 5 N2_Balance_3 1 | ||
N3_NegativeUnsuppliedEnergy_0_0 COST 0.5 N3_Balance -1 | ||
N3_NegativeUnsuppliedEnergy_0_1 COST 0.5 N3_Balance_4 -1 | ||
PositiveUnsuppliedEnergy::N3::0::0 COST 5 N3_Balance 1 | ||
PositiveUnsuppliedEnergy::N3::0::1 COST 5 N3_Balance_4 1 | ||
L01_flow_0_0 COST 1 N0_Balance -1 | ||
L01_flow_0_0 N1_Balance 1 | ||
L01_flow_0_1 COST 1 N0_Balance_1 -1 | ||
L01_flow_0_1 N1_Balance_2 1 | ||
L02_flow_0_0 COST 0.5 N0_Balance -1 | ||
L02_flow_0_0 N2_Balance 1 | ||
L02_flow_0_1 COST 0.5 N0_Balance_1 -1 | ||
L02_flow_0_1 N2_Balance_3 1 | ||
L03_flow_0_0 COST 1.5 N0_Balance -1 | ||
L03_flow_0_0 N3_Balance 1 | ||
L03_flow_0_1 COST 1.5 N0_Balance_1 -1 | ||
L03_flow_0_1 N3_Balance_4 1 | ||
G_generation_0_0 COST 0.5 N0_Balance 1 | ||
G_generation_0_0 G_Max_generation 1 | ||
G_generation_0_1 COST 0.5 N0_Balance_1 1 | ||
G_generation_0_1 G_Max_generation_5 1 | ||
G_p_max_0_0 G_Max_generation -1 G_Max_generation_5 -1 | ||
RHS | ||
RHS N0_Balance 0 N0_Balance_1 0 | ||
RHS N1_Balance 1 N1_Balance_2 3 | ||
RHS N2_Balance 3 N2_Balance_3 3 | ||
RHS N3_Balance 0 N3_Balance_4 3 | ||
RHS G_Max_generation 1 G_Max_generation_5 1 | ||
BOUNDS | ||
PL BOUND N0_NegativeUnsuppliedEnergy_0_0 | ||
PL BOUND N0_NegativeUnsuppliedEnergy_0_1 | ||
PL BOUND PositiveUnsuppliedEnergy::N0::0::0 | ||
PL BOUND PositiveUnsuppliedEnergy::N0::0::1 | ||
PL BOUND N1_NegativeUnsuppliedEnergy_0_0 | ||
PL BOUND N1_NegativeUnsuppliedEnergy_0_1 | ||
PL BOUND PositiveUnsuppliedEnergy::N1::0::0 | ||
PL BOUND PositiveUnsuppliedEnergy::N1::0::1 | ||
PL BOUND N2_NegativeUnsuppliedEnergy_0_0 | ||
PL BOUND N2_NegativeUnsuppliedEnergy_0_1 | ||
PL BOUND PositiveUnsuppliedEnergy::N2::0::0 | ||
PL BOUND PositiveUnsuppliedEnergy::N2::0::1 | ||
PL BOUND N3_NegativeUnsuppliedEnergy_0_0 | ||
PL BOUND N3_NegativeUnsuppliedEnergy_0_1 | ||
PL BOUND PositiveUnsuppliedEnergy::N3::0::0 | ||
PL BOUND PositiveUnsuppliedEnergy::N3::0::1 | ||
UP BOUND L01_flow_0_0 100 | ||
UP BOUND L01_flow_0_1 100 | ||
UP BOUND L02_flow_0_0 100 | ||
UP BOUND L02_flow_0_1 100 | ||
UP BOUND L03_flow_0_0 100 | ||
UP BOUND L03_flow_0_1 100 | ||
PL BOUND G_generation_0_0 | ||
PL BOUND G_generation_0_1 | ||
UP BOUND G_p_max_0_0 10 | ||
ENDATA |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.