Quieter non-versbose runnning

Author: scheinerman

development/examples.jl

@@ -24,6 +24,11 @@ function peanut_butter()
     return -A, -b, -c
 end
 
+"""
+    fishkind4()
+
+DEF's example for chapter 4.
+"""
 function fishkind4()
     A = [2 1 0 9 -1; 1 1 -1 5 1]
     b = [9; 7]

src/Bases.jl

@@ -33,15 +33,17 @@ end
 
 Return a feasible basis for the LP in `T` or `nothing` if none exists.
 """
-function find_a_basis(T::Tableau)
+function find_a_basis(T::Tableau, verbose::Bool=true)
     TT = _phase_one_tableau(T)
     n = T.n_vars
     m = T.n_cons
 
     simplex_solve!(TT, false)
     v = value(TT)
     if v>0
-        @info "No basis found."
+        if verbose
+            @info "No basis found."
+        end
         return 0*get_basis(TT)
     end
 

src/SimplexTableaux.jl

@@ -11,10 +11,6 @@ using PrettyTables
 import Base: show
 import LatexPrint: latex_form
 
-# function __init__()
-#     LatexPrint.set_slash()
-# end
-
 include("Exact.jl")
 
 export Tableau,

src/Solver.jl

@@ -86,9 +86,11 @@ Solve `T` using the simplex method.
 """
 function simplex_solve!(T::Tableau, verbose::Bool=true)
     if 0 ∈ T.B
-        B = find_a_basis(T)
+        B = find_a_basis(T, verbose)
         if 0 ∈ B
-            @info "This linear program is infeasible."
+            if verbose
+                @info "This linear program is infeasible."
+            end
             return nothing
         end
         if verbose
@@ -107,7 +109,9 @@ function simplex_solve!(T::Tableau, verbose::Bool=true)
     while !is_optimal(T)
         p = find_pivot(T)
         if 0 ∈ p
-            @info "This linear program is unbounded"
+            if verbose
+                @info "This linear program is unbounded"
+            end
             return nothing
         end
         basis_pivot!(T, p...)