WEEKLY ACTIVITIES

Time: 9h00, Wednesday, December 23, 2015
Location: Room 4, Building A14, Institute of Mathematics, 18 Hoang Quoc Viet, Cau Giay, Hanoi

Abstract: Most design optimization problem can be formulated as minimize the function f(X) where X is the expanded design matrix of a design matrix D subjected to certain constraints imposed on D. In this talk, three types of algorithms commonly used in optimal design construction are discussed. They are: (i) exchange algorithms (ii) interchange algorithms and (iii) cyclic exchange algorithms. Examples of the use of each type of algorithm in design construction will be given.

This talk will use supersaturated designs (Nguyen 1996 and Nguyen & Cheng 2008) as a vehicle to motivate the use of computers in design construction.