D-optimal Designs for Quartic Polynomial Model for Mixture Experiment with Three and Four Ingredients

This article considers a classical optimal design problem of finding saturated D-optimal designs for the quartic polynomial model for mixture experiments. The necessary and sufficient conditions of the optimality criterion are confirmed by using the corresponding equivalence theorem. AMS Subject Classification: 62K05

Authors

Institutions

Publication Details

Journal
Calcutta Statistical Association Bulletin
Published
2025-09-15
DOI
https://doi.org/10.1177/00080683251366118
Citations
1
Primary Topic
Optimal Experimental Design Methods
Type
article
Field-Weighted Citation Impact
2.11
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

D-optimal Designs for Quartic Polynomial Model for Mixture Experiment with Three and Four Ingredients

Mahesh Kumar Panda, Manisha Pal
1 citations
Calcutta Statistical Association Bulletin
Optimal Experimental Design Methods
2.11
article

D-optimal Designs for Quartic Polynomial Model for Mixture Experiment with Three and Four Ingredients

Mahesh Kumar Panda, Manisha Pal
article en
1 citations

Abstract

This article considers a classical optimal design problem of finding saturated D-optimal designs for the quartic polynomial model for mixture experiments. The necessary and sufficient conditions of the optimality criterion are confirmed by using the corresponding equivalence theorem. AMS Subject Classification: 62K05

Calcutta Statistical Association Bulletin
Ravenshaw University (IN), St Xavier’s College (IN)
Openalex Percentile: Top 10%
Optimal Experimental Design Methods
2.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.