Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

Letchford, Adam and Souli, Georgia (2020) Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. Operations Research Letters, 48 (3). pp. 240-244. ISSN 0167-6377

[thumbnail of fixed-charges-on-subsets]
Text (fixed-charges-on-subsets)
fixed_charges_on_subsets.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (314kB)


We consider mixed 0-1 linear programs in which one is given a collection of (not necessarily disjoint) sets of variables and, for each set, a fixxed charge is incurred if and only if at least one of the variables in the set takes a positive value. We derive strong valid linear inequalities for these problems, and show that they generalise and dominate a subclass of the well-known flow cover inequalities for the classical fixed-charge problem.

Item Type:
Journal Article
Journal or Publication Title:
Operations Research Letters
Additional Information:
This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 48, 3, 2020 DOI: 10.1016/j.orl.2020.03.004
Uncontrolled Keywords:
?? mixed-integer linear programmingbranch-and-cutpolyhedral combinatoricsmanagement science and operations researchsoftwareapplied mathematicsindustrial and manufacturing engineering ??
ID Code:
Deposited By:
Deposited On:
13 Mar 2020 13:55
Last Modified:
17 Dec 2023 01:47