Tell me more ×
Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It's 100% free, no registration required.
up vote 0 down vote favorite

Consider the min-cost flow problem. How can the feasibility of this problem be checked without solving the LP from scratch?

share|improve this question
You need to solve the phase 1 problem. There is no way around that, unless you have special structure that lets you guess a feasible solution. – Arnold Neumaier Jul 20 '12 at 10:31

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.