Resumen de Duality for linear multiplicative programs

T. R. Jefferson, C. H. Scott

• Linear multiplicative programs are an important class of nonconvex optimisation problems that are currently the subject of considerable research as regards the development of computational algorithms. In this paper, we show that mathematical programs of this nature are, in fact, a special case of more general signomial programming, which in turn implies that research on this latter problem may be valuable in analysing and solving linear multiplicative programs. In particular, we use signomial programming duality theory to establish a dual program for a nonconvex linear multiplicative program. An interpretation of the dual variables is given.