On linear programming relaxations for solving polynomial programming problems (Q1654348)

From MaRDI portal
Revision as of 21:23, 14 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129625558, #quickstatements; #temporary_batch_1726345393210)
scientific article
Language Label Description Also known as
English
On linear programming relaxations for solving polynomial programming problems
scientific article

    Statements

    On linear programming relaxations for solving polynomial programming problems (English)
    0 references
    0 references
    0 references
    8 August 2018
    0 references
    reformulation-linearization technique (RLT)
    0 references
    \(J\)-set relaxation
    0 references
    McCormick inequalities
    0 references
    polynomial programming problems
    0 references
    linear programming relaxations
    0 references
    branch-and-bound algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers