Interface to lp_solve linear/integer programming
system specifically for solving transportation problems
lp.transport (cost.mat, direction="min", row.signs, row.rhs, col.signs,
col.rhs, presolve=0, compute.sens=0, integers = 1:(nc*nr) )An lp object. Constraints are implicit and not returned.
See documentation for details.
Matrix of costs; ij-th element is the cost of transporting one item from source i to destination j.
Character, length 1: "min" or "max"
Vector of character strings giving the direction of the row constraints: each value should be one of "<," "<=," "=," "==," ">," or ">=." (In each pair the two values are identical.)
Vector of numeric values for the right-hand sides of the row constraints.
Vector of character strings giving the direction of the column constraints: each value should be one of "<," "<=," "=," "==," ">," or ">=."
Vector of numeric values for the right-hand sides of the column constraints.
Numeric: presolve? Default 0 (no); any non-zero value means "yes." Currently ignored.
Numeric: compute sensitivity? Default 0 (no); any non-zero value means "yes."
Vector of integers whose ith element gives the index of the ith integer variable. Its length will be the number of integer variables. Default: all variables are integer. Set to NULL to have no variables be integer.
Sam Buttrey, buttrey@nps.edu
This is a particular integer programming problem. All the decision variables are assumed to be integers, and there is one constraint per row and one per column (and no others). This is assumed to be a minimization problem.
Example problem from Bronson (1981), Operations Research, Scahum's Outline Series, McGraw-Hill.
lp.assign, lp.transport