Читать книгу Multi-parametric Optimization and Control - Efstratios N. Pistikopoulos - Страница 74

In reality, the data in Table 2.1 is time‐varying. Thus, the case of demand uncertainty is considered:

Given a set of plants with a constant supply and a set of markets with an uncertain demand bound between 0 and 1000 cases, and the distances between and , minimize the total transportation cost as a function of the demand.

Based on the LP problem (2.18), the following mp‐LP problem is formulated:

(2.20)

Note that the objective function does not change as the distances between the destinations do not change. However on the contrary to problem (2.18), problem (2.20) now features the uncertain demands as parameters bound between 0 and 1000. The solution of problem (2.20) is reported in Table 2.3, which was obtained based on the solution strategies presented in Chapter 4.