glpk-hs 0.3.3 → 0.3.4

raw patch · 1 files changed

+3/−3 lines, 1 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Control.Monad.LPMonad: equal', geq', leq' :: (Ord v, Group c, MonadState (LP v c) m) => String -> LinFunc v c -> LinFunc v c -> m ()

- Control.Monad.LPMonad: equal, geq, leq :: (Ord v, Group c, MonadState (LP v c) m) => LinFunc v c -> LinFunc v c -> m ()

- Control.Monad.LPMonad: equalTo', geqTo', leqTo' :: MonadState (LP v c) m => String -> LinFunc v c -> c -> m ()

- Control.Monad.LPMonad: equalTo, geqTo, leqTo :: MonadState (LP v c) m => LinFunc v c -> c -> m ()

- Control.Monad.LPMonad: quickSolveLP', quickSolveMIP' :: (Ord v, Real c, MonadState (LP v c) m, MonadIO m) => m (ReturnCode, Maybe (Double, Map v Double, [RowValue v c]))

- Control.Monad.LPMonad: quickSolveLP, quickSolveMIP :: (Ord v, Real c, MonadState (LP v c) m, MonadIO m) => m (ReturnCode, Maybe (Double, Map v Double))

- Control.Monad.LPMonad: varEq, varGeq, varLeq :: (Ord v, Ord c, MonadState (LP v c) m) => v -> c -> m ()

- Data.LinearProgram.GLPK.Solver: simplexDefaults, mipDefaults :: GLPOpts

+ Control.Monad.LPMonad: equal :: (Ord v, Group c, MonadState (LP v c) m) => LinFunc v c -> LinFunc v c -> m ()

+ Control.Monad.LPMonad: equal' :: (Ord v, Group c, MonadState (LP v c) m) => String -> LinFunc v c -> LinFunc v c -> m ()

+ Control.Monad.LPMonad: equalTo :: MonadState (LP v c) m => LinFunc v c -> c -> m ()

+ Control.Monad.LPMonad: equalTo' :: MonadState (LP v c) m => String -> LinFunc v c -> c -> m ()

+ Control.Monad.LPMonad: geq :: (Ord v, Group c, MonadState (LP v c) m) => LinFunc v c -> LinFunc v c -> m ()

+ Control.Monad.LPMonad: geq' :: (Ord v, Group c, MonadState (LP v c) m) => String -> LinFunc v c -> LinFunc v c -> m ()

+ Control.Monad.LPMonad: geqTo :: MonadState (LP v c) m => LinFunc v c -> c -> m ()

+ Control.Monad.LPMonad: geqTo' :: MonadState (LP v c) m => String -> LinFunc v c -> c -> m ()

+ Control.Monad.LPMonad: leq :: (Ord v, Group c, MonadState (LP v c) m) => LinFunc v c -> LinFunc v c -> m ()

+ Control.Monad.LPMonad: leq' :: (Ord v, Group c, MonadState (LP v c) m) => String -> LinFunc v c -> LinFunc v c -> m ()

+ Control.Monad.LPMonad: leqTo :: MonadState (LP v c) m => LinFunc v c -> c -> m ()

+ Control.Monad.LPMonad: leqTo' :: MonadState (LP v c) m => String -> LinFunc v c -> c -> m ()

+ Control.Monad.LPMonad: quickSolveLP :: (Ord v, Real c, MonadState (LP v c) m, MonadIO m) => m (ReturnCode, Maybe (Double, Map v Double))

+ Control.Monad.LPMonad: quickSolveLP' :: (Ord v, Real c, MonadState (LP v c) m, MonadIO m) => m (ReturnCode, Maybe (Double, Map v Double, [RowValue v c]))

+ Control.Monad.LPMonad: quickSolveMIP :: (Ord v, Real c, MonadState (LP v c) m, MonadIO m) => m (ReturnCode, Maybe (Double, Map v Double))

+ Control.Monad.LPMonad: quickSolveMIP' :: (Ord v, Real c, MonadState (LP v c) m, MonadIO m) => m (ReturnCode, Maybe (Double, Map v Double, [RowValue v c]))

+ Control.Monad.LPMonad: varEq :: (Ord v, Ord c, MonadState (LP v c) m) => v -> c -> m ()

+ Control.Monad.LPMonad: varGeq :: (Ord v, Ord c, MonadState (LP v c) m) => v -> c -> m ()

+ Control.Monad.LPMonad: varLeq :: (Ord v, Ord c, MonadState (LP v c) m) => v -> c -> m ()

+ Data.LinearProgram.GLPK.Solver: mipDefaults :: GLPOpts

+ Data.LinearProgram.GLPK.Solver: simplexDefaults :: GLPOpts

- Data.LinearProgram.GLPK.Solver: RowVal :: !Constraint v c -> !Double -> RowValue v c

+ Data.LinearProgram.GLPK.Solver: RowVal :: !(Constraint v c) -> !Double -> RowValue v c

- Data.LinearProgram.GLPK.Solver: row :: RowValue v c -> !Constraint v c

+ Data.LinearProgram.GLPK.Solver: row :: RowValue v c -> !(Constraint v c)

Files

glpk-hs.cabal +3/−3

glpk-hs.cabal view

@@ -1,5 +1,5 @@ Name:           glpk-hs-Version:        0.3.3+Version:        0.3.4 Author:         Louis Wasserman License:        BSD3 License-file:   LICENSE@@ -11,8 +11,8 @@     with a general, pure-Haskell representation of linear programs.  Also includes usefully general algebraic structures.          To design a linear programming problem, -    use "Data.LinearProgram.LPMonad" to construct the constraints and specifications.  Linear functions are essentially specified-    as @Data.Map@s from variables to their coefficients, and functions for manipulating them are available in "Data.LinFunc".+    use "Control.Monad.LPMonad" to construct the constraints and specifications.  Linear functions are essentially specified+    as @Data.Map@s from variables to their coefficients, and functions for manipulating them are available in "Data.LinearProgram.LinExpr".     Then "Data.LinearProgram.GLPK" provides facilities for using the GLPK solver system on your problem, with a sizable number     of options available.