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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results