Level set algorithm for solving convex multiplicative programming problems

摘要

Multiplicative programming problems arise in many fields such as engineering, finance, economics and other fields. Globality of solutions for these problems is difficult; hence in this paper the globality of the mutiplicative programming problem is discussed by the level set concept. At the end of this paper, an algorithm for solving these kinds of problems is presented.