Hilbert Bases for Orthogonal Arrays

Details Hilbert Bases for Orthogonal Arrays Hilbert Bases for Orthogonal Arrays

2006-11-09

arxiv.org/abs/math/0611276v1

Mathematics

Statistics Theory

Scientific paper

In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA$(n,m)$, where $n$ is the number of factors and $m$ the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretically solved by means of Hilbert bases which form a finite generating set for all the elements in in the infinite set OA$(n,m)$. We discuss some examples which are explicitly solved with a software performing Hilbert bases computation.

Affiliated with

Also associated with

No associations

Rating

Hilbert Bases for Orthogonal Arrays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hilbert Bases for Orthogonal Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hilbert Bases for Orthogonal Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407869