object

simplex

Portable dense two-phase simplex solver for small continuous linear programs.

Availability:

logtalk_load(linear_programming(loader))

Author: Paulo Moura

Version: 1:0:0

Date: 2026-09-12

Compilation flags:

static, context_switching_calls

Imports:

public linear_programming_common

Uses:

linear_algebra

list

Remarks:

• Variable types: This backend supports continuous variables only. Integer and binary variables are accepted by the shared model API for use by future MILP backends but rejected when solving.

• Pivoting: Bland’s rule is used by default. Dantzig’s rule is also available, with the lowest column index breaking ties. Minimum-ratio ties use the lowest-indexed basic variable.

Inherited public predicates:

 check_option/1  check_options/1  constraint/5  constraints/3  default_option/1  default_options/1  new_problem/1  objective/4  objective_value/2  option/2  option/3  print_problem/1  print_solution/1  problem_from_matrices/8  solve/2  solve/3  statistics/2  status/2  valid_option/1  valid_options/1  variable/4  variable/6  variable_value/3

Public predicates

(no local declarations; see entity ancestors if any)

Protected predicates

(no local declarations; see entity ancestors if any)

Private predicates

(no local declarations; see entity ancestors if any)

Operators

(none)

See also

linear_programming_protocol