PuLP 3.2.2__tar.gz → 3.3.1__tar.gz

pulp-3.3.1/LICENSE

@@ -0,0 +1,22 @@
+Copyright (c) 2002-2005, Jean-Sebastien Roy
+Modifications Copyright (c) 2007- Stuart Anthony Mitchell
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be included
+in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+

{pulp-3.2.2 → pulp-3.3.1}/PKG-INFO

@@ -1,31 +1,46 @@
 Metadata-Version: 2.4
 Name: PuLP
-Version: 3.2.2
+Version: 3.3.1
 Summary: PuLP is an LP modeler written in python. PuLP can generate MPS or LP files and call GLPK, COIN CLP/CBC, CPLEX, and GUROBI to solve linear problems.
 Author: J.S. Roy
 Author-email: "S.A. Mitchell" <pulp@stuartmitchell.com>, Franco Peschiera <pchtsp@gmail.com>
 Maintainer-email: Franco Peschiera <pchtsp@gmail.com>
-License: MIT
+License-Expression: MIT
 Project-URL: source, https://github.com/coin-or/pulp
 Project-URL: download, https://github.com/coin-or/pulp/archive/master.zip
 Keywords: Optimization,Linear Programming,Operations Research
 Classifier: Development Status :: 5 - Production/Stable
 Classifier: Environment :: Console
 Classifier: Intended Audience :: Science/Research
-Classifier: License :: OSI Approved :: MIT License
 Classifier: Natural Language :: English
 Classifier: Programming Language :: Python
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: >=3.9
 Description-Content-Type: text/x-rst
+License-File: LICENSE
 Provides-Extra: open-py
-Requires-Dist: cylp; sys_platform != "win32" and extra == "open-py"
-Requires-Dist: highspy; extra == "open-py"
+Requires-Dist: highspy==1.13; extra == "open-py"
 Requires-Dist: pyscipopt; extra == "open-py"
 Provides-Extra: public-py
 Requires-Dist: gurobipy; extra == "public-py"
 Requires-Dist: coptpy; extra == "public-py"
 Requires-Dist: xpress; extra == "public-py"
+Requires-Dist: cplex; (sys_platform != "darwin" or python_full_version < "3.12") and extra == "public-py"
+Provides-Extra: highs
+Requires-Dist: highspy==1.13; extra == "highs"
+Provides-Extra: scip
+Requires-Dist: pyscipopt; extra == "scip"
+Provides-Extra: gurobi
+Requires-Dist: gurobipy; extra == "gurobi"
+Provides-Extra: xpress
+Requires-Dist: xpress; extra == "xpress"
+Provides-Extra: copt
+Requires-Dist: coptpy; extra == "copt"
+Provides-Extra: cplex
+Requires-Dist: cplex; (sys_platform != "darwin" or python_full_version < "3.12") and extra == "cplex"
+Provides-Extra: mosek
+Requires-Dist: mosek; extra == "mosek"
+Dynamic: license-file
 
 pulp
 **************************
@@ -56,22 +71,34 @@ The easiest way to install PuLP is with ``pip``. If ``pip`` is available on your
 
 Otherwise follow the download instructions on the `PyPi page <https://pypi.python.org/pypi/PuLP>`_.
 
+Installing solvers
+----------------------
 
-Quickstart 
-===============
+PuLP can use a variety of solvers. The default solver is the COIN-OR CBC solver, which is included with PuLP. If you want to use other solvers, PuLP offers a quick way to install most solvers via their pypi package (some require a commercial license for running or for running large models)::
 
-Use ``LpVariable`` to create new variables. To create a variable x with 0  ≤  x  ≤  3::
+    python -m pip install pulp[gurobi]
+    python -m pip install pulp[cplex]
+    python -m pip install pulp[xpress]
+    python -m pip install pulp[scip]
+    python -m pip install pulp[highs]
+    python -m pip install pulp[copt]
+    python -m pip install pulp[mosek]
 
-     from pulp import *
-     x = LpVariable("x", 0, 3)
 
-To create a binary variable, y, with values either 0 or 1::
+If you want to install all open source solvers (scip, highs, cylp), you can use the shortcut::
+    python -m pip install pulp[open_py]
 
-     y = LpVariable("y", cat="Binary")
+For more information on how to install solvers, see the `guide on configuring solvers <https://coin-or.github.io/pulp/guides/how_to_configure_solvers.html>`_.
 
