The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

168 CHAPTER 13. THE ANALYZERS
Supply Demand
200
Plant 1
1
2
Store 1
1100
1000
Plant 2
1
Store 2
200
5
Store 3
500
1000
Plant 3
2
1
2
Store 4
500
Figure 13.1: Supply, demand and cost of transportation.
Furthermore, chapter 14 contains a discussion on a specific method for repairing infeasibility problems
where infeasibilities are caused by model parameters rather than errors in the model or the
implementation.
13.2.1 Example: Primal infeasibility
A problem is said to be primal infeasible if no solution exists that satisfy all the constraints of the
problem.
As an example of a primal infeasible problem consider the problem of minimizing the cost of transportation
between a number of production plants and stores: Each plant produces a fixed number of
goods, and each store has a fixed demand that must be met. Supply, demand and cost of transportation
per unit are given in figure 13.1. The problem represented in figure 13.1 is infeasible, since the
total demand
exceeds the total supply
2300 = 1100 + 200 + 500 + 500