A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 13:10, 5 March 2024

scientific article
Language Label Description Also known as
English
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
scientific article

    Statements

    A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (English)
    0 references
    0 references
    0 references
    1980
    0 references
    polar cuts
    0 references
    disjunctive face cuts
    0 references
    finite algorithm
    0 references
    cutting plane
    0 references
    polyhedral set
    0 references
    computational experience
    0 references
    test problems
    0 references
    disjunctive cuts
    0 references
    bilinear programming problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references