System.err.print("Solving integer linear program..."); double[] sol = lp.solve(); System.err.println("done.");
System.err.println("Solving integer linear program..."); double[] sol = null; try { sol = lp.solve(); } catch (LPSolverFailedException e) { e.printStackTrace(); }
    private double[] calcSolution() {	// make the linear program...	int numVars = dNum(nodes.size()-1, numTiles);	// this is a *conservative* estimate of the number of	// constraints, derived from the paper	int numConstraints = 1 + (int)(8.25 * numTiles * nodes.size()) + 2*numTiles + nodes.size();	System.err.println("nodes.size()=" + nodes.size());	System.err.println("numVars = " + numVars);	System.err.println("numConstraints <= " + numConstraints);	LinearProgramSolver lp = new GLPKSolve(numVars);		setupObjective(lp);	setupConstraints(lp);	// get solution, including objective function	System.err.print("Solving integer linear program...");	double[] sol = lp.solve();	System.err.println("done.");	return sol;    }