Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/advor/CheungM16, #quickstatements; #temporary_batch_1731462974821 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/advor/CheungM16 / rank | |||
Normal rank | |||
Latest revision as of 03:06, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions |
scientific article |
Statements
Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (English)
0 references
11 May 2018
0 references
Summary: We introduce generalized subadditive generator functions for mixed integer linear programs. Our results extend \textit{D. Klabjan}'s work [Eur. J. Oper. Res. 183, No. 2, 525--545 (2007; Zbl 1166.90012)] from pure integer programs with nonnegative entries to general MILPs. These functions suffice to achieve strong subadditive duality. Several properties of the functions are shown. We then use this class of functions to generate certificates of optimality for MILPs. We have performed a computational test study on knapsack problems to investigate the efficiency of the certificates.
0 references
0 references
