Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|
Tamas Terlaky | 516 | 996 | 4.77881e-03 | hard | milo | 273238.08563337 | milo-v13-4-3d-3-0.mps.gz |
The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time.
Detailed explanation of the following tables can be found here.
Original | Presolved | |
---|---|---|
Variables | 516 | 516 |
Constraints | 996 | 876 |
Binaries | 120 | 120 |
Integers | 0 | 60 |
Continuous | 396 | 336 |
Implicit Integers | 0 | 60 |
Fixed Variables | 0 | 0 |
Nonzero Density | 0.00477881 | 0.00516796 |
Nonzeroes | 2456 | 2336 |
Original | Presolved | |
---|---|---|
Total | 996 | 876 |
Empty | 0 | 0 |
Free | 0 | 0 |
Singleton | 120 | 0 |
Aggregations | 124 | 124 |
Precedence | 0 | 0 |
Variable Bound | 300 | 300 |
Set Partitioning | 0 | 0 |
Set Packing | 0 | 0 |
Set Covering | 0 | 0 |
Cardinality | 0 | 0 |
Invariant Knapsack | 0 | 0 |
Equation Knapsack | 0 | 0 |
Bin Packing | 0 | 0 |
Knapsack | 0 | 0 |
Integer Knapsack | 0 | 0 |
Mixed Binary | 452 | 392 |
General Linear | 0 | 60 |
Indicator | 0 | 0 |
Available nonzero structure and decomposition information. Further information can be found here.
Decomposed structure of original problem (dec-file)
Decomposed structure after trivial presolving (dec-file)
value | min | median | mean | max | |
---|---|---|---|---|---|
Components | 1.462398 | ||||
Constraint % | 1.48402 | 3.33496 | 1.48402 | 52.7397 | |
Variable % | 1.55039 | 3.57143 | 1.55039 | 56.2016 | |
Score | 0.630774 |
Find solutions below. Download the archive containing all solutions from the Download page.
ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|
1 | 273238.1 | 273238.1 | 0 | 0 | 0 | Hans Mittelmann | 2020-05-03 | Solved with Gurobi 9.0 using 48 Threads within 89 hours |
The following instances are most similar to milo-v13-4-3d-3-0 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.
Instance | Status | Variables | Binaries | Integers | Continuous | Constraints | Nonz. | Submitter | Group | Objective | Tags |
---|---|---|---|---|---|---|---|---|---|---|---|
milo-v13-4-3d-4-0 | open | 688 | 160 | 0 | 528 | 1328 | 3292 | Tamas Terlaky | milo | 358152.2621937089* | aggregations variable_bound mixed_binary general_linear |
milo-v12-6-r1-58-1 | hard | 4440 | 1500 | 0 | 2940 | 9540 | 25068 | Tamas Terlaky | milo | 634081.4112039516 | decomposition aggregations precedence variable_bound mixed_binary general_linear |
milo-v12-6-r1-75-1 | open | 5698 | 1925 | 0 | 3773 | 12243 | 32174 | Tamas Terlaky | milo | 1153756.39820567* | decomposition aggregations precedence variable_bound mixed_binary general_linear |
milo-v12-6-r2-40-1 | easy | 2688 | 840 | 0 | 1848 | 5628 | 14604 | Tamas Terlaky | milo | 326481.14282799 | benchmark decomposition benchmark_suitable aggregations precedence variable_bound mixed_binary general_linear |
supportcase17 | easy | 1381 | 732 | 235 | 414 | 2108 | 5253 | Michael Winkler | – | 1329.999999999999 | benchmark_suitable aggregations precedence variable_bound set_partitioning mixed_binary general_linear |
No bibliographic information available