Interface to lp_solve linear/integer programming
system specifically for solving assignment problems
lp.assign (cost.mat, direction = "min", presolve = 0, compute.sens = 0)An lp object. See documentation for details. The constraints
are assumed (each row adds to 1, each column adds to 1, and no others) and
are not returned.
Matrix of costs: the ij-th element is the cost of assigning source i to destination j.
Character vector, length 1, containing either "min" (the default) or "max"
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." In that case presolving is attempted.
Sam Buttrey, buttrey@nps.edu
This is a particular integer programming problem. All the decision variables are assumed to be integers; each row has the constraint that its entries must add up to 1 (so that there is one 1 and the remaining entries are 0) and each column has the same constraint. This is assumed to be a minimization problem.
lp, lp.transport