Package org.ssclab.pl.milp

This package contains classes for solving linear programming problems. The LP class allows solving problems with continuous variables, whereas the MILP class also allows solving problems involving integer and semicontinuous variables. The LP class utilizes the simplex algorithm, while the MILP class employs the Branch and Bound method. SSC Software www.sscLab.org

Since:

1.0

Version:

4

Author:

Stefano Scarioli

Interface Summary

Interface	Description
FormatTypeInput	This interface contains an enumeration that allows you to define the type of format present in the Input object, passed as an argument to the LP or MILP objects: Sparse or coefficient.
Solution	This interface allows accessing the values taken by the n variables of the optimal solution.
SolutionConstraint	This interface allows accessing a constraint of the LP problem where each unknown variable has been assigned the optimal value.
Variable	This interface allows accessing the optimal value assumed by the j-th variable of the LP problem (j=1..N).

Class Summary

Class	Description
Constraint	This class allows you to build objects, each of which represents a constraint for a linear programming problem expressed in matrix notation
JsonProblem	The JsonProblem class represents a problem in JSON format that can be loaded either from a file or a string.
JsonSolution	This class represents the solution of a Linear Programming (LP) problem in JSON format.
LinearObjectiveFunction	This class allows instantiating objects representing the objective function in linear programming problems expressed in matrix notation.
ListConstraints	The ListConstraints class represents a collection of constraints for a Mixed Integer Linear Programming (MILP) problem.
LP	This class allows executing and solving formulations of linear programming problems.
MILP	This class allows executing and solving formulations of mixed integer linear programming problems, binary or semicontinuous.

Enum Summary

Enum	Description
ConsType	Enumeration used to define the type of relationship in a Constraint object.
EPSILON	Enumeration for epsilon values ranging from 1E-16 to 1E-4.
FormatTypeInput.FormatType	Enumeration used to define the type of format utilized.
GoalType	This enumeration allows declaring the type of optimization sought on the objective function: maximization or minimization.
SolutionDetail	Enumeration SolutionDetail defines optional parts of the solution that can be included in the JSON output when solving a Linear Programming (LP) or Mixed-Integer Linear Programming (MILP) problem.
SolutionType	This enumeration defines the different types of results that the two-phase method returns.
Variable.TYPE_VAR	Defines the type of variable: integer, binary, or continuous.

Exception Summary

Exception	Description
LPException	This class represents an exception specific to Linear Programming (LP) operations.
ParseException