úÎ!|<sJ™      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜Safe =>?@ACHVOB6math-programmingNon-strict inequalities.math-programming:A linear expression containing symbolic variables of type b# and numeric coefficients of type a.Using ™s to denote variables and š)s as our numeric type, we could express  3 x + 2 y + 1 as * LinearExpression [(3, "x"), (2, "y")] 1 math-programming/The type of values that a variable can take on.Note that the Integer* constructor does not interfere with the Integer type, as the Integer| type does not define a constuctor of the same name. The ambiguity is unfortunate, but other natural nomenclature such as Integral are similarly conflicted.math-programming%The variable lies in the real numbers math-programming!The variable lies in the integers math-programmingThe variable lies in the set {0, 1}. math-programming An interval of the real numbers. math-programmingThe non-negative reals. math-programmingThe non-positive reals.math-programming!Any closed interval of the reals.math-programmingAny real number.math-programmingThe outcome of an optimization.math-programming#An optimal solution has been found.math-programmingJA feasible solution has been found. The result may or may not be optimal.math-programming+The model has been proven to be infeasible.math-programming*The model has been proven to be unbounded.math-programmingpAn error was encountered during the solve. Instance-specific methods should be used to determine what occurred.math-programmingAWhether a math program is minimizing or maximizing its objective.math-programmingA (mixed) integer program."In addition to the methods of the Y class, this monad supports constraining variables to be either continuous or discrete.math-programming#Optimize the mixed-integer program.math-programmingGet the domain of a variable.math-programmingSet the domain of a variable.math-programming9Get the allowed relative gap between LP and IP solutions.math-programming9Set the allowed relative gap between LP and IP solutions.math-programming4A monad for formulating and solving linear programs.<We manipulate linear programs and their settings using the Mutable typeclass. math-programming#The numeric type used in the model.!math-programming$The type of variables in the model. G treats these as opaque values, but instances may expose more details."math-programming&The type of constraints in the model. G treats these as opaque values, but instances may expose more details.#math-programming%The type of objectives in the model. G treats these as opaque values, but instances may expose more details.$math-programming,Create a new decision variable in the model.LThis variable will be initialized to be a non-negative continuous variable.%math-programming*Remove a decision variable from the model.0The variable cannot be used after being deleted.&math-programmingGet the name of the variable.'math-programmingSet the name of the variable.(math-programming%Get the allowed values of a variable.)math-programming/Constrain a variable to take on certain values.*math-programming4Get the value of a variable in the current solution.+math-programming;Add a constraint to the model represented by an inequality.,math-programming#Remove a constraint from the model./The constraint cannot used after being deleted.-math-programmingGet the name of the constraint..math-programmingSet the name of the constraint./math-programming[Get the value of the dual variable associated with the constraint in the current solution.IThis value has no meaning if the current solution is not an LP solution.0math-programming;Add a constraint to the model represented by an inequality.1math-programmingGet the name of the objective.2math-programmingSet the name of the objective.3math-programming6Whether the objective is to be minimized or maximized.4math-programming:Set whether the objective is to be minimized or maximized.5math-programming7Get the value of the objective in the current solution.6math-programmingGGet the number of seconds the solver is allowed to run before halting.7math-programmingGSet the number of seconds the solver is allowed to run before halting.8math-programming0Optimize the continuous relaxation of the model.9math-programmingOA convient shorthand for the type of linear expressions used in a given model.:math-programming?Useful for substituting values in a monadic/applicative context>math-programmingUsing '0' as the identity element?math-programming3Implements addition of 'LinearExpression a b' terms:  876543210/.-,+*)('&%$#! "9:9876543210/.-,+*)('&%$#! "   Safei_Vmath-programming$Create an objective to be minimized.Wmath-programming$Create an objective to be maximized.Xmath-programming=Get the value of a linear expression in the current solution.Ymath-programmingCreate a new free variable.Zmath-programming#Create a new non-negative variable.[math-programming#Create a new non-positive variable.\math-programming1Create a new variable bounded between two values.]math-programming/Constrain a variable to take on certain values.?This function is designed to be used as an infix operator, e.g. $ `]`   ^math-programming"Create an integer-valued variable._math-programmingCreate a binary variable.`math-programmingCCreate an integer-value variable that takes on non-negative values.amath-programmingCCreate an integer-value variable that takes on non-positive values.bmath-programmingSet the type of a variable.?This function is designed to be used as an infix operator, e.g. $ `b`   cmath-programming*Name a variable, constraint, or objective.?This function is designed to be used as an infix operator, e.g. Y `c` X_1 dmath-programming:Retrieve the name of a variable, constraint, or objective.{math-programming7Combine equivalent terms by summing their coefficients.|math-programming"Reduce an expression to its value.}math-programming0Construct an expression representing a variable.~math-programming0Construct an expression representing a constant.math-programming/Construct an expression by summing expressions.€math-programming-Construct an expression by summing variables.CVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜CVWXYZ[\]^_`abcdefghikjlmnopqrstvxuwyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜.e6f6g6h6i6j6k6l6m6n6o6p6q6r6s6t6u7v7w7x7y7z74‚4ƒ4„4…4†4‡4ˆ4‰4Š4‹4Œ44Ž444‘4’4“4”4•4–4—4˜4Safeoz   "!#$%&'()*+,-./0123456789VWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜z "!#$%&'()*+,-./0123456789  YZ[\]^_`ab|{}~€lhjigefktpsqomnruwvxyz‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜VWXcdSafes%›œžŸ ¡¢£      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ªmath-programming-0.4.0-inplaceMath.Programming.TypesMath.Programming.DslMath.ProgrammingPaths_math_programming InequalityLinearExpressionNameablegetNamesetNameDomain ContinuousIntegerBinaryBoundsNonNegativeRealsNonPositiveRealsIntervalFreeSolutionStatusOptimalFeasible Infeasible UnboundedErrorSense Minimization MaximizationIPMonad optimizeIPgetVariableDomainsetVariableDomaingetRelativeMIPGapsetRelativeMIPGapLPMonadNumericVariable Constraint Objective addVariableremoveVariablegetVariableNamesetVariableNamegetVariableBoundssetVariableBoundsgetVariableValue addConstraintremoveConstraintgetConstraintNamesetConstraintName getDualValue addObjectivegetObjectiveNamesetObjectiveNamegetObjectiveSensesetObjectiveSensegetObjectiveValue getTimeout setTimeout optimizeLPExpr$fTraversableLinearExpression$fFoldableLinearExpression$fBifunctorLinearExpression$fFunctorLinearExpression$fMonoidLinearExpression$fSemigroupLinearExpression$fTraversableInequality$fFoldableInequality$fFunctorInequality$fNameablemObjective$fNameablemConstraint$fNameablemVariable $fEqSense $fOrdSense $fReadSense $fShowSense$fEqSolutionStatus$fOrdSolutionStatus$fReadSolutionStatus$fShowSolutionStatus $fReadBounds $fShowBounds $fReadDomain $fShowDomain$fReadLinearExpression$fShowLinearExpression$fReadInequality$fShowInequalityminimizemaximizeevalExprfreenonNegnonPosboundedwithinintegerbinary nonNegInteger nonPosIntegerasKindnamednameOf#+@#+.@+#@+@@+..+@.+#.+.#-@#-.@-#@-@@-..-#.-@.-.#*@#*.@*#.*#@/#./#simplifyevalvarconexprSumvarSum#<=@#<=.@<=#@<=@@<=..<=#.<=@.<=.#>=@#>=.@>=#@>=@@>=..>=#.>=@.>=.#==@#==.@==#@==@@==..==#.==@.==.baseGHC.BaseStringghc-prim GHC.TypesDoubleversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName