50 mysoplex.writeFileReal(
"dump_real.lp", NULL, NULL, NULL);
56 stat = mysoplex.optimize();
61 mysoplex.getPrimal(prim);
62 mysoplex.getDual(dual);
63 std::cout <<
"LP solved to optimality.\n";
64 std::cout <<
"Objective value is " << mysoplex.objValueReal() <<
".\n";
65 std::cout <<
"Primal solution is [" << prim[0] <<
", " << prim[1] <<
"].\n";
66 std::cout <<
"Dual solution is [" << dual[0] <<
"].\n";
70 std::cout <<
"Error: SoPlex returned with status " << stat <<
".\n";
110 mysoplex.writeFileRational(
"dump_rational.lp", NULL, NULL, NULL);
116 stat = mysoplex.optimize();
121 mysoplex.getPrimalRational(prim);
122 mysoplex.getDualRational(dual);
123 std::cout <<
"LP solved to optimality.\n";
124 std::cout <<
"Objective value is " << mysoplex.objValueRational() <<
".\n";
125 std::cout <<
"Primal solution is [" << prim[0] <<
", " << prim[1] <<
"].\n";
126 std::cout <<
"Dual solution is [" << dual[0] <<
"].\n";
130 std::cout <<
"Error: SoPlex returned with status " << stat <<
".\n";
137 std::cout <<
"Testing SoPlex as floating-point LP solver:\n\n";
140 std::cout <<
"\nTesting SoPlex as exact rational LP solver:\n\n";
number< gmp_rational, et_off > Rational
THREADLOCAL const Real infinity
LPRowBase< Rational > LPRowRational
Dense vector.Class VectorBase provides dense linear algebra vectors. Internally, VectorBase wraps std...
automatic sync of real and rational LP
dual feasibility tolerance
Dynamic sparse vectors.Class DSVectorBase implements dynamic sparse vectors, i.e. SVectorBases with a...
LP has been solved to optimality.
mode for a posteriori feasibility checks
void add(const SVectorBase< S > &vec)
Append nonzeros of sv.
primal feasibility tolerance
LPColBase< Rational > LPColRational
Preconfigured SoPlex LP solver.
Preconfigured SoPlex LP-solver.
Everything should be within this namespace.
force iterative refinement
mode for iterative refinement strategy
mode for reading LP files
mode for synchronizing real and rational LP