Multiplicative programming problems are characterised by objective functions or constraints that involve products of decision variables, giving rise to nonconvex landscapes with multiple local optima.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results