-Use ``LpProblem`` to create new problems. Create a problem called "myProblem" like so::
+Quickstart 
+===============
+
+Create a problem first, then add variables with ``add_variable`` (variables are owned by the model). To create a variable ``x`` with 0  ≤  x  ≤  3 and a binary variable ``y``::
 
+     from pulp import *
      prob = LpProblem("myProblem", LpMinimize)
+     x = prob.add_variable("x", 0, 3)
+     y = prob.add_variable("y", cat="Binary")
 
 Combine variables in order to create expressions and constraints, and then add them to the problem.::
 

{pulp-3.2.2 → pulp-3.3.1}/PuLP.egg-info/PKG-INFO

@@ -1,31 +1,46 @@
 Metadata-Version: 2.4
 Name: PuLP
-Version: 3.2.2
+Version: 3.3.1
 Summary: PuLP is an LP modeler written in python. PuLP can generate MPS or LP files and call GLPK, COIN CLP/CBC, CPLEX, and GUROBI to solve linear problems.
 Author: J.S. Roy
 Author-email: "S.A. Mitchell" <pulp@stuartmitchell.com>, Franco Peschiera <pchtsp@gmail.com>
 Maintainer-email: Franco Peschiera <pchtsp@gmail.com>
-License: MIT
+License-Expression: MIT
 Project-URL: source, https://github.com/coin-or/pulp
 Project-URL: download, https://github.com/coin-or/pulp/archive/master.zip
 Keywords: Optimization,Linear Programming,Operations Research
 Classifier: Development Status :: 5 - Production/Stable
 Classifier: Environment :: Console
 Classifier: Intended Audience :: Science/Research
-Classifier: License :: OSI Approved :: MIT License
 Classifier: Natural Language :: English
 Classifier: Programming Language :: Python
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: >=3.9
 Description-Content-Type: text/x-rst
+License-File: LICENSE
 Provides-Extra: open-py
-Requires-Dist: cylp; sys_platform != "win32" and extra == "open-py"
-Requires-Dist: highspy; extra == "open-py"
+Requires-Dist: highspy==1.13; extra == "open-py"
 Requires-Dist: pyscipopt; extra == "open-py"
 Provides-Extra: public-py
 Requires-Dist: gurobipy; extra == "public-py"
 Requires-Dist: coptpy; extra == "public-py"
 Requires-Dist: xpress; extra == "public-py"
+Requires-Dist: cplex; (sys_platform != "darwin" or python_full_version < "3.12") and extra == "public-py"
+Provides-Extra: highs
+Requires-Dist: highspy==1.13; extra == "highs"
+Provides-Extra: scip
+Requires-Dist: pyscipopt; extra == "scip"
+Provides-Extra: gurobi
+Requires-Dist: gurobipy; extra == "gurobi"
+Provides-Extra: xpress
+Requires-Dist: xpress; extra == "xpress"
+Provides-Extra: copt
+Requires-Dist: coptpy; extra == "copt"
+Provides-Extra: cplex
+Requires-Dist: cplex; (sys_platform != "darwin" or python_full_version < "3.12") and extra == "cplex"
+Provides-Extra: mosek
+Requires-Dist: mosek; extra == "mosek"
+Dynamic: license-file
 
 pulp
 **************************
@@ -56,22 +71,34 @@ The easiest way to install PuLP is with ``pip``. If ``pip`` is available on your
 
 Otherwise follow the download instructions on the `PyPi page <https://pypi.python.org/pypi/PuLP>`_.
 
+Installing solvers
+----------------------
 
-Quickstart 
-===============
+PuLP can use a variety of solvers. The default solver is the COIN-OR CBC solver, which is included with PuLP. If you want to use other solvers, PuLP offers a quick way to install most solvers via their pypi package (some require a commercial license for running or for running large models)::
 
-Use ``LpVariable`` to create new variables. To create a variable x with 0  ≤  x  ≤  3::
+    python -m pip install pulp[gurobi]
+    python -m pip install pulp[cplex]
+    python -m pip install pulp[xpress]
+    python -m pip install pulp[scip]
+    python -m pip install pulp[highs]
+    python -m pip install pulp[copt]
+    python -m pip install pulp[mosek]
 
-     from pulp import *
-     x = LpVariable("x", 0, 3)
 
-To create a binary variable, y, with values either 0 or 1::
+If you want to install all open source solvers (scip, highs, cylp), you can use the shortcut::
+    python -m pip install pulp[open_py]
 
