OsiClpSolverInterface solver;
	solver.setupForRepeatedUse(2);

	int const nCols=1000;
	int const nRows=10000;

	// create dual infeasible LP

	for (int i=0; i<nCols; ++i) {
		solver.addCol(0, NULL, NULL, -solver.getInfinity(), solver.getInfinity(), i==0 ? 1.0 : 0.0 );
	}

	CoinModel model;
	int iRow=0;
	for (; iRow<nRows/2; ++iRow) {
		int iCol=1+iRow%(nCols-1);
		int indices[2]={0, iCol};
		double elements[]={1, 1};
		model.addRow( 2, indices, elements, 0.0 , solver.getInfinity() );
	}
	for (; iRow<nRows; ++iRow) {
		int iCol=1+iRow%(nCols-1);
		int indices[2]={0, iCol};
		double elements[]={-1, -1};
		model.addRow( 2, indices, elements, -1.0 , solver.getInfinity() );
	}
	static_cast<OsiSolverInterface&>(solver).addRows(model);
	
	solver.initialSolve();
	_ASSERT(solver.isProvenDualInfeasible());

	// make LP primal infeasible

	for (iRow=0; iRow<nRows/2; ++iRow) {
		solver.setRowLower(iRow, 2.0);
	}

	solver.resolve();
	_ASSERT(solver.isProvenPrimalInfeasible());
	solver.resolve();