MV-optimal weighing designs (Q1071442)

In this paper we consider the problem of weighing n objects in N weighings (N\(\geq n)\) on a chemical balance. A design is said to be MV- optimal within the class of designs considered if it minimises the maximum diagonal element of the inverse of the information matrix. A simpler proof of MV-optimal design in case of \(N\equiv 1\) mod 4 is given and also sharper bounds in case of \(N\equiv 3\) mod 4 are obtained.