Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have a question regarding feasibility checking. I need to check whether the system $\{ x: Ax=b , x \geq 0 \}$ has a feasible solution.

1- What is the best worst case running time for this decision problem if it is considered as an LP?

2- Is it possible to decide the feasibility using Gauss-Elimination method or some other methods like this?

Note, however, that the entries of the matrix $A$ can be rational.

share|improve this question

Your Answer


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

Browse other questions tagged or ask your own question.