Linear Programming
- Introduction
- Explicit LP Solving Functions
MaximalSolution(LHS, relations, RHS, objective): Mtrx, Mtrx, Mtrx, Mtrx → Mtrx, RngIntEltMinimalSolution(LHS, relations, RHS, objective): Mtrx, Mtrx, Mtrx, Mtrx → Mtrx, RngIntEltMaximalIntegerSolution(LHS, relations, RHS, objective): Mtrx, Mtrx, Mtrx, Mtrx → Mtrx, RngIntEltMinimalIntegerSolution(LHS, relations, RHS, objective): Mtrx, Mtrx, Mtrx, Mtrx → Mtrx, RngIntEltMaximalZeroOneSolution(LHS, relations, RHS, objective): Mtrx, Mtrx, Mtrx, Mtrx → Mtrx, RngIntEltMinimalZeroOneSolution(LHS, relations, RHS, objective): Mtrx, Mtrx, Mtrx, Mtrx → Mtrx, RngIntEltExample: Explicit LP Solutions OneExample: Explicit LP Solutions Two
- Creation of LP objects
- Operations on LP objects
AddConstraints(L, lhs, rhs): LP, Mtrx, MtrxNumberOfConstraints(L): LP → RngIntEltNumberOfVariables(L): LP → RngIntEltEvaluateAt(L, p): LP, Mtrx → RngIntEltConstraint(L, n): LP, RngIntElt → Mtrx, Mtrx, RngIntEltIntegerSolutionVariables(L): LP → SeqEnumObjectiveFunction(L): LP → MtrxIsMaximisingFunction(L): LP → BoolEltRemoveConstraint(L, n): LP, RngIntEltSetIntegerSolutionVariables(L, I, m): LP, SeqEnum[RngIntElt], BoolEltSetLowerBound(L, n, b): LP, RngIntElt, RngEltSetMaximiseFunction(L, m): LP, BoolEltSetObjectiveFunction(L, F): LP, MtrxSetUpperBound(L, n, b): LP, RngIntElt, RngEltSolution(L): LP → Mtrx, RngIntEltUnsetBounds(L): LPExample: Filling LP Object
