3.1.1 linear-programming/linear-programming.asd

Source

linear-programming.asd.

Parent Component

linear-programming (system).

ASDF Systems

• linear-programming.
• linear-programming/all.
• linear-programming/problem.
• linear-programming/conditions.
• linear-programming/expressions.
• linear-programming/utils.
• linear-programming/system-info.
• linear-programming/solver.
• linear-programming/simplex.
• linear-programming/external-formats.

---

3.1.2 linear-programming/all/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/all (system).

Packages

linear-programming/all.

---

3.1.3 linear-programming/problem/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/problem (system).

Packages

linear-programming/problem.

Public Interface

• make-linear-problem (macro).
• parse-linear-problem (function).
• problem (structure).
• problem-constraints (reader).
• problem-integer-vars (reader).
• problem-objective-func (reader).
• problem-objective-var (reader).
• problem-type (reader).
• problem-var-bounds (reader).
• problem-vars (reader).

Internals

• copy-problem (function).
• make-problem (function).
• parse-linear-constraints (function).
• problem-p (function).

---

3.1.4 linear-programming/conditions/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/conditions (system).

Packages

linear-programming/conditions.

Public Interface

• infeasible-integer-constraints-error (condition).
• infeasible-problem-error (condition).
• invalid-bounds-error (condition).
• nonlinear-error (condition).
• parsing-error (condition).
• solver-error (condition).
• unbounded-problem-error (condition).
• unsupported-constraint-error (condition).

Internals

• constraint (reader method).
• description (reader method).
• lb (reader method).
• nonlinear-expression (reader method).
• solver-name (reader method).
• ub (reader method).
• var (reader method).

---

3.1.5 linear-programming/expressions/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/expressions (system).

Packages

linear-programming/expressions.

Public Interface

• format-linear-expression (function).
• parse-linear-expression (function).
• scale-linear-expression (function).
• sum-linear-expressions (function).

Internals

• linear-constant-p (function).
• sum-linear-expressions-list (function).

---

3.1.6 linear-programming/utils/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/utils (system).

Packages

linear-programming/utils.

Public Interface

• fp< (compiler macro).
• fp< (function).
• fp<= (compiler macro).
• fp<= (function).
• fp= (function).
• fp> (compiler macro).
• fp> (function).
• fp>= (compiler macro).
• fp>= (function).
• lb-max (function).
• lb-min (function).
• ub-max (function).
• ub-min (function).
• validate-bounds (function).

Internals

• fp-inequality (macro).
• lb (type).
• ub (type).

---

3.1.7 linear-programming/system-info/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/system-info (system).

Packages

linear-programming/system-info.

Public Interface

• +supported-floats+ (constant).
• float-contagion (function).
• optimization-type (function).

---

3.1.8 linear-programming/solver/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/solver (system).

Packages

linear-programming/solver.

Public Interface

• *solver* (special variable).
• solution-objective-value (generic function).
• solution-problem (generic function).
• solution-reduced-cost (generic function).
• solution-variable (generic function).
• solve-problem (function).
• with-solution-variables (macro).
• with-solved-problem (macro).

---

3.1.9 linear-programming/simplex/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/simplex (system).

Packages

linear-programming/simplex.

Public Interface

• build-tableau (function).
• copy-tableau (function).
• n-pivot-row (function).
• n-solve-tableau (function).
• pivot-row (function).
• simplex-solver (function).
• solve-tableau (function).
• tableau (structure).
• tableau-basis-columns (reader).
• tableau-constraint-count (reader).
• tableau-instance-problem (reader).
• tableau-matrix (reader).
• tableau-objective-value (function).
• tableau-p (function).
• tableau-problem (reader).
• tableau-reduced-cost (function).
• tableau-var-count (reader).
• tableau-variable (function).
• with-tableau-variables (macro).

Internals

• build-and-solve (function).
• find-entering-column (function).
• find-pivoting-row (function).
• gen-entries (function).
• make-tableau (function).
• tableau-fp-tolerance-factor (reader).
• tableau-var-mapping (reader).
• var-mapping-entry (type).
• violated-integer-constraint (function).

