@@ -15,7 +15,7 @@ Simple Linear Programming Example
1515.. code-block :: python
1616
1717 from cuopt.linear_programming.problem import Problem, VType, CType, sense
18- from cuopt.linear_programming.settings import SolverSettings
18+ from cuopt.linear_programming.solver_settings import SolverSettings
1919
2020 # Create a new problem
2121 problem = Problem(" Simple LP" )
@@ -60,7 +60,7 @@ Mixed Integer Linear Programming Example
6060.. code-block :: python
6161
6262 from cuopt.linear_programming.problem import Problem, VType, CType, sense
63- from cuopt.linear_programming.settings import SolverSettings
63+ from cuopt.linear_programming.solver_settings import SolverSettings
6464
6565 # Create a new MIP problem
6666 problem = Problem(" Simple MIP" )
@@ -108,7 +108,7 @@ Advanced Example: Production Planning
108108.. code-block :: python
109109
110110 from cuopt.linear_programming.problem import Problem, VType, CType, sense
111- from cuopt.linear_programming.settings import SolverSettings
111+ from cuopt.linear_programming.solver_settings import SolverSettings
112112
113113 # Production planning problem
114114 problem = Problem(" Production Planning" )
@@ -168,7 +168,7 @@ Working with Expressions and Constraints
168168.. code-block :: python
169169
170170 from cuopt.linear_programming.problem import Problem, VType, CType, sense
171- from cuopt.linear_programming.settings import SolverSettings
171+ from cuopt.linear_programming.solver_settings import SolverSettings
172172
173173 problem = Problem(" Expression Example" )
174174
@@ -295,6 +295,7 @@ Incumbent solutions are intermediate feasible solutions found during the MIP sol
295295 The response is as follows:
296296
297297.. code-block :: text
298+
298299 Optimal solution found.
299300 Incumbent 1: [ 0. 58.], cost: 174.00
300301 Incumbent 2: [36. 41.], cost: 303.00
0 commit comments