Line: 1 to 1 | ||||||||
---|---|---|---|---|---|---|---|---|
| ||||||||
Line: 78 to 78 | ||||||||
Naturally Integer Solutions | ||||||||
Changed: | ||||||||
< < | The transportation problem is often an integer programme as the quantity of good delivered along the arcs must be integer. However, if the supply, demand and variable bounds are integer, then the transportation problem will have naturally integer solutions. This means that any solution found using linear programming will have integer values. This is a property that is common to other network optimisation problems, e.g., TransshipmentProblem[the transshipment problem.]] | |||||||
> > | The transportation problem is often an integer programme as the quantity of good delivered along the arcs must be integer. However, if the supply, demand and variable bounds are integer, then the transportation problem will have naturally integer solutions. This means that any solution found using linear programming will have integer values. This is a property that is common to other network optimisation problems, e.g., the transshipment problem. | |||||||
Solving the Transportation Problem with OR Software | ||||||||
Line: 86 to 86 | ||||||||
To see examples of transportation problems, check out some of the transportation problem case studies: %SEARCH{ | ||||||||
Changed: | ||||||||
< < | "[O]perationsResearchTopics.*value\=.*[Transportation]Problem" | |||||||
> > | "[O]perationsResearchTopics.*value\=.*[T]ransportationProblem" | |||||||
type="regex" casesensitive="on" nosearch="on" |