On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization (Q1174434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality for polynomial 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90143-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968307541 / rank
 
Normal rank

Latest revision as of 08:45, 30 July 2024

scientific article
Language Label Description Also known as
English
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
scientific article

    Statements

    On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization (English)
    0 references
    0 references
    25 June 1992
    0 references
    The equivalence between two different types of bounds for a nonlinear 0-1 function \(f(x)\) is proved. The tightest bound provided by a paved upper plan of \(f(x)\) coincides with the bound obtained from standard linearization.
    0 references
    0 references
    bounds
    0 references
    nonlinear 0-1 function
    0 references

    Identifiers