Dual quadratic estimates in polynomial and Boolean programming (Q1173717): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:27, 5 March 2024

scientific article
Language Label Description Also known as
English
Dual quadratic estimates in polynomial and Boolean programming
scientific article

    Statements

    Dual quadratic estimates in polynomial and Boolean programming (English)
    0 references
    25 June 1992
    0 references
    The Lagrange function is a source for getting the so-called ``dual bound'' for a wide class of mathematical programming problems. In general, the determination of this bound is a nondifferentiable optimization problem. A dual quadratic bound can be used for polynomial programming problems and for quadratic Boolean problems. In some numerical experiments the relative error was \(3\%\) (the linear relative error was about \(25\%\)).
    0 references
    Lagrange function
    0 references
    nondifferentiable optimization
    0 references
    dual quadratic bound
    0 references
    0 references

    Identifiers