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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5615782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polaroids: A new tool in non‐convex and in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral convexity cuts and negative edge extensions / 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: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization of A convex quadratic function under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-concave minimization subject to linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-planes for programs with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Facility Location with Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the bilinear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bilinear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Maximization of a Convex Function with Linear Inequality Constraints / rank
 
Normal rank

Latest revision as of 04:19, 13 June 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