-     y = LpVariable("y", cat="Binary")
+For more information on how to install solvers, see the `guide on configuring solvers <https://coin-or.github.io/pulp/guides/how_to_configure_solvers.html>`_.
 
-Use ``LpProblem`` to create new problems. Create a problem called "myProblem" like so::
+Quickstart 
+===============
+
+Create a problem first, then add variables with ``add_variable`` (variables are owned by the model). To create a variable ``x`` with 0  ≤  x  ≤  3 and a binary variable ``y``::
 
+     from pulp import *
      prob = LpProblem("myProblem", LpMinimize)
+     x = prob.add_variable("x", 0, 3)
+     y = prob.add_variable("y", cat="Binary")
 
 Combine variables in order to create expressions and constraints, and then add them to the problem.::
 

{pulp-3.2.2 → pulp-3.3.1}/PuLP.egg-info/SOURCES.txt

@@ -1,3 +1,4 @@
+LICENSE
 README.rst
 pyproject.toml
 PuLP.egg-info/PKG-INFO

pulp-3.3.1/PuLP.egg-info/requires.txt

@@ -0,0 +1,35 @@
+
+[copt]
+coptpy
+
+[cplex]
+
+[cplex:sys_platform != "darwin" or python_full_version < "3.12"]
+cplex
+
+[gurobi]
+gurobipy
+
+[highs]
+highspy==1.13
+
+[mosek]
+mosek
+
+[open_py]
+highspy==1.13
+pyscipopt
+
+[public_py]
+gurobipy
+coptpy
+xpress
+
+[public_py:sys_platform != "darwin" or python_full_version < "3.12"]
+cplex
+
+[scip]
+pyscipopt
+
+[xpress]
+xpress

{pulp-3.2.2 → pulp-3.3.1}/README.rst

@@ -27,22 +27,34 @@ The easiest way to install PuLP is with ``pip``. If ``pip`` is available on your
 
 Otherwise follow the download instructions on the `PyPi page <https://pypi.python.org/pypi/PuLP>`_.
 
+Installing solvers
+----------------------
 
-Quickstart 
-===============
+PuLP can use a variety of solvers. The default solver is the COIN-OR CBC solver, which is included with PuLP. If you want to use other solvers, PuLP offers a quick way to install most solvers via their pypi package (some require a commercial license for running or for running large models)::
 
-Use ``LpVariable`` to create new variables. To create a variable x with 0  ≤  x  ≤  3::
+    python -m pip install pulp[gurobi]
+    python -m pip install pulp[cplex]
+    python -m pip install pulp[xpress]
+    python -m pip install pulp[scip]
+    python -m pip install pulp[highs]
+    python -m pip install pulp[copt]
+    python -m pip install pulp[mosek]
 
-     from pulp import *
-     x = LpVariable("x", 0, 3)
 
-To create a binary variable, y, with values either 0 or 1::
+If you want to install all open source solvers (scip, highs, cylp), you can use the shortcut::
+    python -m pip install pulp[open_py]
 
-     y = LpVariable("y", cat="Binary")
+For more information on how to install solvers, see the `guide on configuring solvers <https://coin-or.github.io/pulp/guides/how_to_configure_solvers.html>`_.
 
-Use ``LpProblem`` to create new problems. Create a problem called "myProblem" like so::
+Quickstart 
+===============
+
+Create a problem first, then add variables with ``add_variable`` (variables are owned by the model). To create a variable ``x`` with 0  ≤  x  ≤  3 and a binary variable ``y``::
 
+     from pulp import *
      prob = LpProblem("myProblem", LpMinimize)
+     x = prob.add_variable("x", 0, 3)
+     y = prob.add_variable("y", cat="Binary")
 
 Combine variables in order to create expressions and constraints, and then add them to the problem.::
 

{pulp-3.2.2 → pulp-3.3.1}/pulp/__init__.py

