Share
Explore BrainMass

# Big-M Method

Consider the following algorithm for solving a linear program in standard form without having to use the Big-M method:
Choose any basis.
Check to see if this basis is primal feasible.
If so, use this as your initial BFS and solve the problem with simplex.
If the basis is primal infeasible, solve the problem using dual simplex

a) How would you find a basis to start this algorithm?

b) How would you check to see if this basis is primal feasible?

c) Do you think this algorithm will work? Why or why not?

#### Solution Preview

I would like to suggest you to use the book of "Linear programming and network flows" by Mokhtar bazaraa and .. .
This is a valuable book that will lead you to a deep knowledge of Lp.

a) for solving the primal for choosing the incoming variable you will chose it among the ...

#### Solution Summary

This solution is comprised of a detailed explanation to answer
a) How would you find a basis to start this algorithm?

b) How would you check to see if this basis is primal feasible?

c) Do you think this algorithm will work? Why or why not?

\$2.19