first demonstration of very basic linprog routine.
renamed function to linprog.  Currently accepts only upper-bound constraints.
linprog is now working with both upper and lower bound constraints.
Equality constraints work.  Started modifying documentation and interfaces to comply with Scipy.
pep8 compliant
have begun test suite and scipy integration
Constraints with negative RHS now have their side switched, and inequality constraints flip to the opposite inequality type
Reworked return codes so that 0 is the only one signifying success.
Merged mainline scipy repo.  More updates to allow negative finite bounds on variables.  Still working on unbound variables.  Updated pep8 compliance.
Success with a problem with both negative finite bounds and unbounded variables.
Minor documentation updates.
Example of use added to docstring for linprog.
reworking linprog simplex method such that we always start with artificial variables
Simplifying the _linprog_simplex routine which constructs a tableau for the simplex solver.  Now the two-phase simplex method is always run.  Added a top-level linprog interface routine.
Cleaning up.  pep8, etc.
Removed objtype from linprog.  Now linprog will always minimize dot(c,x).
Added show_options for linprog.  Removed lower-bound constraints in favor of using upper-bound constraints with negative values.
simplification of the simplex iteration routined.  renamed to _lpsimplex.  need to find a new way of detecting cycling
Minimized the number of artificial variables used.
Implemented blands rule for avoiding cycling