Browsing by Subject "Mixed-integer Programming"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access An integer programming model for pricing American contingent claims under transaction costs(2012) Pınar, M. Ç.; Camcı, A.We study the problem of computing the lower hedging price of an American contingent claim in a finite-state discrete-time market setting under proportional transaction costs. We derive a new mixed-integer linear programming formulation for calculating the lower hedging price. The linear programming relaxation of the formulation is exact in frictionless markets. Our results imply that it might be optimal for the holder of several identical American claims to exercise portions of the portfolio at different time points in the presence of proportional transaction costs while this incentive disappears in their absence.Item Open Access Relaxations for two-level multi-item lot-sizing problems(Springer, 2014-08) Vyve, M. V.; Wolsey, L. A.; Yaman, H.We consider several variants of the two-level lot-sizing problem with one item at the upper level facing dependent demand, and multiple items or clients at the lower level, facing independent demands. We first show that under a natural cost assumption, it is sufficient to optimize over a stock-dominant relaxation. We further study the polyhedral structure of a strong relaxation of this problem involving only initial inventory variables and setup variables. We consider several variants: uncapacitated at both levels with or without start-up costs, uncapacitated at the upper level and constant capacity at the lower level, constant capacity at both levels. We finally demonstrate how the strong formulations described improve our ability to solve instances with up to several dozens of periods and a few hundred products.