We study a non-convex, nonlinear integer mathematical program with a linear constraint. This problem originates in finance and consists of selling a large predetermined quantity of a financial asset over a fixed time horizon, while maximizing the total proceeds. The selling price is modeled using a deterministic penalty function capturing the market's adverse reaction to the selling flow. From a complexity perspective, the problem is in NP. We first solve the problem exactly using dynamic programming and propose several heuristics that yield tight numerical lower bounds. We then reformulate the problem into an equivalent factorable form and derive a tight convex relaxation using McCormick inequalities. This relaxation is embedded within an adapted Branch & Bound algorithm to find the global optimum in finite time. Numerical experiments show that our methods outperform several widely used generic solvers (LocalSolver, Scip, Baron, Couenne, and Bonmin) for selected instances, but do not yield tight upper bounds, beyond small instances.

翻译：暂无翻译