A simplification for some disjunctive formulations (Q1104856): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(88)90013-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059745600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Methods for Mathematical Programming Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A converse for disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral annexation in mixed integer and combinatorial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulation of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of unbounded optimization problems as integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Results on the New Techniques for Integer Programming Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and mixed-integer programming models: General properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer minimization models for piecewise-linear functions of a single variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical and computational comparison of “equivalent” mixed-integer formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercylindrically Deduced Cuts in Zero-One Integer Programs / rank
 
Normal rank

Latest revision as of 16:51, 18 June 2024

scientific article
Language Label Description Also known as
English
A simplification for some disjunctive formulations
scientific article

    Statements

    A simplification for some disjunctive formulations (English)
    0 references
    0 references
    1988
    0 references
    We define the non-empty polyhedra \(P_ h=\{x\); \(Ax\geq b^{(h)}\}\) for \(h=1,...,t\). Clearly, the elements of the convex hull of \(P_ 1,...,P_ t\) satisfy the condition \[ (*)\quad Ax\geq \sum^{t}_{h=1}\lambda_ hb^{(h)} \] for every \(\sum^{t}_{h=1}\lambda_ h=1\), \(\lambda_ h\geq 0\). The paper gives sufficient conditions that condition (*) gives exactly the convex hull of \(P_ 1,...,P_ t\).
    0 references
    non-empty polyhedra
    0 references
    convex hull
    0 references

    Identifiers