@@ -860,7 +860,7 @@ cdef class MixedIntegerLinearProgram(SageObject):
860
860
861
861
EXAMPLES::
862
862
863
- sage: mip.<a,b> = MixedIntegerLinearProgram(solver='GLPK')
863
+ sage: mip.<a,b> = MixedIntegerLinearProgram(solver='GLPK') # indirect doctest
864
864
sage: a[0] + b[2]
865
865
x_0 + x_1
866
866
sage: mip.show()
@@ -2299,7 +2299,8 @@ cdef class MixedIntegerLinearProgram(SageObject):
2299
2299
sage: p. number_of_constraints( )
2300
2300
2
2301
2301
"""
2302
- if self ._check_redundant: self ._constraints.pop(i)
2302
+ if self ._check_redundant:
2303
+ self ._constraints.pop(i)
2303
2304
self ._backend.remove_constraint(i)
2304
2305
2305
2306
def remove_constraints (self , constraints ):
@@ -2644,7 +2645,8 @@ cdef class MixedIntegerLinearProgram(SageObject):
2644
2645
sage: p. solve( )
2645
2646
9. 0
2646
2647
"""
2647
- if log is not None : self ._backend.set_verbosity(log)
2648
+ if log is not None :
2649
+ self ._backend.set_verbosity(log)
2648
2650
self ._backend.solve()
2649
2651
return self ._backend.get_objective_value()
2650
2652
@@ -3262,14 +3264,15 @@ cdef class MIPVariable(SageObject):
3262
3264
indexed by arbitrary keys and are created dynamically
3263
3265
on access
3264
3266
3265
- For more informations , see the method
3267
+ For more information , see the method
3266
3268
``MixedIntegerLinearProgram. new_variable``.
3267
3269
3268
3270
EXAMPLES::
3269
3271
3270
3272
sage: p = MixedIntegerLinearProgram( solver='GLPK')
3271
3273
sage: p. new_variable( nonnegative=True)
3272
3274
MIPVariable with 0 real components, >= 0
3275
+
3273
3276
"""
3274
3277
self ._dict = {}
3275
3278
self ._p = mip
0 commit comments