diff --git a/test/MathProgBase/large_coefficients.jl b/test/MathProgBase/large_coefficients.jl
index 2bcdc6b4..06f8d510 100644
--- a/test/MathProgBase/large_coefficients.jl
+++ b/test/MathProgBase/large_coefficients.jl
@@ -6,7 +6,7 @@ using Gurobi, MathProgBase, Base.Test
         # Min   1.1e100x
         #       x >= 1
         m = MathProgBase.LinearQuadraticModel(GurobiSolver())
-        MathProgBase.loadproblem!(m, Array(Float64, (0, 1)), [1],[Inf], [1.1e100], Float64[], Float64[], :Min)
+        MathProgBase.loadproblem!(m, Array{Float64}(0, 1), [1],[Inf], [1.1e100], Float64[], Float64[], :Min)
         MathProgBase.optimize!(m)
         @test MathProgBase.getsolution(m) == [1.0]
         @test MathProgBase.getobjval(m) == 1e100
@@ -14,7 +14,7 @@ using Gurobi, MathProgBase, Base.Test
         # Max   -1.1e100x
         #       x >= 1
         m = MathProgBase.LinearQuadraticModel(GurobiSolver())
-        MathProgBase.loadproblem!(m, Array(Float64, (0, 1)), [1],[Inf], [-1.1e100], Float64[], Float64[], :Max)
+        MathProgBase.loadproblem!(m, Array{Float64}(0, 1), [1],[Inf], [-1.1e100], Float64[], Float64[], :Max)
         MathProgBase.optimize!(m)
         @test MathProgBase.getsolution(m) == [1.0]
         @test MathProgBase.getobjval(m) == -1e100
@@ -24,28 +24,28 @@ using Gurobi, MathProgBase, Base.Test
         # Min   x
         #       x >= 1.1e30
         m = MathProgBase.LinearQuadraticModel(GurobiSolver())
-        MathProgBase.loadproblem!(m, Array(Float64, (0, 1)), [1.1e30],[Inf], [1], Float64[], Float64[], :Min)
+        MathProgBase.loadproblem!(m, Array{Float64}(0, 1), [1.1e30],[Inf], [1], Float64[], Float64[], :Min)
         MathProgBase.optimize!(m)
         @test MathProgBase.status(m) == :Infeasible
 
         # Max   x
         #       x <= -1.1e30
         m = MathProgBase.LinearQuadraticModel(GurobiSolver())
-        MathProgBase.loadproblem!(m, Array(Float64, (0, 1)), [-Inf],[-1.1e30], [1], Float64[], Float64[], :Max)
+        MathProgBase.loadproblem!(m, Array{Float64}(0, 1), [-Inf],[-1.1e30], [1], Float64[], Float64[], :Max)
         MathProgBase.optimize!(m)
         @test MathProgBase.status(m) == :Infeasible
 
         # Min   x
         #       x >= -1.1e30
         m = MathProgBase.LinearQuadraticModel(GurobiSolver())
-        MathProgBase.loadproblem!(m, Array(Float64, (0, 1)), [-1.1e30],[Inf], [1], Float64[], Float64[], :Min)
+        MathProgBase.loadproblem!(m, Array{Float64}(0, 1), [-1.1e30],[Inf], [1], Float64[], Float64[], :Min)
         MathProgBase.optimize!(m)
         @test MathProgBase.status(m) == :Unbounded
 
         # Max   x
         #       x <= 1.1e30
         m = MathProgBase.LinearQuadraticModel(GurobiSolver())
-        MathProgBase.loadproblem!(m, Array(Float64, (0, 1)), [-Inf],[1.1e30], [1], Float64[], Float64[], :Max)
+        MathProgBase.loadproblem!(m, Array{Float64}(0, 1), [-Inf],[1.1e30], [1], Float64[], Float64[], :Max)
         MathProgBase.optimize!(m)
         @test MathProgBase.status(m) == :Unbounded