DE- and EDPM- compound optimality for the information and probability-based criteria

Abstract

Several optimality criteria have been considered in the literature as information-based criteria. The probability- based criteria have been recently proposed for maximizing the probability of a desired outcome. However, designs that are optimal for the information- based criteria may be inadequate for probability- based criteria. This paper introduces the DE- and EDPM – optimum designs for multi aims of optimalityforGeneralizedLinearModels(GLMs). Anequivalencetheorem is proved for both compound criteria. Finally, two numerical examples are given to illustrate the potentiality of the proposed compound criteria.