We consider the problem of valuing European options in a complete market but with incomplete data. Typically, when the underlying asset dynamics is not specified, the martingale probability measure is unknown. Given a consensus on the actual distribution of the underlying price at maturity, we...

We consider the problem of valuing European options in a complete market but with incomplete data. Typically, when the underlying asset dynamics is not specified, the martingale probability measure is unknown. Given a consensus on the actual distribution of the underlying price at maturity, we...

The sales force deployment problem arises in many selling organizations. This complex planning problem involves the concurrent resolution of four interrelated subproblems: sizing of the sales force, sales representatives locations, sales territory alignment, and sales resource allocation. The...

This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation methods. We first recall two SDP relaxation methods for solving polynomial optimization problems with finitely many constraints. Then we propose an exchange algorithm with SDP...

The second-order cone program (SOCP) is an optimization problem with second-order cone (SOC) constraints and has achieved notable developments in the last decade. The classical semi-infinite program (SIP) is represented with infinitely many inequality constraints, and has been studied...