Real-world LP problems often have some special structure, and mathematically, they follow from a certain model. In this chapter, we focus on three combinatorial problems that can be formulated using linear programming: the transportation problem, network flow problems, and the shortest path problem. We investigate, in particular, the optimal value function, for which we can derive stronger results than for general interval LP problems.