limp-0.3.2.0: representation of Integer Linear Programs

Safe HaskellNone
LanguageHaskell2010

Numeric.Limp.Program.Program

Description

Definition of a whole program

Synopsis

Documentation

data Direction Source

Direction to optimise program in: minimise or maximise.

Constructors

Minimise 
Maximise 

Instances

data Program z r c Source

Whole program, parameterised by:

z
type of integer variables
r
type of real variables
c
representation of integers and reals (see Rep)

Constructors

Program 

Fields

_direction :: Direction

Optimisation direction

_objective :: Linear z r c KR

The objective function

_constraints :: Constraint z r c

All constraints bundled up with :&&.

_bounds :: [Bounds z r c]

Upper and lower bounds of variables. Not all variables need to be mentioned, and if variables are mentioned multiple times, the intersection is used.

Instances

(Show z, Show r, Show (Z c), Show (R c)) => Show (Program z r c) 

program :: Rep c => Direction -> Linear z r c k -> Constraint z r c -> [Bounds z r c] -> Program z r c Source

minimise :: Rep c => Linear z r c k -> Constraint z r c -> [Bounds z r c] -> Program z r c Source

maximise :: Rep c => Linear z r c k -> Constraint z r c -> [Bounds z r c] -> Program z r c Source