Skip to content

Failed

run_tests.TestSimulation_mosek_conif.test_table_diff (from run_tests.TestSimulation_mosek_conif-20200714174030)

Failing for the past 1 build (Since Failed #236 )
Took 3.7 sec.

Error Message

unsupported operand type(s) for -: 'list' and 'list'

Stacktrace

Traceback (most recent call last):
  File "/jenkins/workspace/CE_gplibrary_Push_research_models/mosek/robust/robust/testing/t_simulation.py", line 107, in test_table_diff
    self.assertAlmostEqual(open(origfilename, 'r').readlines(), open(filename, 'r').readlines())
  File "/usr/lib/python3.5/unittest/case.py", line 861, in assertAlmostEqual
    if round(abs(second-first), places) == 0:
TypeError: unsupported operand type(s) for -: 'list' and 'list'
		

Standard Output

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

Solution check warning: Sum of nu^T * A did not vanish.
Final solution let signomial constraints slacken by 8.8%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`.

SGP not convergent: Cost rose by 1.7% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

Final solution let signomial constraints slacken by 0.035%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8.1% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 0.46% on GP solve 4. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

Solution check warning: Sum of nu^T * A did not vanish.
Final solution let signomial constraints slacken by 14%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`.

SGP not convergent: Cost rose by 0.066% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 0.019% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 0.011% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8.1% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 0.46% on GP solve 4. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.

	

Standard Error