LA_OofAC: Lioness Algorithm for order-of-addition design

In LA: Lioness Algorithm (LA)

Lioness Algorithm for order-of-addition design

Description

LA_OofAC returns a n by k D-optimal order-of-addition design matrix generated by lioness algorithm (LA)

Usage

LA_OofAC(n, k, m = 100L, N = 5000L)

factorialC(x)

modC(a, b)

rOofAC(n, k)

PWOC(X)

TC(X)

MOMC(X)

Arguments

n	A positive integer, which stands for the number of rows (or run size). Note that the maximum of n cannot be greater than k factorial.
k	A positive integer, which stands for the number of columns (or factor size).
m	A positive integer that stands for the number of starting design candidates. The default is set to be 100.
N	A positive integer that stands for the maximum number of iterations. The default is set to be 5000. A larger value of N may result a high CPU time.
x	is a positive integer.
a	is a positive integer.
b	is a positive integer.
X	A matrix object. In general, X stands for the design matrix.

Value

If all inputs are logical, then the output will be a n by k D-optimal order-of-addition design.

Examples

#generate a D-optimal full OofA with 4 factors.
try=LA_OofAC(n=24,k=4,m=10,N=50)
try

#Another example
#generate a D-optimal 11-run OofA with 4 factors.
try2=LA_OofAC(n=11,k=4,m=10,N=50)
try2

LA documentation built on June 22, 2024, 9:37 a.m.