An implementation of a discretization method for semi-infinite programming (Q3722265): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5514022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3695015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation technique for the numerical solution of a Stefan problem / rank
 
Normal rank

Latest revision as of 14:22, 17 June 2024

scientific article
Language Label Description Also known as
English
An implementation of a discretization method for semi-infinite programming
scientific article

    Statements

    An implementation of a discretization method for semi-infinite programming (English)
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    grid refinement
    0 references
    linear semi-infinite programming
    0 references
    discretization method
    0 references
    stable simplex-algorithm
    0 references
    bivariate Chebyshev approximation
    0 references