diff --git a/src/math/lp/lp_core_solver_base.h b/src/math/lp/lp_core_solver_base.h
index 673ef240441..5cde4485d00 100644
--- a/src/math/lp/lp_core_solver_base.h
+++ b/src/math/lp/lp_core_solver_base.h
@@ -74,9 +74,9 @@ class lp_core_solver_base {
     vector<X> &           m_x; // a feasible solution, the fist time set in the constructor
     vector<T> &           m_costs;
     lp_settings &         m_settings;
+    lu<static_matrix<T, X>> * m_factorization = nullptr;
     vector<T>             m_y; // the buffer for yB = cb
     // a device that is able to solve Bx=c, xB=d, and change the basis
-    lu<static_matrix<T, X>> *            m_factorization;
     const column_namer &  m_column_names;
     indexed_vector<T>     m_w; // the vector featuring in 24.3 of the Chvatal book
     vector<T>             m_d; // the vector of reduced costs
diff --git a/src/math/lp/lp_core_solver_base_def.h b/src/math/lp/lp_core_solver_base_def.h
index c1b64492b62..f85de111128 100644
--- a/src/math/lp/lp_core_solver_base_def.h
+++ b/src/math/lp/lp_core_solver_base_def.h
@@ -55,7 +55,6 @@ lp_core_solver_base(static_matrix<T, X> & A,
     m_costs(costs),
     m_settings(settings),
     m_y(m_m()),
-    m_factorization(nullptr),
     m_column_names(column_names),
     m_w(m_m()),
     m_d(m_n()),