solve_network_flow: Solve a network flow problem.
In match2C: Match One Sample using Two Criteria
View source: R/solve_network_flow.R
solve_network_flow R Documentation
Solve a network flow problem.
Description
This function solves network flow optimization problems
by calling the RELAX-IV algorithm implemented in FORTRAN
by Dimitri Bertsekas and Paul Tseng, and made available by
Sam Pimentel in the package rcbalance.
Usage
solve_network_flow(net)
Arguments
net
A list of five vectors: startn, endn, ucap, cost, b.
Details
This function is of limited interest to users.
Value
If the problem is feasible, function returns a list with the following elements:
crash: an integer, equal to zero if the algorithm ran correctly and equal to 1 if it crashed.
feasible: an integer, equal to zero if the problem is not feasible.
x: a vector equal in length to the number of arcs in argument problem net,
giving in each coordinate the number of units of flow passing across the
corresponding edge in the optimal network flow.
If the problem is not feasible, it returns "Not feasible."
match2C documentation built on March 31, 2023, 6:39 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
View source: R/solve_network_flow.R
| solve_network_flow | R Documentation |
Solve a network flow problem.
Description
This function solves network flow optimization problems by calling the RELAX-IV algorithm implemented in FORTRAN by Dimitri Bertsekas and Paul Tseng, and made available by Sam Pimentel in the package rcbalance.
Usage
solve_network_flow(net)
Arguments
net |
A list of five vectors: startn, endn, ucap, cost, b. |
Details
This function is of limited interest to users.
Value
If the problem is feasible, function returns a list with the following elements: crash: an integer, equal to zero if the algorithm ran correctly and equal to 1 if it crashed. feasible: an integer, equal to zero if the problem is not feasible. x: a vector equal in length to the number of arcs in argument problem net, giving in each coordinate the number of units of flow passing across the corresponding edge in the optimal network flow. If the problem is not feasible, it returns "Not feasible."
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.