@@ -29,13 +29,37 @@ Module file that imports all of the pulp functions
 
 Copyright 2007- Stuart Mitchell (s.mitchell@auckland.ac.nz)
 """
+
+# Pre-load highspy's C extension with RTLD_GLOBAL before any other imports.
+# highspy._core uses C++ exception handling (__cxa_throw etc.) that must be globally
+# visible when pulp._rustcore (a Rust/pyo3 extension) is later loaded into the same
+# process. Without RTLD_GLOBAL, the C++ runtime state gets split across multiple
+# symbol scopes, causing a segfault when highspy.Highs.run() is called.
+# We use find_spec("highspy") (the package) not find_spec("highspy._core") (the
+# submodule) to avoid triggering highspy/__init__.py which would import _core with
+# RTLD_LOCAL before our explicit RTLD_GLOBAL call can take effect.
+try:
+    import ctypes as _ctypes
+    import glob as _glob
+    import importlib.util as _ilu
+
+    _pkg_spec = _ilu.find_spec("highspy")
+    if _pkg_spec is not None and _pkg_spec.submodule_search_locations:
+        for _loc in _pkg_spec.submodule_search_locations:
+            for _so in _glob.glob(_loc + "/_core*.so"):
+                _ctypes.CDLL(_so, _ctypes.RTLD_GLOBAL)
+                break
+    del _ctypes, _glob, _ilu, _pkg_spec
+except Exception:
+    pass
+
+
 from .constants import VERSION
 
 from .pulp import *
 from .apis import *
 from .utilities import *
 from .constants import *
-from .tests import pulpTestAll
 
 __doc__ = pulp.__doc__  # type: ignore[name-defined]
 __version__ = VERSION

{pulp-3.2.2 → pulp-3.3.1}/pulp/apis/coin_api.py

@@ -108,6 +108,10 @@ class COIN_CMD(LpSolver_CMD):
         :param str timeMode: "elapsed": count wall-time to timeLimit; "cpu": count cpu-time
         :param int maxNodes: max number of nodes during branching. Stops the solving when reached.
         """
