Îõ³h&,8      !"#$%&'()*+,-./01234567 Safe-InferredÌÙÚ   74444 Safe-InferredÌÙÚ“   Safe-InferredÌÑÙÚÇ%&'%&' Safe-InferredÌÙÚô8linear-programmingßGenerate constraints in the form of a polyhedron which contains warrantedly the zero vector. That is, there is an admissible solution. In order to assert that the polyhedron is closed, we bound all variables by a hypercube. +,-./012345 +,.-/0123459      !"#$%&'()*+,-./0123456789:;<-linear-programming-0.0-7DUVptzPjjiDnTX6G5qTKN Numeric.LinearProgramming.Common Numeric.LinearProgramming.FormatNumeric.LinearProgramming.MonadNumeric.LinearProgramming.Test Objective DirectionMinimizeMaximize ConstraintsBoundsBound LessEqual GreaterEqualBetweenEqualFree InequalityTerm.*<=.>=.==.>=<.freeobjectiveFromTerms$fFunctorInequality $fEqDirection$fEnumDirection$fBoundedDirection$fShowDirection$fShowInequality $fShowBound $fShowTerm IdentifiermathProg$fIdentifierInteger$fIdentifierInt$fIdentifier[]$fIdentifierCharTrunlift $fFunctorT$fApplicativeT$fMonadTElement forAllOrigin genObjective forAllProblemforAllObjectivessuccessiveObjectives approxRealapproxcheckFeasibilityaffineCombination scalarProduct$fElementInt64$fElementDouble genProblem