---

3.1.10 linear-programming/external-formats/file-type.lisp

Source

linear-programming.asd.

Parent Component

linear-programming/external-formats (system).

Packages

linear-programming/external-formats.

Public Interface

• read-mps (function).
• read-sexp (function).
• write-sexp (function).
• write-standard-format (function).

Internals

• newlinep (function).
• print-linear-expression (function).
• read-until (function).

---

5.1.1 Constants

Constant: +supported-floats+ ¶

Contains the distinct floating point representations supported.

Package

linear-programming/system-info.

Source

file-type.lisp.

---

5.1.2 Special variables

Special Variable: *solver* ¶

The function that should be used by solve-problem (defaults to ‘linear-programming/simplex:simplex-solver‘). The function should take a problem, and any backend specific keyword arguments and returns some form of solution object. The solution object should support the following methods ‘solution-problem‘, ‘solution-objective-value‘, ‘solution-variable‘, and ‘solution-reduced-cost‘.

Package

linear-programming/solver.

Source

file-type.lisp.

---

5.1.3 Macros

Macro: make-linear-problem (objective &rest constraints) ¶

Creates a linear problem from the expressions in the body

Package

linear-programming/problem.

Source

file-type.lisp.

Macro: with-solution-variables (var-list solution &body body) ¶

Evaluates the body with the variables in ‘var-list‘ bound to their values in the solution. Additionally, the macro ‘reduced-cost‘ is locally bound that takes a variable name and provides it’s reduced cost.

Package

linear-programming/solver.

Source

file-type.lisp.

Macro: with-solved-problem ((objective-func &rest constraints) &body body) ¶

Takes the problem description, and evaluates ‘body‘ with the variables of the problem bound to their solution values. Additionally, the macro ‘reduced-cost‘ is locally bound that takes a variable name and provides it’s reduced cost.

Package

linear-programming/solver.

Source

file-type.lisp.

Macro: with-tableau-variables (var-list tableau &body body) ¶

Evaluates the body with the variables in ‘var-list‘ bound to their values from the tableau.

Package

linear-programming/simplex.

Source

file-type.lisp.

---

5.1.4 Compiler macros

Compiler Macro: fp< (a b &optional factor) ¶

Package

linear-programming/utils.

Source

file-type.lisp.

Compiler Macro: fp<= (a b &optional factor) ¶

Package

linear-programming/utils.

Source

file-type.lisp.

Compiler Macro: fp> (a b &optional factor) ¶

Package

linear-programming/utils.

Source

file-type.lisp.

Compiler Macro: fp>= (a b &optional factor) ¶

Package

linear-programming/utils.

Source

file-type.lisp.

---

5.1.5 Ordinary functions

Function: build-tableau (problem instance-problem &key fp-tolerance-factor) ¶

Creates the tableau from the given linear problem. If the trivial basis is not feasible, instead a list is returned containing the two tableaus for a two-phase simplex method.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: copy-tableau (tableau) ¶

Copies the given tableau and it’s matrix.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: float-contagion (t1 t2) ¶

Computes the representation type using the rules for float contagion.

Package

linear-programming/system-info.

Source

file-type.lisp.

Function: format-linear-expression (alist) ¶

Formats a linear expression as a sexp.

Package

linear-programming/expressions.

Source

file-type.lisp.

Function: fp< (a b &optional factor) ¶

Tests for inequality taking into account floating point error. ‘factor‘ is the acceptable multiple of unit round off that the two values can differ by.

Package

linear-programming/utils.

Source

file-type.lisp.

Function: fp<= (a b &optional factor) ¶

Tests for inequality taking into account floating point error. ‘factor‘ is the acceptable multiple of unit round off that the two values can differ by.

Package

linear-programming/utils.

Source

file-type.lisp.

Function: fp= (a b &optional factor) ¶

Tests for equality taking into account floating point error. ‘factor‘ is the acceptable multiple of unit round off that the two values can differ by.

Package

linear-programming/utils.

Source

file-type.lisp.

Function: fp> (a b &optional factor) ¶

