mirror of
https://github.com/ANL-CEEESA/MIPLearn.git
synced 2025-12-06 17:38:51 -06:00
Remove obsolete methods
This commit is contained in:
@@ -124,10 +124,8 @@ class InternalSolver(ABC, EnforceOverrides):
|
||||
"""
|
||||
Sets the warm start to be used by the solver.
|
||||
|
||||
The solution should be a dictionary following the same format as the
|
||||
one produced by `get_solution`. Only one warm start is supported.
|
||||
Calling this function when a warm start already exists will
|
||||
remove the previous warm start.
|
||||
Only one warm start is supported. Calling this function when a warm start
|
||||
already exists will remove the previous warm start.
|
||||
"""
|
||||
pass
|
||||
|
||||
@@ -154,11 +152,8 @@ class InternalSolver(ABC, EnforceOverrides):
|
||||
@abstractmethod
|
||||
def fix(self, solution: Solution) -> None:
|
||||
"""
|
||||
Fixes the values of a subset of decision variables.
|
||||
|
||||
The values should be provided in the dictionary format generated by
|
||||
`get_solution`. Missing values in the solution indicate variables
|
||||
that should be left free.
|
||||
Fixes the values of a subset of decision variables. Missing values in the
|
||||
solution indicate variables that should be left free.
|
||||
"""
|
||||
pass
|
||||
|
||||
@@ -170,9 +165,7 @@ class InternalSolver(ABC, EnforceOverrides):
|
||||
with higher priority are picked first, given that they are fractional.
|
||||
Ties are solved arbitrarily. By default, all variables have priority zero.
|
||||
|
||||
The priorities should be provided in the dictionary format generated by
|
||||
`get_solution`. Missing values indicate variables whose priorities
|
||||
should not be modified.
|
||||
Missing values indicate variables whose priorities should not be modified.
|
||||
"""
|
||||
raise NotImplementedError()
|
||||
|
||||
@@ -216,34 +209,6 @@ class InternalSolver(ABC, EnforceOverrides):
|
||||
"""
|
||||
pass
|
||||
|
||||
@abstractmethod
|
||||
def get_dual(self, cid: str) -> float:
|
||||
"""
|
||||
If the model is feasible and has been solved to optimality, returns the
|
||||
optimal value of the dual variable associated with this constraint. If the
|
||||
model is infeasible, returns a portion of the infeasibility certificate
|
||||
corresponding to the given constraint.
|
||||
|
||||
Only available for relaxed problems. Must be called after solve.
|
||||
"""
|
||||
pass
|
||||
|
||||
@abstractmethod
|
||||
def get_sense(self) -> str:
|
||||
"""
|
||||
Returns the sense of the problem (either "min" or "max").
|
||||
"""
|
||||
pass
|
||||
|
||||
@abstractmethod
|
||||
def get_variable_names(self) -> List[VariableName]:
|
||||
"""
|
||||
Returns a list containing the names of all variables in the model. This
|
||||
method is used by the ML components to query what variables are there in the
|
||||
model before a solution is available.
|
||||
"""
|
||||
pass
|
||||
|
||||
@abstractmethod
|
||||
def clone(self) -> "InternalSolver":
|
||||
"""
|
||||
|
||||
Reference in New Issue
Block a user