problem

Contains functionality for dealing with a linear programming model.

class pylp.problem.Status(status, time)

status

Alias for field number 0

time

Alias for field number 1

pylp.problem.solve(*, objective=None, constraints: Iterable[Constraint] | None = None, minimize: bool = False, solver: str = 'glpk', verbose: bool = False, options: list | None = None, solver_path: str | None = None, **kwargs) → Status

Solve the linear programming problem.

Parameters:

• objective – The objective function

• constraints – The collection of constraints

• minimize – True for minimizing; False for maximizing

• solver – The solver to use. Current supports ‘glpk’, ‘theo-cluster’ and ‘cplex’.

• verbose – If True, output the results of the solver

• list (options) – add options to the (glpk) solver

• **kwargs – is used to set the cluster path

Returns:

Optimal, Unbounded, etc.) and the elapsed time

Return type:

A tuple of the status (eg

solver: theo-cluster

This is a specific version of the code to do cluster submission.