Tests for inequality taking into account floating point error. ‘factor‘ is the acceptable multiple of unit round off that the two values can differ by.

Package

linear-programming/utils.

Source

file-type.lisp.

Function: fp>= (a b &optional factor) ¶

Tests for inequality taking into account floating point error. ‘factor‘ is the acceptable multiple of unit round off that the two values can differ by.

Package

linear-programming/utils.

Source

file-type.lisp.

Function: lb-max (x y) ¶

Computes the maximum value where nil is negative infinity

Package

linear-programming/utils.

Source

file-type.lisp.

Function: lb-min (x y) ¶

Computes the minimum value where nil is negative infinity

Package

linear-programming/utils.

Source

file-type.lisp.

Function: n-pivot-row (tableau entering-col changing-row) ¶

Destructively applies a single pivot to the table.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: n-solve-tableau (tableau) ¶

A non-consing version of [‘solve-tableau‘](#function-linear-programming/simplex:solve-tableau).

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: optimization-type (x) ¶

Gets the type of ‘x‘ to optimize for. If ‘x‘ is a rational, returns ‘rational‘. Otherwise, returns the type of ‘x‘.

Package

linear-programming/system-info.

Source

file-type.lisp.

Function: parse-linear-expression (expr) ¶

Parses the expression into a alist mapping variables to coefficients. Any constant values are mapped to ‘+constant+‘.

Package

linear-programming/expressions.

Source

file-type.lisp.

Function: parse-linear-problem (objective-exp constraints) ¶

Parses the expressions into a linear programming problem

Package

linear-programming/problem.

Source

file-type.lisp.

Function: pivot-row (tableau entering-col changing-row) ¶

Non-destructively applies a single pivot to the table.

Package

linear-programming/simplex.

Source

file-type.lisp.

Reader: problem-constraints (instance) ¶

A list of (in)equality constraints.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

constraints.

Reader: problem-integer-vars (instance) ¶

A list of variables with integer constraints.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

integer-vars.

Reader: problem-objective-func (instance) ¶

The objective function as a linear expression alist.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

objective-func.

Reader: problem-objective-var (instance) ¶

The name of the objective function.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

objective-var.

Reader: problem-type (instance) ¶

Whether the problem is a ‘min‘ or ‘max‘ problem.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

type.

Reader: problem-var-bounds (instance) ¶

A list of variable bounds, of the form ‘(var . (lower-bound . upper-bound))‘.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

var-bounds.

Reader: problem-vars (instance) ¶

An array of the variables specified in the problem.

Package

linear-programming/problem.

Source

file-type.lisp.

Target Slot

vars.

Function: read-mps (stream problem-type &key package read-case trim-names-p number-type rhs-id) ¶

Reads a problem in MPS format from the given stream. Note that a line starting with ‘ENDATA‘ ends the problem, so MPS files can be embedded in streams of other data. Only the fixed width version of the format is supported, but both the ‘OBJSENCE‘ and ‘OBJNAME‘ headers are supported and the ‘BV‘, ‘LI‘, and ‘UI‘ boundaries are supported.

Package

linear-programming/external-formats.

Source

file-type.lisp.

Function: read-sexp (stream &key allow-read-eval package) ¶

Loads a problem stored in sexp format. This is a single sexp with the first element being the objective function and the rest of the elements being the constraints. Note that normally ‘*read-eval*‘ is bound to ‘nil‘, but can be enabled with ‘allow-read-eval‘; however, this should only be done when parsing trusted data.

Package

linear-programming/external-formats.

Source

file-type.lisp.

Function: scale-linear-expression (expr scalar) ¶

Multiplies the linear expression by the given scalar.

Package

linear-programming/expressions.

Source

file-type.lisp.

Function: simplex-solver (problem &rest args) ¶

The solver interface function for the simplex backend. The ‘fp-tolerance‘ keyword argument can be used to indicate the tolerance for error on floating point comparisons (defaults to 1024).

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: solve-problem (problem &rest args &key &allow-other-keys) ¶

Solves the given problem using the function stored by ‘*solver*‘. Any keyword arguments are passed to the solver function.

Package

linear-programming/solver.

Source

file-type.lisp.

Function: solve-tableau (tableau) ¶

Attempts to solve the tableau using the simplex method. If a list of two tableaus is given, then a two-phase version is used. The original tableau(s) are unchanged.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: sum-linear-expressions (&rest exprs) ¶

Takes linear expressions and reduces it into a single expression.

Package

linear-programming/expressions.

Source

file-type.lisp.

Reader: tableau-basis-columns (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

basis-columns.

Reader: tableau-constraint-count (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

constraint-count.

Reader: tableau-instance-problem (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

instance-problem.

Reader: tableau-matrix (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

matrix.

Function: tableau-objective-value (tableau) ¶

Gets the objective function value in the tableau.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: tableau-p (object) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Reader: tableau-problem (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

problem.

Function: tableau-reduced-cost (tableau var) ¶

Gets the reduced cost (i.e. the shadow price for the lower bound) for the given variable from the tableau.

Package

linear-programming/simplex.

Source

file-type.lisp.

Reader: tableau-var-count (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

var-count.

Function: tableau-variable (tableau var) ¶

Gets the value of the given variable from the tableau

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: ub-max (x y) ¶

Computes the maximum value where nil is positive infinity

Package

linear-programming/utils.

Source

file-type.lisp.

Function: ub-min (x y) ¶

Computes the minimum value where nil is positive infinity

Package

linear-programming/utils.

Source

file-type.lisp.

Function: validate-bounds (lb ub var) ¶

Checks that the bounds represent a non empty range

Package

linear-programming/utils.

Source

file-type.lisp.

Function: write-sexp (stream problem &key package) ¶

Writes the problem as a sexp. The first element is the objective function and the rest of the elements are the constraints.

Package

linear-programming/external-formats.

Source

file-type.lisp.

Function: write-standard-format (stream problem &key unicodep aesthetic-variable-names-p) ¶

Writes a problem to the given stream in human readable, standard notation. The ‘unicodep‘ argument controls whether to print comparisons as unicode or ascii. The ‘aesthetic-variable-names-p‘ argument controls whether variable names are printed aesthetically.

Package

linear-programming/external-formats.

Source

file-type.lisp.

---

5.1.6 Generic functions

Generic Function: solution-objective-value (solution) ¶

Gets the value of the objective function.

Package

linear-programming/solver.

Source

file-type.lisp.

Methods

Method: solution-objective-value ((solution tableau)) ¶

Generic Function: solution-problem (solution) ¶

Gets the original problem for the solution.

Package

linear-programming/solver.

Source

file-type.lisp.

Methods

Method: solution-problem ((solution tableau)) ¶

Generic Function: solution-reduced-cost (solution variable) ¶

Gets the reduced cost of the specified variable. This is the
amount that the objective coefficient for the variable must increase or decrease, for maximization and minimization problems respectively, before the given variable appears in an optimal solution.

Package

linear-programming/solver.

Source

file-type.lisp.

Methods

Method: solution-reduced-cost ((solution tableau) variable) ¶

Generic Function: solution-variable (solution variable) ¶

Gets the value of the specified variable.

Package

linear-programming/solver.

Source

file-type.lisp.

Methods

Method: solution-variable ((solution tableau) variable) ¶

---

5.1.7 Conditions

Condition: infeasible-integer-constraints-error ¶

Indicates that there is no feasible region due to the integer constraints.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

infeasible-problem-error.

Condition: infeasible-problem-error ¶

Indicates the there is no feasible region.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

solver-error.

Direct subclasses

infeasible-integer-constraints-error.

Condition: invalid-bounds-error ¶

Indicates a problem with a variable’s bounds.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

parsing-error.

Direct methods

• lb.
• ub.
• var.

Direct slots

Slot: var ¶

Initargs

:var

Readers

var.

Writers

This slot is read-only.

Slot: ub ¶

Initargs

:ub

Readers

ub.

Writers

This slot is read-only.

Slot: lb ¶

Initargs

:lb

Readers

lb.

Writers

This slot is read-only.

Condition: nonlinear-error ¶

Indicates a form was not a linear expression. This includes the use of nonlinear functions and taking the product of multiple variables

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

parsing-error.

Direct methods

nonlinear-expression.

Direct slots

Slot: expression ¶

Contains the problematic expression

Initargs

:expression

Readers

nonlinear-expression.

Writers

This slot is read-only.

Condition: parsing-error ¶

Indicates an error occured while parsing a linear problem. Includes a textual description of the issue.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

error.

Direct subclasses

• invalid-bounds-error.
• nonlinear-error.

Direct methods

description.

Direct slots

Slot: description ¶

Initargs

:description

Readers

description.

Writers

This slot is read-only.

Condition: solver-error ¶

The base class for errors that occur with the solving algorithm.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

error.

Direct subclasses

• infeasible-problem-error.
• unbounded-problem-error.
• unsupported-constraint-error.

Condition: unbounded-problem-error ¶

Indicates the feasible region is unbounded such that the optimal objective value is infinite.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

solver-error.

Condition: unsupported-constraint-error ¶

Indicates there are unsupported constraints or properties in the given problem.

Package

linear-programming/conditions.

Source

file-type.lisp.

Direct superclasses

solver-error.

Direct methods

• constraint.
• solver-name.

Direct slots

Slot: constraint ¶

Initargs

:constraint

Readers

constraint.

Writers

This slot is read-only.

Slot: solver-name ¶

Initargs

:solver-name

Readers

solver-name.

Writers

This slot is read-only.

---

5.1.8 Structures

Structure: problem ¶

The representation of a linear programming problem.

Package

linear-programming/problem.

Source

file-type.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: type ¶

Package

common-lisp.

Type

(member max min)

Initform

(quote max)

Readers

problem-type.

Writers

This slot is read-only.

Slot: vars ¶

Type

(simple-array symbol (*))

Initform

#()

Readers

problem-vars.

Writers

This slot is read-only.

Slot: objective-var ¶

Type

symbol

Initform

(quote #:z)

Readers

problem-objective-var.

Writers

This slot is read-only.

Slot: objective-func ¶

Type

list

Readers

problem-objective-func.

Writers

This slot is read-only.

Slot: integer-vars ¶

Type

list

Readers

problem-integer-vars.

Writers

This slot is read-only.

Slot: var-bounds ¶

Type

list

Readers

problem-var-bounds.

Writers

This slot is read-only.

Slot: constraints ¶

Type

list

Readers

problem-constraints.

Writers

This slot is read-only.

Structure: tableau ¶

Contains the necessary information for a simplex tableau.

Package

linear-programming/simplex.

Source

file-type.lisp.

Direct superclasses

structure-object.

Direct methods

• solution-objective-value.
• solution-problem.
• solution-reduced-cost.
• solution-variable.

Direct slots

Slot: problem ¶

Package

linear-programming/problem.

Type

linear-programming/problem:problem

Readers

tableau-problem.

Writers

This slot is read-only.

Slot: instance-problem ¶

Type

linear-programming/problem:problem

Readers

tableau-instance-problem.

Writers

This slot is read-only.

Slot: matrix ¶

Type

(simple-array real 2)

Initform

#2a()

Readers

tableau-matrix.

Writers

This slot is read-only.

Slot: basis-columns ¶

Type

(simple-array fixnum (*))

Initform

#()

Readers

tableau-basis-columns.

Writers

This slot is read-only.

Slot: var-count ¶

Type

(and fixnum unsigned-byte)

Initform

0

Readers

tableau-var-count.

Writers

This slot is read-only.

Slot: constraint-count ¶

Type

(and fixnum unsigned-byte)

Initform

0

Readers

tableau-constraint-count.

Writers

This slot is read-only.

Slot: var-mapping ¶

Type

hash-table

Initform

(make-hash-table :test (function eq))

Readers

tableau-var-mapping.

Writers

This slot is read-only.

Slot: fp-tolerance-factor ¶

Type

real

Initform

1024

Readers

tableau-fp-tolerance-factor.

Writers

This slot is read-only.

---

5.2.1 Macros

Macro: fp-inequality (name op eps-mod) ¶

Package

linear-programming/utils.

Source

file-type.lisp.

---

5.2.2 Ordinary functions

Function: build-and-solve (problem extra-constraints &key fp-tolerance-factor) ¶

Builds and solves a tableau with the extra constrains added to the problem.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: copy-problem (instance) ¶

Package

linear-programming/problem.

Source

file-type.lisp.

Function: find-entering-column (tableau) ¶

Gets the column to add to the basis.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: find-pivoting-row (tableau entering-col) ¶

Gets the column that will leave the basis.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: gen-entries (tableau entry) ¶

Generates new entries to correct one of the integer constraints.

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: linear-constant-p (expr) ¶

A predicate for whether a linear expression is constant.

Package

linear-programming/expressions.

Source

file-type.lisp.

Function: make-problem (&key type vars objective-var objective-func integer-vars var-bounds constraints) ¶

Package

linear-programming/problem.

Source

file-type.lisp.

Function: make-tableau (&key problem instance-problem matrix basis-columns var-count constraint-count var-mapping fp-tolerance-factor) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Function: newlinep (c) ¶

Predicate if the given character is a newline or return

Package

linear-programming/external-formats.

Source

file-type.lisp.

Function: parse-linear-constraints (exprs) ¶

Parses the list of constraints and returns a list containing a list of simple inequalities and a list of integer variables.

Package

linear-programming/problem.

Source

file-type.lisp.

Function: print-linear-expression (stream expression &optional aesthetic-variable-names-p) ¶

Package

linear-programming/external-formats.

Source

file-type.lisp.

Function: problem-p (object) ¶

Package

linear-programming/problem.

Source

file-type.lisp.

Function: read-until (stream test &optional preview-test) ¶

Reads the given stream until the condition is true. ‘test‘ can either be a predicate that takes one argument, or a character to be tested using ‘char=‘.

Package

linear-programming/external-formats.

Source

file-type.lisp.

Function: sum-linear-expressions-list (exprs) ¶

Takes a list of linear expressions and reduces it into a single expression.

Package

linear-programming/expressions.

Source

file-type.lisp.

Reader: tableau-fp-tolerance-factor (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

fp-tolerance-factor.

Reader: tableau-var-mapping (instance) ¶

Package

linear-programming/simplex.

Source

file-type.lisp.

Target Slot

var-mapping.

Function: violated-integer-constraint (tableau) ¶

Gets a variable that is required to be an integer but is currently violating that constraint.

Package

linear-programming/simplex.

Source

file-type.lisp.

---

5.2.3 Generic functions

Generic Reader: constraint (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: constraint ((condition unsupported-constraint-error)) ¶

Source

file-type.lisp.

Target Slot

constraint.

Generic Reader: description (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: description ((condition parsing-error)) ¶

Source

file-type.lisp.

Target Slot

description.

Generic Reader: lb (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: lb ((condition invalid-bounds-error)) ¶

Source

file-type.lisp.

Target Slot

lb.

Generic Reader: nonlinear-expression (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: nonlinear-expression ((condition nonlinear-error)) ¶

Source

file-type.lisp.

Target Slot

expression.

Generic Reader: solver-name (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: solver-name ((condition unsupported-constraint-error)) ¶

Source

file-type.lisp.

Target Slot

solver-name.

Generic Reader: ub (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: ub ((condition invalid-bounds-error)) ¶

Source

file-type.lisp.

Target Slot

ub.

Generic Reader: var (condition) ¶

Package

linear-programming/conditions.

Methods

Reader Method: var ((condition invalid-bounds-error)) ¶

Source

file-type.lisp.

Target Slot

var.

---

5.2.4 Types

Type: lb () ¶

Package

linear-programming/utils.

Source

file-type.lisp.

Type: ub () ¶

Package

linear-programming/utils.

Source

file-type.lisp.

Type: var-mapping-entry () ¶

Represents a maping from a problem’s variable to a set of columns in the tableau.

Package

linear-programming/simplex.

Source

file-type.lisp.

---