On Parametric Linear Programming Duality

Recognizing the strength of parametric optimization to model uncertainty, we extend the classical linear programming duality theory to a parametric setting. For linear programs with parameters in general locations, we prove parametric weak and strong duality theorems and parametric complementary slackness theorems. ArticleDownload

An exact approach for the Train Single-Routing Selection Problem

Given a set of train routes with route costs and a set of compatible route pairs with pairing costs, the Train Single-Routing Selection Problem (TSRSP) seeks to assign one route to each train, minimizing the total cost while ensuring pairwise compatibility among the selected routes. This problem is of significant practical relevance in rail traffic … Read more