+        if warmStart and not keepFiles and operating_system == "win":
+            warnings.warn(
+                "When using CBC on Windows, warmStart requires keepFiles=True."
+            )
 
         LpSolver_CMD.__init__(
             self,
@@ -163,7 +167,7 @@ class COIN_CMD(LpSolver_CMD):
             vs = lp.writeLP(tmpLp)
             # In the Lp we do not create new variable or constraint names:
             variablesNames = {v.name: v.name for v in vs}
-            constraintsNames = {c: c for c in lp.constraints}
+            constraintsNames = {c: c for c in lp._constraints}
             cmds = " " + tmpLp + " "
         if self.optionsDict.get("warmStart", False):
             self.writesol(tmpMst, lp, vs, variablesNames, constraintsNames)
@@ -319,7 +323,7 @@ class COIN_CMD(LpSolver_CMD):
         returns status, values, reducedCosts, shadowPrices, slacks, sol_status
         """
         variablesNames = {v.name: v.name for v in vs}
-        constraintsNames = {c: c for c in lp.constraints}
+        constraintsNames = {c: c for c in lp._constraints}
         return self.readsol_MPS(filename, lp, vs, variablesNames, constraintsNames)
 
     def get_status(self, filename):
@@ -754,7 +758,7 @@ class YAPOSIB(LpSolver):
                 var.varValue = var.solverVar.solution
                 var.dj = var.solverVar.reducedcost
             # put pi and slack variables against the constraints
-            for constr in lp.constraints.values():
+            for constr in lp._constraints.values():
                 constr.pi = constr.solverConstraint.dual
                 constr.slack = -constr.constant - constr.solverConstraint.activity
             if self.msg:
@@ -813,7 +817,7 @@ class YAPOSIB(LpSolver):
                 prob.obj[col.index] = lp.objective.get(var, 0.0)
                 var.solverVar = col
             log.debug("add the Constraints to the problem")
-            for name, constraint in lp.constraints.items():
+            for name, constraint in lp._constraints.items():
                 row = prob.rows.add(
                     yaposib.vec(
                         [
@@ -849,7 +853,7 @@ class YAPOSIB(LpSolver):
             solutionStatus = self.findSolutionValues(lp)
             for var in lp.variables():
                 var.modified = False
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 constraint.modified = False
             return solutionStatus
 
@@ -861,7 +865,7 @@ class YAPOSIB(LpSolver):
             constraints
             """
             log.debug("Resolve the model using yaposib")
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 row = constraint.solverConstraint
                 if constraint.modified:
                     if constraint.sense == constants.LpConstraintLE:
@@ -878,7 +882,7 @@ class YAPOSIB(LpSolver):
             solutionStatus = self.findSolutionValues(lp)
             for var in lp.variables():
                 var.modified = False
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 constraint.modified = False
             return solutionStatus
 

{pulp-3.2.2 → pulp-3.3.1}/pulp/apis/copt_api.py

@@ -471,7 +471,7 @@ class COPT_DLL(LpSolver):
             """
             cols = list(lp.variables())
             ncol = len(cols)
-            nrow = len(lp.constraints)
+            nrow = len(lp._constraints)
 
             collb = (ctypes.c_double * ncol)()
             colub = (ctypes.c_double * ncol)()
@@ -525,9 +525,9 @@ class COPT_DLL(LpSolver):
 
             # Extract constraint rhs, senses and names
             idx = 0
-            for row in lp.constraints:
-                rowrhs[idx] = -lp.constraints[row].constant
-                rowsense[idx] = coptrsense[lp.constraints[row].sense]
+            for row in lp._constraints:
+                rowrhs[idx] = -lp._constraints[row].constant
+                rowsense[idx] = coptrsense[lp._constraints[row].sense]
                 rowname[idx] = coptstr(row)
 
                 self.c2n[row] = idx
@@ -946,7 +946,7 @@ class COPT(LpSolver):
             if not model.ismip:
                 # NOTE: slacks in COPT are activities of rows
                 slacks = model.getInfo("Slack", model.getConstrs())
-                for constr, value in zip(lp.constraints.values(), slacks):
+                for constr, value in zip(lp._constraints.values(), slacks):
                     constr.slack = value
 
                 redcosts = model.getInfo("RedCost", model.getVars())
@@ -954,7 +954,7 @@ class COPT(LpSolver):
                     var.dj = value
 
                 duals = model.getInfo("Dual", model.getConstrs())
-                for constr, value in zip(lp.constraints.values(), duals):
+                for constr, value in zip(lp._constraints.values(), duals):
                     constr.pi = value
 
             return status
@@ -1013,7 +1013,7 @@ class COPT(LpSolver):
                         self.coptmdl.setMipStart(var.solverVar, var.varValue)
                 self.coptmdl.loadMipStart()
 
-            for name, constraint in lp.constraints.items():
+            for name, constraint in lp._constraints.items():
                 expr = coptpy.LinExpr(
                     [v.solverVar for v in constraint.keys()], list(constraint.values())
                 )
@@ -1042,7 +1042,7 @@ class COPT(LpSolver):
             solutionStatus = self.findSolutionValues(lp)
             for var in lp._variables:
                 var.modified = False
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 constraint.modified = False
             return solutionStatus
 
@@ -1052,7 +1052,7 @@ class COPT(LpSolver):
 
             uses the old solver and modifies the rhs of the modified constraints
             """
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 if constraint.modified:
                     if constraint.sense == LpConstraintLE:
                         constraint.solverConstraint.ub = -constraint.constant
@@ -1067,6 +1067,6 @@ class COPT(LpSolver):
             solutionStatus = self.findSolutionValues(lp)
             for var in lp._variables:
                 var.modified = False
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 constraint.modified = False
             return solutionStatus

{pulp-3.2.2 → pulp-3.3.1}/pulp/apis/core.py

@@ -200,7 +200,7 @@ class LpSolver:
             else:
                 upperBounds[self.v2n[v]] = infBound
         # values for constraints
-        numRows = len(lp.constraints)
+        numRows = len(lp._constraints)
         NumRowDoubleArray = ctypes.c_double * numRows
         NumRowStrArray = ctypes.c_char_p * numRows
         NumRowCharArray = ctypes.c_char * numRows
@@ -211,12 +211,12 @@ class LpSolver:
         self.c2n = {}
         self.n2c = {}
         i = 0
-        for c in lp.constraints:
-            rhsValues[i] = -lp.constraints[c].constant
+        for c in lp._constraints:
+            rhsValues[i] = -lp._constraints[c].constant
             # for ranged constraints a<= constraint >=b
             rangeValues[i] = 0.0
             rowNames[i] = to_string(c)
-            rowType[i] = to_string(senseDict[lp.constraints[c].sense])
+            rowType[i] = to_string(senseDict[lp._constraints[c].sense])
             self.c2n[c] = i
             self.n2c[i] = c
             i = i + 1

{pulp-3.2.2 → pulp-3.3.1}/pulp/apis/cplex_api.py

@@ -1,6 +1,6 @@
 import os
 import warnings
-from typing import Iterable, Optional
+from typing import Any, Iterable, Optional
 
 from .. import constants
 from .core import LpSolver, LpSolver_CMD, PulpSolverError, clock, log, subprocess
@@ -240,6 +240,21 @@ class CPLEX_CMD(LpSolver_CMD):
         return True
 
 
+def check_solverModel(func):
+    """
+    Decorator that checks if the solverModel is initialized.
+
+    :raises PulpSolverError: If the ``solverModel`` attribute is not initialized
+    """
+
+    def wrapper(self, *args, **kwargs):
+        if self.solverModel is None:
+            raise PulpSolverError("solverModel not initialized")
+        return func(self, *args, **kwargs)
+
+    return wrapper
+
+
 class CPLEX_PY(LpSolver):
     """
     The CPLEX LP/MIP solver (via a Python Binding)
@@ -262,7 +277,11 @@ class CPLEX_PY(LpSolver):
             """True if the solver is available"""
             return False
 
-        def actualSolve(self, lp):
+        def actualSolve(
+            self,
+            lp: Any,
+            callback: Optional[Iterable[type[Any]]] = None,
+        ) -> Any:
             """Solve a well formulated lp problem"""
             raise PulpSolverError(f"CPLEX_PY: Not Available:\n{self.err}")
 
@@ -308,13 +327,18 @@ class CPLEX_PY(LpSolver):
                 logPath=logPath,
                 threads=threads,
             )
-            self.solverParams = solverParams
+            self.solver_params = solverParams
+            self.solverModel = None
 
         def available(self):
             """True if the solver is available"""
             return True
 
-        def actualSolve(self, lp, callback: Optional[Iterable[type[cplex.callbacks.Callback]]] = None):  # type: ignore[misc]
+        def actualSolve(
+            self,
+            lp: Any,
+            callback: Optional[Iterable[type[cplex.callbacks.Callback]]] = None,
+        ) -> Any:
             """
             Solve a well formulated lp problem
 
@@ -331,7 +355,7 @@ class CPLEX_PY(LpSolver):
             solutionStatus = self.findSolutionValues(lp)
             for var in lp._variables:
                 var.modified = False
-            for constraint in lp.constraints.values():
+            for constraint in lp._constraints.values():
                 constraint.modified = False
             return solutionStatus
 
@@ -390,8 +414,8 @@ class CPLEX_PY(LpSolver):
             rows = []
             senses = []
             rhs = []
-            rownames = list(lp.constraints.keys())
-            for constraint in lp.constraints.values():
+            rownames = list(lp._constraints.keys())
+            for constraint in lp._constraints.values():
                 # build the expression
                 if len(constraint) == 0:
                     # if the constraint is empty
@@ -444,7 +468,7 @@ class CPLEX_PY(LpSolver):
                 self.solverModel.MIP_starts.add(
                     cplex.SparsePair(ind=ind, val=val), effort, "1"
                 )
-            for param, value in self.solverParams.items():
+            for param, value in self.solver_params.items():
                 self.set_param(param, value)
 
         def set_param(self, name: str, value):
@@ -461,6 +485,7 @@ class CPLEX_PY(LpSolver):
             param = self.search_param(name=name)
             return param.get()
 
+        @check_solverModel
         def search_param(self, name: str):
             """
             Searches for a solver model parameter by its name and returns the corresponding attribute.
@@ -474,12 +499,14 @@ class CPLEX_PY(LpSolver):
                 param = getattr(param, attr)
             return param
 
+        @check_solverModel
         def get_all_params(self):
             """
             Returns all parameters from the solver model.
             """
             return self.solverModel.parameters.get_all()
 
+        @check_solverModel
         def get_changed_params(self):
             """
             Returns the parameters that have been changed in the solver model.
@@ -515,7 +542,7 @@ class CPLEX_PY(LpSolver):
 
         def callSolver(
             self,
-            isMIP,
+            isMIP: bool,
             callback: Optional[Iterable[type[cplex.callbacks.Callback]]] = None,
         ):
             """
@@ -564,7 +591,7 @@ class CPLEX_PY(LpSolver):
             sol_status = CplexSolStatus.get(lp.cplex_status)
             lp.assignStatus(status, sol_status)
             var_names = [var.name for var in lp._variables]
-            con_names = [con for con in lp.constraints]
+            con_names = [con for con in lp._constraints]
             try:
                 objectiveValue = lp.solverModel.solution.get_objective_value()
                 variablevalues = dict(