An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2022

An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem

Abstract

In this article, we address a class of non convex, integer, non linear mathematical programs using dynamic programming. The mathematical program considered may be used to model the optimal liquidation problem of a single asset portfolio. We show the problem can be solved exactly using Dynamic Programming (DP) in polynomial time. We also introduce dedicated heuristics and provide very thin admissible solutions, for medium sized and large instances (for which exact resolution is not efficient). We also derive an upper bound which however is not tight. Lastly, we benchmark our results against a commercial solver, such as LocalSolver.

Dates and versions

hal-04495072 , version 1 (08-03-2024)

Identifiers

Cite

David Nizard, Nicolas Dupin, Dominique Quadri. An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem. 2022 8th International Conference on Control, Decision and Information Technologies (CoDIT), May 2022, Istanbul, France. pp.146-151, ⟨10.1109/CoDIT55151.2022.9804160⟩. ⟨hal-04495072⟩
12 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More