ToySolver.Data.MIP.Base

Mixed-Integer Programming Problems with some commmonly used extensions

Documentation

data Problem

Problem

Constructors

Problem

Fields

dir :: OptDir

objectiveFunction :: ObjectiveFunction

constraints :: [Constraint]

sosConstraints :: [SOSConstraint]

userCuts :: [Constraint]

varInfo :: Map Var VarInfo

Instances

Eq Problem

Ord Problem

Show Problem

Default Problem

Variables Problem

type Expr = [Term]

expressions

data Term

terms

Constructors

Term Rational [Var]

Instances

Eq Term

Ord Term

Show Term

Variables Term

data OptDir :: *

The OptDir type represents optimization directions.

Constructors

OptMin

minimization

OptMax

maximization

Instances

Bounded OptDir

Enum OptDir

Eq OptDir

Data OptDir

Ord OptDir

Read OptDir

Show OptDir

Ix OptDir

Hashable OptDir

Typeable * OptDir

type ObjectiveFunction = (Maybe Label, Expr)

objective function

data Constraint

constraint

Constructors

Constraint

Fields

constrLabel :: Maybe Label

constrIndicator :: Maybe (Var, Rational)

constrBody :: (Expr, RelOp, Rational)

constrIsLazy :: Bool

Instances

Eq Constraint

Ord Constraint

Show Constraint

Default Constraint

Variables Constraint

type Bounds = (BoundExpr, BoundExpr)

type for representing lower/upper bound of variables

type Label = String

label

type Var = InternedString

variable

data VarType

Constructors

ContinuousVariable

IntegerVariable

SemiContinuousVariable

SemiIntegerVariable

Instances

Eq VarType

Ord VarType

Show VarType

Default VarType

data VarInfo

Constructors

VarInfo

Fields

varType :: VarType

varBounds :: Bounds

Instances

Eq VarInfo

Ord VarInfo

Show VarInfo

Default VarInfo

type BoundExpr = Extended Rational

type for representing lower/upper bound of variables

data Extended r :: * -> *

Extended r is an extension of r with positive/negative infinity (±∞).

Constructors

NegInf

negative infinity (-∞)

Finite !r

finite value

PosInf

positive infinity (+∞)

Instances

Functor Extended

Bounded (Extended r)

Eq r => Eq (Extended r)

(Fractional r, Ord r) => Fractional (Extended r)

Note that Extended r is not a field, nor a ring.

Data r => Data (Extended r)

(Num r, Ord r) => Num (Extended r)

Note that Extended r is not a field, nor a ring.

PosInf + NegInf is left undefined as usual, but we define 0 * PosInf = 0 * NegInf = 0 by following the convention of probability or measure theory.

Ord r => Ord (Extended r)

Read r => Read (Extended r)

Show r => Show (Extended r)

NFData r => NFData (Extended r)

Hashable r => Hashable (Extended r)

Typeable (* -> *) Extended

data RelOp

relational operators

Constructors

Le

Ge

Eql

Instances

Enum RelOp

Eq RelOp

Ord RelOp

Show RelOp

data SOSType

types of SOS (special ordered sets) constraints

Constructors

S1

Type 1 SOS constraint

S2

Type 2 SOS constraint

Instances

Enum SOSType

Eq SOSType

Ord SOSType

Read SOSType

Show SOSType

data SOSConstraint

SOS (special ordered sets) constraints

Constructors

SOSConstraint

Fields

sosLabel :: Maybe Label

sosType :: SOSType

sosBody :: [(Var, Rational)]

Instances

Eq SOSConstraint

Ord SOSConstraint

Show SOSConstraint

Variables SOSConstraint

defaultBounds :: Bounds

default bounds

defaultLB :: BoundExpr

default lower bound (0)

defaultUB :: BoundExpr

default upper bound (+∞)

toVar :: String -> Var

convert a string into a variable

fromVar :: Var -> String

convert a variable into a string

getVarInfo :: Problem -> Var -> VarInfo

looking up attributes for a variable

getVarType :: Problem -> Var -> VarType

looking up bounds for a variable

getBounds :: Problem -> Var -> Bounds

looking up bounds for a variable

variables :: Problem -> Set Var

integerVariables :: Problem -> Set Var

semiContinuousVariables :: Problem -> Set Var

semiIntegerVariables :: Problem -> Set Var

Utilities

class Variables a where

Methods

vars :: a -> Set Var

Instances

Variables SOSConstraint

Variables Constraint

Variables Term

Variables Problem

Variables a => Variables [a]

(Variables a, Variables b) => Variables (Either a b)

intersectBounds :: Bounds -> Bounds -> Bounds