This package implements the ForLion algorithm and EW ForLion on the problem of designing an experiment with both discrete and continuous factors. The ForLion algorithm searches for locally optimal approximate designs under the D-criterion. When the true parameters are unknown, we can generate the EW D-optimal designs through EW ForLion algorithm. This features allow users to create efficient and robust experimental designs that account for parameter uncertainty. The algorithm performs an exhaustive search in a design space with mixed factors while keeping high efficiency and reducing the number of distinct experimental settings.
We mainly focus on generalized linear models (GLMs) and multinomial logit models (MLMs). Furthermore, implementing approximate designs with continuous settings can be challenging in practical applications. To address this issue, our package includes a rounding algorithm that converts the continuous factor values to a feasible experimental value based on pre-defined grid levels, and transforms the approximate designs into exact designs. This approximate-to-exact design algorithm ensures that the resulting exact design remains highly efficient while being more feasible for practical implementation.
The package could be loaded through:
When the true parameter values \(\boldsymbol \theta\) are known, the locally D-optiaml design is obtained by finding the design \(\boldsymbol \xi = \{(\mathbf x_i, w_i), i = 1,\dots,m\}\) that maximizes \[ f_{locally}(\boldsymbol \xi)=\left| \mathbf F(\boldsymbol \xi, \boldsymbol \theta)\right|.\] The theoretical details of the ForLion algorithm are presented in reference [1].
However, in practice, the true parameters estimate \(\boldsymbol \theta\) are not always accurate. When the true parameter values are unknown, traditional optimal designs may perform poorly if the assumed parameter estimates are inaccurate. So, when \(\boldsymbol{\theta}\) is unknown but a prior distribution or measure \(Q(d\boldsymbol{\theta})\) on \(\boldsymbol{\Theta}\) is available, we apply the EW D-optimality and look for \(\boldsymbol{\xi}\) maximizing
\[ f_{\rm EW}(\boldsymbol{\xi}) = |E\{{\mathbf F}(\boldsymbol{\xi}, \boldsymbol{\Theta})\}| = \left| \sum_{i=1}^m w_i E\left\{ {\mathbf F}({\mathbf x}_i, \boldsymbol{\Theta})\right\} \right|. \] We provided two approaches to compute the expected information matrix. The first is referred to as an integral-based EW D-optimal approximate design, in which
\[ E\left\{ {\mathbf F}({\mathbf x}_i, \boldsymbol{\Theta})\right\} = \int_{\boldsymbol{\Theta}} {\mathbf F}({\mathbf x}_i, \boldsymbol{\theta}) Q(d\boldsymbol{\theta}). \]
Alternatively, if a dataset from prior studies or pilot studies is available, we may bootstrap this dataset, fit the parametric model to each bootstrapped sample to obtain parameter estimates \(\hat{\boldsymbol{\theta}}_j\), \(j=1, \ldots, B\). We then seek \(\boldsymbol{\xi}\), which maximizes
\[ f_{\rm SEW}(\boldsymbol{\xi}) = |\hat{E}\{{\mathbf F}(\boldsymbol{\xi}, \boldsymbol{\Theta})\}| = \left| \sum_{i=1}^m w_i \hat{E}\left\{ {\mathbf F}({\mathbf x}_i, \boldsymbol{\Theta})\right\} \right|. \] Hence, we obtain a sample-based EW D-optimal approximate design, where
\[ \hat{E}\left\{ {\mathbf F}({\mathbf x}_i, \boldsymbol{\Theta})\right\} = \frac{1}{B} \sum_{j=1}^B {\mathbf F}({\mathbf x}_i, \hat{\boldsymbol{\theta}}_j) \] For a detailed description of the EW ForLion algorithm, see reference [2].
Through two case studies (GLM and MLM frameworks), we illustrate ’s implementation for finding both D-optimal designs and EW D-optimal designs in experimental settings.
This is an example of electrostatic discharge (ESD) experiment in Section 4 of the reference manuscript.
Lukemire et al. (2019) reconsidered the electrostatic discharge (ESD) experiment described by Whitman et al. (2006) with a binary response and five mixed factors. The first four factors LotA, LotB, ESD, Pulse take values in \(\{-1,1\}\), and the fifth factor Voltage \(\in [25, 45]\) is continuous.
The logistic regression model is:
\(\text{logit}(\mu)=\beta_0+\beta_1\text{LotA}+\beta_2\text{LotB}+\beta_3\text{ESD}+\beta_4\text{Pulse}+\beta_5\text{Voltage}+\beta_{34}(\text{ESD}\times\text{Pulse})\)
The parameter values: \(\boldsymbol \beta = (\beta_0, \beta_1, \beta_2, \beta_3, \beta_4, \beta_5, \beta_{34})=(-7.5, 1.50,-0.2,-0.15,0.25,0.35,0.4)\)
hfunc.temp = function(y) {c(y,y[4]*y[5],1);}; # y -> h(y)=(y1,y2,y3,y4,y5,y4*y5,1)
n.factor.temp = c(0, 2, 2, 2, 2) # 1 continuous factor with 4 discrete factors
factor.level.temp = list(c(25,45),c(-1,1),c(-1,1),c(-1,1),c(-1,1))
link.temp="logit"
beta.value = c(0.35,1.50,-0.2,-0.15,0.25,0.4,-7.5) # continuous first and intercept last to fit hfunc.tempThen, we use the ForLion_GLM_Optimal() function in ForLion package to search for the D-optimal design
set.seed(482)
forlion.glm=ForLion_GLM_Optimal(n.factor=n.factor.temp, factor.level=factor.level.temp, hfunc=hfunc.temp,bvec=beta.value,link=link.temp,reltol=1e-5, delta=0.1, maxit=1000, random=FALSE, logscale=TRUE)
forlion.glm
#> Design Output
#> ==============================================================
#> Count X1 X2 X3 X4 X5 Allocation
#> --------------------------------------------------------------
#> 1 25.0275 -1.0000 1.0000 1.0000 -1.0000 0.0432
#> 2 25.1062 -1.0000 1.0000 -1.0000 -1.0000 0.0828
#> 3 25.1957 -1.0000 -1.0000 1.0000 -1.0000 0.1100
#> 4 28.5555 -1.0000 -1.0000 -1.0000 1.0000 0.0742
#> 5 33.0930 -1.0000 1.0000 1.0000 -1.0000 0.0462
#> 6 25.0000 -1.0000 -1.0000 1.0000 1.0000 0.0855
#> 7 25.0000 -1.0000 -1.0000 -1.0000 1.0000 0.0339
#> 8 29.1384 -1.0000 1.0000 -1.0000 -1.0000 0.0135
#> 9 25.0000 -1.0000 1.0000 1.0000 1.0000 0.0923
#> 10 25.0000 1.0000 1.0000 1.0000 -1.0000 0.1331
#> 11 31.5543 -1.0000 -1.0000 1.0000 -1.0000 0.0018
#> 12 25.0000 1.0000 -1.0000 1.0000 -1.0000 0.0136
#> 13 25.0000 -1.0000 1.0000 -1.0000 1.0000 0.1013
#> 14 25.0000 -1.0000 -1.0000 -1.0000 -1.0000 0.0865
#> 15 32.8079 -1.0000 1.0000 1.0000 -1.0000 0.0822
#> ==============================================================
#>
#> m:
#> [1] 15
#>
#> det:
#> [1] 1.256089e-05
#>
#> convergence:
#> [1] TRUE
#>
#> min.diff:
#> [1] 0.2851
#>
#> x.close:
#> [,1] [,2] [,3] [,4] [,5]
#> [1,] 33.0930 -1 1 1 -1
#> [2,] 32.8079 -1 1 1 -1
#>
#> itmax:
#> [1] 49The output have these key components:
\(m\): number of design points
\(Design Point\): matrix with rows indicating design point
\(Allocation\): D-optimal approximate allocation
\(det\): Optimal determinant of Fisher information matrix
\(convergence\): TRUE or FALSE, whether converge
\(min.diff\): the minimum Euclidean distance between design points
\(x.close\): a pair of design points with minimum distance
\(itmax\): iteration of the algorithm
In our ESD experiment with a single continuous variable, the process
yielded theoretical design points with continuous values, such as
25.1062 and 26.0956. As these values are not practically feasible, we
must generate an exact allocation. This is achieved by using function
GLM_Exact_Design() to convert the continuous values into a
feasible value set of discrete points and to transform the approximate
allocation into an exact allocation. We assume that the total number of
observations is equal to \(N=500\) and
use the rounding level of \(L=0.1\) for
the continuous variable Voltage.
GLM_Exact_Design(k.continuous=1, design_x=forlion.glm$x.factor, design_p=forlion.glm$p,
det.design=forlion.glm$det,p=7, ForLion=TRUE, bvec=beta.value, delta2=0.5,L=0.1,N=500, hfunc=hfunc.temp, link="logit")
#> Design Output
#> ==============================================================
#> Count X1 X2 X3 X4 X5 Allocation
#> --------------------------------------------------------------
#> 1 25.0000 -1.0000 1.0000 1.0000 -1.0000 0.0432
#> 2 25.1000 -1.0000 1.0000 -1.0000 -1.0000 0.0828
#> 3 25.2000 -1.0000 -1.0000 1.0000 -1.0000 0.1100
#> 4 28.6000 -1.0000 -1.0000 -1.0000 1.0000 0.0742
#> 5 25.0000 -1.0000 -1.0000 1.0000 1.0000 0.0855
#> 6 25.0000 -1.0000 -1.0000 -1.0000 1.0000 0.0339
#> 7 29.1000 -1.0000 1.0000 -1.0000 -1.0000 0.0135
#> 8 25.0000 -1.0000 1.0000 1.0000 1.0000 0.0923
#> 9 25.0000 1.0000 1.0000 1.0000 -1.0000 0.1331
#> 10 31.6000 -1.0000 -1.0000 1.0000 -1.0000 0.0018
#> 11 25.0000 1.0000 -1.0000 1.0000 -1.0000 0.0136
#> 12 25.0000 -1.0000 1.0000 -1.0000 1.0000 0.1013
#> 13 25.0000 -1.0000 -1.0000 -1.0000 -1.0000 0.0865
#> 14 32.9000 -1.0000 1.0000 1.0000 -1.0000 0.1284
#> ==============================================================
#>
#> ni.design:
#> [1] 22 41 55 37 43 17 7 46 66 1 7 51 43 64
#>
#> rel.efficiency:
#> [1] 1.000069In here:
\(ni.design\): exact allocation
\(rel.efficiency\): relative efficiency of the Exact and Approximate Designs
When the true parameter values of an experiment are unknown but their prior distribution is known, in here we show how to use the function EW_ForLion_GLM_Optimal() to find the sample-based EW D-aptimal approximate design. In this experiment, we assume that each element of \(\boldsymbol \theta\) has the following independent prior distributions:
\[ \beta_0 \sim U(-8,-7),\quad \beta_1 \sim U(1,2), \quad \beta_2 \sim U(-0.3,-0.1), \quad \beta_3 \sim U(-0.3,0) \\ \beta_4 \sim U(0.1,0.4) , \quad \beta_5 \sim U(0.25, 0.45),\quad \beta_{34} \sim U(0.35,0.45) \]
We firstly random sample \(B=100\) parameter vectors from the previously defined prior distributions.
nrun = 100
set.seed(2025)
b_0 = runif(nrun, -8, -7)
b_1 = runif(nrun, 1, 2)
b_2 = runif(nrun, -0.3, -0.1)
b_3 = runif(nrun, -0.3, 0)
b_4 = runif(nrun, 0.1, 0.4)
b_5 = runif(nrun, 0.25, 0.45)
b_34= runif(nrun, 0.35, 0.45)
beta.matrix = cbind(b_5,b_1,b_2,b_3,b_4,b_34,b_0)Then, we utilize the EW_ForLion_GLM_Optimal() function in ForLion package to search for the EW D-optimal approximate design
set.seed(482)
EW_ForLion_GLM_Optimal(n.factor=c(0, 2, 2, 2, 2), factor.level=list(c(25,45),c(-1,1),c(-1,1),c(-1,1),c(-1,1)), hfunc=hfunc.temp, Integral_based=FALSE, b_matrix=beta.matrix, link="logit", reltol=1e-6, delta=0.01, maxit=500, random=FALSE,nram=1,logscale=TRUE)
#> Design Output
#> ==============================================================
#> Count X1 X2 X3 X4 X5 Allocation
#> --------------------------------------------------------------
#> 1 25.0275 -1.0000 1.0000 1.0000 -1.0000 0.0944
#> 2 25.1062 -1.0000 1.0000 -1.0000 -1.0000 0.0804
#> 3 25.1297 -1.0000 1.0000 -1.0000 1.0000 0.0524
#> 4 25.3188 -1.0000 1.0000 1.0000 1.0000 0.0837
#> 5 25.4221 -1.0000 -1.0000 1.0000 1.0000 0.0840
#> 6 25.4990 -1.0000 -1.0000 -1.0000 1.0000 0.0873
#> 7 26.0956 -1.0000 -1.0000 1.0000 -1.0000 0.0408
#> 8 26.2386 -1.0000 -1.0000 -1.0000 -1.0000 0.0814
#> 9 38.9186 -1.0000 1.0000 1.0000 -1.0000 0.0341
#> 10 35.3636 -1.0000 1.0000 -1.0000 1.0000 0.0394
#> 11 33.7257 -1.0000 1.0000 -1.0000 -1.0000 0.0063
#> 12 33.2361 -1.0000 1.0000 1.0000 1.0000 0.0065
#> 13 25.0000 1.0000 1.0000 -1.0000 1.0000 0.0649
#> 14 36.9279 -1.0000 -1.0000 1.0000 -1.0000 0.0257
#> 15 25.0000 1.0000 -1.0000 1.0000 -1.0000 0.0732
#> 16 25.0000 1.0000 1.0000 -1.0000 -1.0000 0.0297
#> 17 38.8660 -1.0000 1.0000 1.0000 -1.0000 0.0630
#> 18 25.0000 1.0000 1.0000 1.0000 1.0000 0.0067
#> 19 25.0000 1.0000 1.0000 1.0000 -1.0000 0.0463
#> ==============================================================
#>
#> m:
#> [1] 19
#>
#> det:
#> [1] 3.584284e-06
#>
#> convergence:
#> [1] TRUE
#>
#> min.diff:
#> [1] 0.0526
#>
#> x.close:
#> [,1] [,2] [,3] [,4] [,5]
#> [1,] 38.9186 -1 1 1 -1
#> [2,] 38.8660 -1 1 1 -1
#>
#> itmax:
#> [1] 110The output have these key components:
\(m\): number of design points
\(Design Point\): matrix with rows indicating design point
\(Allocation\): the reported EW D-optimal approximate allocation
\(det\): Optimal determinant of the expected Fisher information matrix
\(convergence\): TRUE or FALSE, whether converge
\(min.diff\): the minimum Euclidean distance between design points
\(x.close\): a pair of design points with minimum distance
\(itmax\): iteration of the algorithm
This is an example of minimizing surface defects experiment, which is example in S.3 in the supplementary material of the reference manuscript.
A polysilicon deposition process for manufacturing very large-scale integrated (VLSI) circuits was described with six control factors, namely, Cleaning Method, Deposition temperature (\(^\circ\)C), Deposition pressure (mtorr), Nitrogen flow rate (seem), Silane flow rate (seem), and Settling time (minutes). Wu (2008) used the relevant experiment as an illustrative example and categorized the response Surface Defects from a count number to one of the five ordered categories, namely, Practically no surface defects (I, \(0\sim 3\)), Very few defects (II, \(4\sim 30\)), Some defects (III, \(31\sim 300\)), Many defects (IV, \(301\sim 1000\)), and Too many defects (V, \(1001\) and above).
The example uses cumulative proportional odds model.
\(\log\left(\frac{\pi_{i1}+\cdots+\pi_{ij}}{\pi_{i,j+1}+\cdots+\pi_{iJ}}\right)=\theta_{j} - \beta_1 x_{i1} - \beta_2 x_{i2} - \beta_3 x_{i3}\nonumber - \beta_4 x_{i4} - \beta_5 x_{i5} - \beta_6 x_{i6}\)
with \(i=1, \ldots, m\) and \(j=1, 2, 3, 4\) and \(\boldsymbol \theta = (\theta_1, \theta_2, \theta_3, \theta_4, \beta_1, \beta_2, \beta_3, \beta_4, \beta_5, \beta_6)=(-1.77994301, -0.05287782, 1.86852211, 2.76330779,\) $ -0.94437464, 0.18504420, -0.01638597, -0.03543202, -0.07060306, 0.10347917)$.
Note: Always put continuous factors ahead of discrete factors, pay attention to the order of coefficients pairing with predictors
link.temp = "cumulative"
## Note: Always put continuous factors ahead of discrete factors, pay attention to the order of coefficients paring with predictors
n.factor.temp = c(0,0,0,0,0,2) # 1 discrete factor w/ 2 levels + 5 continuous
factor.level.temp = list(c(-25,25), c(-200,200),c(-150,0),c(-100,0),c(0,16),c(-1,1))
J = 5 #num of response levels
p = 10 #num of parameters
hfunc.temp = function(y){
if(length(y) != 6){stop("Input should have length 6");}
model.mat = matrix(NA, nrow=5, ncol=10, byrow=TRUE)
model.mat[5,]=0
model.mat[1:4,1:4] = diag(4)
model.mat[1:4, 5] =((-1)*y[6])
model.mat[1:4, 6:10] = matrix(((-1)*y[1:5]), nrow=4, ncol=5, byrow=TRUE)
return(model.mat)
}
hprime.temp=NULL #use numerical gradient for optim, thus could be NULL, if use analytical gradient then define hprime function
b.temp = c(-1.77994301, -0.05287782, 1.86852211, 2.76330779, -0.94437464, 0.18504420, -0.01638597, -0.03543202, -0.07060306, 0.10347917)Then, we can use ForLion_MLM_Optimal() function in ForLion package to search for the D-optimal design
set.seed(123)
ForLion_MLM_Optimal(J=J, n.factor=n.factor.temp, factor.level=factor.level.temp, hfunc=hfunc.temp, h.prime=hprime.temp, bvec=b.temp, link=link.temp, Fi.func=Fi_MLM_func, delta0=1e-2, epsilon=1e-10, reltol=1e-8, delta=0.5, maxit=500, optim_grad=FALSE)
#> Design Output
#> ==============================================================================
#> Count X1 X2 X3 X4 X5 X6 Allocation
#> ------------------------------------------------------------------------------
#> 1 -8.7748 -200.0000 0.0000 0.0000 16.0000 1.0000 0.1002
#> 2 -25.0000 167.9246 0.0000 -100.0000 0.0000 1.0000 0.0977
#> 3 25.0000 200.0000 0.0000 0.0000 0.0000 1.0000 0.1148
#> 4 -9.2144 200.0000 0.0000 -100.0000 0.0000 -1.0000 0.0447
#> 5 -25.0000 -153.3904 0.0000 0.0000 0.0000 -1.0000 0.0935
#> 6 -25.0000 200.0000 -150.0000 -83.5990 0.0000 1.0000 0.0651
#> 7 -25.0000 200.0000 -117.5017 0.0000 16.0000 -1.0000 0.1237
#> 8 -25.0000 -145.9755 -150.0000 0.0000 0.0000 1.0000 0.0910
#> 9 -14.0455 200.0000 -150.0000 0.0000 0.0000 1.0000 0.0275
#> 10 -25.0000 -200.0000 0.0000 -31.3523 0.0000 -1.0000 0.0274
#> 11 -2.6044 200.0000 -150.0000 0.0000 0.0000 -1.0000 0.0764
#> 12 -25.0000 77.3014 -150.0000 0.0000 0.0000 1.0000 0.0058
#> 13 -25.0000 81.0170 0.0000 -100.0000 0.0000 -1.0000 0.0048
#> 14 -25.0000 78.7941 0.0000 -100.0000 0.0000 -1.0000 0.0298
#> 15 25.0000 200.0000 0.0000 0.0000 16.0000 1.0000 0.0741
#> 16 -25.0000 77.8620 -150.0000 0.0000 0.0000 1.0000 0.0005
#> 17 -25.0000 77.6792 0.0000 -100.0000 0.0000 -1.0000 0.0232
#> ==============================================================================
#>
#> m:
#> [1] 17
#>
#> det:
#> [1] 163138258
#>
#> convergence:
#> [1] TRUE
#>
#> min.diff:
#> [1] 0.5607
#>
#> x.close:
#> [,1] [,2] [,3] [,4] [,5] [,6]
#> [1,] -25 77.3014 -150 0 0 1
#> [2,] -25 77.8620 -150 0 0 1
#>
#> itmax:
#> [1] 283In this minimizing surface defects experiment, we have following independent prior distributions:
\[ \beta_1 \sim U(-1,0),\quad \beta_2 \sim U(0,0.2), \quad \beta_3 \sim U(-0.1,0.1), \quad \beta_4 \sim U(-0.1,0.1), \quad \beta_5 \sim U(-0.1,0.1) ,\\ \beta_6 \sim U(0, 0.2), \quad \theta_1 \sim U(-2, -1),\quad \theta_2 \sim U(-0.5,0.5), \quad \theta_3 \sim U(1,2), \quad \theta_4 \sim U(2.5, 3.5) \]
To construct a robust design against parameter misspecifications, we sample \(B=100\) parameter vectors from the prior distributions
nrun = 100
set.seed(0713)
b_clean = runif(nrun, -1, 0)
b_temperature = runif(nrun, 0, 0.2)
b_pressure = runif(nrun, -0.1, 0.1)
b_nitrogen = runif(nrun, -0.1, 0.1)
b_silane = runif(nrun, -0.1, 0.1)
b_time = runif(nrun, 0, 0.2)
theta1 = runif(nrun, -2, -1)
theta2 = runif(nrun, -0.5, 0.5)
theta3 = runif(nrun, 1, 2)
theta4 = runif(nrun, 2.5, 3.5)
beta.temp2 = cbind(theta1, theta2, theta3, theta4, b_clean, b_temperature, b_pressure, b_nitrogen, b_silane, b_time)Then, we can use EW_ForLion_MLM_Optimal() function to find the sampled-based EW D-optimal approximate design
set.seed(123)
EW_forlion.MLM =EW_ForLion_MLM_Optimal(J=J, n.factor=n.factor.temp, factor.level=factor.level.temp,
hfunc=hfunc.temp, h.prime=hprime.temp, bvec_matrix=beta.temp2, link=link.temp, EW_Fi.func=EW_Fi_MLM_func,
delta0=1e-2, epsilon=1e-10, reltol=1e-8, delta=0.5, maxit=500, optim_grad=FALSE)
EW_forlion.MLM
#> Design Output
#> ==============================================================================
#> Count X1 X2 X3 X4 X5 X6 Allocation
#> ------------------------------------------------------------------------------
#> 1 16.9548 -11.4335 0.0000 0.0000 16.0000 1.0000 0.1330
#> 2 -11.2636 -2.9635 0.0000 0.0000 0.0000 1.0000 0.0909
#> 3 -25.0000 -10.5257 0.0000 -40.5976 16.0000 -1.0000 0.1401
#> 4 -25.0000 -137.9685 -150.0000 0.0000 16.0000 1.0000 0.0622
#> 5 14.8324 -3.6947 0.0000 0.0000 0.0000 -1.0000 0.1694
#> 6 25.0000 95.6302 -150.0000 -100.0000 0.0000 -1.0000 0.0195
#> 7 25.0000 -88.6268 0.0000 -100.0000 0.0000 1.0000 0.0040
#> 8 25.0000 200.0000 -150.0000 0.0000 16.0000 -1.0000 0.0695
#> 9 -25.0000 -200.0000 -150.0000 -100.0000 0.0000 -1.0000 0.0600
#> 10 -25.0000 26.7590 0.0000 -100.0000 0.0000 1.0000 0.0725
#> 11 25.0000 68.8150 -83.8015 -100.0000 16.0000 1.0000 0.0331
#> 12 -25.0000 54.2647 -83.2000 0.0000 -0.0000 1.0000 0.0650
#> 13 -25.0000 200.0000 -15.0079 -100.0000 16.0000 -1.0000 0.0304
#> 14 25.0000 -22.8450 -54.6474 -100.0000 0.0000 1.0000 0.0504
#> ==============================================================================
#>
#> m:
#> [1] 14
#>
#> det:
#> [1] 500802
#>
#> convergence:
#> [1] TRUE
#>
#> min.diff:
#> [1] 18.0109
#>
#> x.close:
#> [,1] [,2] [,3] [,4] [,5] [,6]
#> [1,] 16.9548 -11.4335 0 0 16 1
#> [2,] 14.8324 -3.6947 0 0 0 -1
#>
#> itmax:
#> [1] 16Based on the obtained sample-based EW D-optimal approximate design. Assuming that the total number of experimental units is \(n=1000\), we apply MLM_Exact_Design() with \(L =c(0.5,0.1,0.1,0.1,1)\) for continuous control variables and obtain an exact design
MLM_Exact_Design(J=J, k.continuous=5,design_x=EW_forlion.MLM$x.factor,design_p=EW_forlion.MLM$p,det.design=
EW_forlion.MLM$det,p=10,ForLion=FALSE,bvec_matrix=beta.temp2,delta2=1,L=c(0.5,0.1,0.1,0.1,1),N=1000,hfunc=hfunc.temp,link=link.temp)
#> Design Output
#> ==============================================================================
#> Count X1 X2 X3 X4 X5 X6 Allocation
#> ------------------------------------------------------------------------------
#> 1 17.0000 -11.4000 0.0000 0.0000 16.0000 1.0000 0.1330
#> 2 -11.5000 -3.0000 0.0000 0.0000 0.0000 1.0000 0.0909
#> 3 -25.0000 -10.5000 0.0000 -40.6000 16.0000 -1.0000 0.1401
#> 4 -25.0000 -138.0000 -150.0000 0.0000 16.0000 1.0000 0.0622
#> 5 15.0000 -3.7000 0.0000 0.0000 0.0000 -1.0000 0.1694
#> 6 25.0000 95.6000 -150.0000 -100.0000 0.0000 -1.0000 0.0195
#> 7 25.0000 -88.6000 0.0000 -100.0000 0.0000 1.0000 0.0040
#> 8 25.0000 200.0000 -150.0000 0.0000 16.0000 -1.0000 0.0695
#> 9 -25.0000 -200.0000 -150.0000 -100.0000 0.0000 -1.0000 0.0600
#> 10 -25.0000 26.8000 0.0000 -100.0000 0.0000 1.0000 0.0725
#> 11 25.0000 68.8000 -83.8000 -100.0000 16.0000 1.0000 0.0331
#> 12 -25.0000 54.3000 -83.2000 0.0000 0.0000 1.0000 0.0650
#> 13 -25.0000 200.0000 -15.0000 -100.0000 16.0000 -1.0000 0.0304
#> 14 25.0000 -22.8000 -54.6000 -100.0000 0.0000 1.0000 0.0504
#> ==============================================================================
#>
#> ni.design:
#> [1] 133 91 140 62 169 20 4 70 60 73 33 65 30 50
#>
#> rel.efficiency:
#> [1] 0.9991006[1] Huang, Y., Li, K., Mandal, A. et al. ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors. Stat Comput 34, 157 (2024).
[2] Lin, S., Huang, Y. and Yang, J., 2025. EW D-optimal Designs for Experiments with Mixed Factors. arXiv preprint arXiv:2505.00629.