Lagrange Multiplier Method for Multi-campaign Assignment Problem

It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when performing several personalized campaigns simultaneously. We formulate the multi-campaign assignment problem to solve this issue and propose methods for solving the problem. The most notable element is the Lagrange multiplier method. Roughly speaking, Lagrange multiplier reduces problem complexity with a minor impact on optimality. However, it is not easy to find Lagrange multipliers in exact accord with problem constraints. We use a genetic algorithm for finding optimal Lagrange multipliers. Through the experiments, we verify the effectiveness of the problem formulation and our genetic approach.

• Type: Conference
• Year: 2004
• Where: GECCO
• Authors: Yong-Hyuk Kim, Byung Ro Moon
• Keywords: GECCO 2004, Lagrange Multiplier Method, Lagrange Multipliers, Multiple Recommendation Problem