the problem is below:
Consider a linear program max{cx: Ax < b} where all entries of A are – 1, 0, or 1, and each column of A contains at most one 1 and at most one -1. Show that such an LP is equivalent to an instance of the MiNIMUM COST FLOW PROBLEM.
when i try to convert this LP into min cost flow problem, i got confused how can i determine capacities of the edge
New contributor
Yichen Gao is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.