Mixing polyhedra with two non divisible coefficients (Q715089): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-011-0448-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-011-0448-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041296153 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57736573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact formulation of a mixed-integer set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact formulations as a union of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixing Set with Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Formulations of Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixing Set with Divisible Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing set with divisible capacities: a simple approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing MIR inequalities with two divisible coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Hardness Results for Diophantine Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes in integer and mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programs: valid inequalities and extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing-MIR set with divisible capacities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-011-0448-0 / rank
 
Normal rank

Latest revision as of 01:40, 10 December 2024

scientific article
Language Label Description Also known as
English
Mixing polyhedra with two non divisible coefficients
scientific article

    Statements

    Mixing polyhedra with two non divisible coefficients (English)
    0 references
    15 October 2012
    0 references
    The paper studies the mixed integer set \(X=\{(s,x,y) \in \mathbb{R} \times \mathbb{Z}^n \times \mathbb{Z}^m: s +a_1 x_j \geq b_j,\;j \in N_1, \;s+a_2 y_j \geq d_j,\;j \in N_2\}\), where \(N_1=\{1, \ldots, n\}\), \(N_2 =\{1, \ldots, m\}\) and \(a_1,a_2 \in \mathbb{Z}_+\setminus \{0\}\). After listing basic properties of \(P=conv(X)\), the authors first derive an implicit characterization of the facets of \(P\). This is done by decomposing \(X\) into a small number of subsets that have trivial convex hull descriptions. By using a projection theorem of Balas, they provide an implicit characterization of \(P\). Next, the classes of cycle inequalites and more general lifted cycle inequalities are introduced. The main result shows that all facet defining inequalities of \(P\) are either mixed MIR inequalities or lifted cycle inequalities. Moreover, if \(a_1\) and \(a_2\) are relative prime, then the mixed MIR inequalities suffice to describe \(P\).
    0 references
    mixed integer programming
    0 references
    facet defining inequality
    0 references

    Identifiers