All references mentioned in Class 2 use linear goal programming (GP ... It seems most practical to let the model run for, for example, λ∈{0;0.1;…;1} and then judge the resulting diets ...

The approach appends slack, surplus, and artificial variables to the model where needed ... The following example shows how to find the minimum cost flow through a network using linear programming.