Îõ³h&†^9      !"#$%&'()*+,-./012345678 Safe-InferredÌÙÚ   74444 Safe-InferredÌÙÚ—   Safe-InferredÌÑÙÚË%&'%&' Safe-InferredÌÙÚB9linear-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.:linear-programming1Generates bounded, but maybe infeasible problems. +,-./0123456 +,./-0123456;      !"#$%&'()*+,-./0123456789:;<=>/linear-programming-0.0.1-6Rb7bJovUtE3c4bmAAKVtI 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 forAllProblemforAllBoundedProblemforAllObjectivessuccessiveObjectives approxRealapproxcheckFeasibilityaffineCombination scalarProduct$fElementInt64$fElementDouble genProblemgenBoundedProblem