Uses of Class
org.ojalgo.optimisation.GenericSolver

Packages that use GenericSolver

Package	Description
org.ojalgo.optimisation
org.ojalgo.optimisation.convex
org.ojalgo.optimisation.integer
org.ojalgo.optimisation.linear

Uses of GenericSolver in org.ojalgo.optimisation

Classes in org.ojalgo.optimisation with type parameters of type GenericSolver

Modifier and Type	Class	Description
static class	GenericSolver.Builder<B extends GenericSolver.Builder<B,S>, S extends GenericSolver>

Uses of GenericSolver in org.ojalgo.optimisation.convex

Subclasses of GenericSolver in org.ojalgo.optimisation.convex

Modifier and Type	Class	Description
(package private) class	ActiveSetSolver
(package private) class	BasePrimitiveSolver
(package private) class	ConstrainedSolver
class	ConvexSolver	ConvexSolver solves optimisation problems of the form:
(package private) final class	DirectASS	Solves optimisation problems of the form:
(package private) final class	IterativeASS	Solves optimisation problems of the form:
(package private) final class	IterativeRefinementSolver	Algorithm from: Solving quadratic programs to high precision using scaled iterative refinement Mathematical Programming Computation (2019) 11:421–455 https://doi.org/10.1007/s12532-019-00154-6
(package private) final class	IterativeRefinementSolver2	Algorithm from: Solving quadratic programs to high precision using scaled iterative refinement Mathematical Programming Computation (2019) 11:421–455 https://doi.org/10.1007/s12532-019-00154-6
(package private) final class	IterativeRefinementSolverDouble	Algorithm from: Solving quadratic programs to high precision using scaled iterative refinement Mathematical Programming Computation (2019) 11:421–455 https://doi.org/10.1007/s12532-019-00154-6
(package private) class	NullSpaceASS	Proof-of-concept solver that eliminates equality constraints, and reduces the number of variables, via a null-space projection and delegates the reduced inequality-only QP to an existing active-set solver.
(package private) final class	QPESolver	Solves optimisation problems of the form:
(package private) final class	UnconstrainedSolver	Solves optimisation problems of the form:

Uses of GenericSolver in org.ojalgo.optimisation.integer

Subclasses of GenericSolver in org.ojalgo.optimisation.integer

Modifier and Type	Class	Description
final class	GomorySolver	An alternative MIP solver using Gomory Mixed Integer (GMI) cuts – purely iterative with no branching.
final class	IntegerSolver

Uses of GenericSolver in org.ojalgo.optimisation.linear

Subclasses of GenericSolver in org.ojalgo.optimisation.linear

Modifier and Type	Class	Description
(package private) final class	DualSimplexSolver	Requires all variables to have both lower and upper bounds.
class	LinearSolver
(package private) final class	PhasedSimplexSolver	First runs the dual algorithm (with a possibly modified objective function) to establish feasibility, and then the primal to reach optimality.
(package private) final class	PrimalSimplexSolver	Requires the initial basis to be feasible (doesn't do a phase-1).
(package private) class	SimplexSolver	Meant to replace SimplexTableauSolver.
(package private) final class	SimplexTableauSolver	Classic simplex tableau solver: Primal algorithm 2-phase All variables assumed >=0, and RHS required to be >=0 Variable bounds other than >=0 handled like constraints