@@ -56,11 +56,11 @@ function SimplexProblem()::SimplexProblem
5656 Int[], # Slack indices
5757 Int[], # Surplus indices
5858 Int[], # Artificial indices
59- Int[], # Basic variables
60- - Inf64 , # Biggest value for M - Method
61- false , # is it in standard form?
62- false , # Converged?
63- 0.0 , # Objective Value
59+ Int[], # Basic variables
60+ - Inf64 , # Biggest value for M - Method
61+ false , # is it in standard form?
62+ false , # Converged?
63+ 0.0 , # Objective Value
6464 )
6565end
6666
@@ -444,7 +444,7 @@ function simplexiterations(s::SimplexProblem)::Vector{SimplexProblem}
444444 return iterations
445445end
446446
447- function simplexpretty (s:: SimplexProblem ; maxiter:: Int = 1000 ):: Nothing
447+ function simplexpretty (s:: SimplexProblem ; maxiter:: Int = 1000 ):: Nothing
448448
449449 copied:: SimplexProblem = copy (s)
450450
@@ -573,16 +573,16 @@ julia> invA = gaussjordan(A, verbose = false)
573573 1.0 -2.0 1.0
574574```
575575"""
576- function gaussjordan (A:: Matrix{Float64} ; verbose:: Bool = true ):: Matrix{Float64}
576+ function gaussjordan (A:: Matrix{Float64} ; verbose:: Bool = true ):: Matrix{Float64}
577577 n, p = size (A)
578- b = zeros (Float64,n, n)
578+ b = zeros (Float64, n, n)
579579 for i in 1 : n
580580 b[i, i] = 1.0
581581 end
582582 Z = Float64[A b]
583- @inbounds @fastmath @ simd for i in 1 : n
584- @fastmath @ simd for j in 1 : n
585- if i != j
583+ @inbounds @simd for i in 1 : n
584+ @simd for j in 1 : n
585+ if i != j
586586 Z[j, :] .= view (Z, j, :) .- (Z[j, i] / Z[i, i]) .* view (Z, i, :)
587587 else
588588 Z[j, :] .= (1.0 / Z[i, j]) .* view (Z, j, :)
0 commit comments