Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

Tamas Terlaky | 2688 | 5628 | 9.65358e-04 | easy | milo | 326481.14282799 | milo-v12-6-r2-40-1.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 | 2688 | 2688 |

Constraints | 5628 | 5208 |

Binaries | 840 | 840 |

Integers | 0 | 210 |

Continuous | 1848 | 1638 |

Implicit Integers | 0 | 210 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.000965358 | 0.001013210 |

Nonzeroes | 14604 | 14184 |

Original | Presolved | |
---|---|---|

Total | 5628 | 5208 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 420 | 0 |

Aggregations | 216 | 216 |

Precedence | 630 | 630 |

Variable Bound | 1890 | 1890 |

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 | 2472 | 2262 |

General Linear | 0 | 210 |

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 | 2.100371 | ||||

Constraint % | 0.403226 | 0.722888 | 0.403226 | 36.7512 | |

Variable % | 0.409226 | 0.800000 | 0.409226 | 38.8021 | |

Score | 0.756297 |

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 | 326481.1 | 326481.1 | 0 | 3.8e-06 | 0 | - | 2018-10-12 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to milo-v12-6-r2-40-1 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-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-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-v13-4-3d-3-0 | hard | 516 | 120 | 0 | 396 | 996 | 2456 | Tamas Terlaky | milo | 273238.08563337 | aggregations variable_bound mixed_binary general_linear |

neos-4292145-piako | open | 32950 | 13370 | 0 | 19580 | 75834 | 190186 | Jeff Linderoth | neos-pseudoapplication-57 | 29160.50026450142* | aggregations precedence variable_bound invariant_knapsack mixed_binary general_linear |

`No bibliographic information available`

Last Update Dec 06, 2022 by Jan Krüger

generated with R Markdown

© 2022 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint