We study a class of nonlinear optimization problems with diverse practical applications, particularly in cooperative game theory. These problems are referred to as Maximum Multiplicative Programs (MMPs), and can be conceived as instances of “Optimization Over the Frontier” in multiobjective optimization. To solve MMPs, we introduce a feasibility pump-based heuristic that is specifically designed to search the criterion space of their multi-objective optimization counterparts. Through a computational study, we show the efficacy of the proposed method.
Article
View A Criterion Space Search Feasibility Pump Heuristic for Solving Maximum Multiplicative Programs