Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.csda.2008.06.023 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Average number of pivot steps required by the Simplex-Method is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(D\)-optimal designs for trigonometric regression models on a partial circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal designs for estimating individual coefficients in Fourier regression models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal designs for estimating the coefficients of the lower frequencies in trigonometric regression models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Allocation in Linear Regression Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric method for singular c-optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Design Problem in Rhythmometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elfving's method for \(m\)-dimensional models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal weights for experimental designs on linearly independent support points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remez's procedure for finding optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant Maximization with Linear Matrix Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780748 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CSDA.2008.06.023 / rank
 
Normal rank

Latest revision as of 10:06, 10 December 2024

scientific article
Language Label Description Also known as
English
Computing \(c\)-optimal experimental designs using the simplex method of linear programming
scientific article

    Statements

    Computing \(c\)-optimal experimental designs using the simplex method of linear programming (English)
    0 references
    0 references
    0 references
    30 March 2010
    0 references

    Identifiers