SCIP version 7.0.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 5.0.2] [GitHash: 74c11e60cd] Copyright (C) 2002-2021 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) External libraries: SoPlex 5.0.2 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: e24c304e] CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (www.coin-or.org/CppAD) ZLIB 1.2.11 General purpose compression library by J. Gailly and M. Adler (zlib.net) GMP 6.2.1 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) ZIMPL 3.4.0 Zuse Institute Mathematical Programming Language developed by T. Koch (zimpl.zib.de) PaPILO 1.0.2 parallel presolve for integer and linear optimization [GitHash: e567fef] bliss 0.73p Computing Graph Automorphism Groups by T. Junttila and P. Kaski (http://www.tcs.hut.fi/Software/bliss/) Ipopt 3.13.2 Interior Point Optimizer developed by A. Waechter et.al. (www.coin-or.org/Ipopt) user parameter file not found - using default parameters SCIP> read problem ============ original problem has 9 variables (0 bin, 5 int, 0 impl, 4 cont) and 4 constraints SCIP> feasible solution found by trivial heuristic after 0.0 seconds, objective value 0.000000e+00 presolving: (round 1, fast) 4 del vars, 1 del conss, 0 add conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 2, fast) 4 del vars, 1 del conss, 0 add conss, 11 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (0.0s) running MILP presolver (0.0s) MILP presolver (2 rounds): 0 aggregations, 1 fixings, 0 bound changes (round 3, medium) 5 del vars, 1 del conss, 0 add conss, 11 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs (round 4, exhaustive) 5 del vars, 1 del conss, 0 add conss, 11 chg bounds, 3 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs presolving (5 rounds: 5 fast, 3 medium, 2 exhaustive): 5 deleted vars, 1 deleted constraints, 0 added constraints, 11 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients 0 implications, 0 cliques presolved problem has 4 variables (0 bin, 4 int, 0 impl, 0 cont) and 3 constraints 1 constraints of type 2 constraints of type transformed objective value is always integral (scale: 0.01) Presolving Time: 0.00 transformed 1/1 original solutions to the transformed problem space time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl. i 0.0s| 1 | 0 | 0 | - | oneopt| 0 | 4 | 3 | 3 | 0 | 0 | 0 | 0 | 1.502000e+02 | 1.133000e+02 | 32.57%| unknown 0.0s| 1 | 0 | 4 | - | 603k | 0 | 4 | 3 | 3 | 0 | 0 | 0 | 0 | 1.134615e+02 | 1.133000e+02 | 0.14%| unknown 0.0s| 1 | 0 | 4 | - | 603k | 0 | 4 | 3 | 3 | 0 | 0 | 0 | 0 | 1.134615e+02 | 1.133000e+02 | 0.14%| unknown 0.0s| 1 | 0 | 5 | - | 606k | 0 | 4 | 3 | 4 | 1 | 1 | 0 | 0 | 1.134595e+02 | 1.133000e+02 | 0.14%| unknown r 0.0s| 1 | 0 | 5 | - |simplero| 0 | 4 | 3 | 4 | 1 | 1 | 0 | 0 | 1.134595e+02 | 1.134500e+02 | 0.01%| unknown 0.0s| 1 | 0 | 5 | - | 606k | 0 | 4 | 3 | 4 | 1 | 1 | 0 | 0 | 1.134500e+02 | 1.134500e+02 | 0.00%| unknown SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.00 Solving Nodes : 1 Primal Bound : +1.13450000000000e+02 (4 solutions) Dual Bound : +1.13450000000000e+02 Gap : 0.00 % SCIP> objective value: 113.45 Dimes 2 (obj:0.1) Quarters 53 (obj:0.25) Dollars 100 (obj:1) Cu 999.8 (obj:0) Ni 46.9 (obj:0) Zi 50 (obj:0) Mn 30 (obj:0) SCIP> written solution information to file SCIP>