Uses of Interface
org.ojalgo.optimisation.Optimisation
Packages that use Optimisation
Package
Description
-
Uses of Optimisation in org.ojalgo.optimisation
Subinterfaces of Optimisation in org.ojalgo.optimisationModifier and TypeInterfaceDescriptionstatic interface
Connects solver constraints and variables back to model entities.static interface
Constraintstatic interface
Optimisation.Integration<M extends Optimisation.Model,
S extends Optimisation.Solver> AnOptimisation.Model
implementation should not depend on any specificOptimisation.Solver
, andOptimisation.Solver
implementations should be usable independently of anyOptimisation.Model
.static interface
static interface
Objectivestatic interface
Basic description of the size/structure of an optimisation problem.static interface
An Optimisation.Solver instance implements a specific optimisation algorithm.interface
Classes in org.ojalgo.optimisation that implement OptimisationModifier and TypeClassDescription(package private) final class
ConfiguredIntegration<S extends Optimisation.Solver>
final class
Think of an Expression as one constraint or a component to the objective function.final class
Lets you construct optimisation problems by combining (mathematical) expressions in terms of variables.(package private) static final class
static final class
Counts of different kinds of model entities.static class
Optimisation.Solver
:s that should be usabale fromExpressionsBasedModel
needs to implement a subclass of this.class
static class
GenericSolver.Builder<B extends GenericSolver.Builder<B,
S>, S extends GenericSolver> class
AOptimisation.Solver
implementation that wraps anExpressionsBasedModel
.class
ModelEntity<ME extends ModelEntity<ME>>
Model entities are identified and compared by their names only.static enum
static final class
static final class
static enum
static enum
final class
Variable -
Uses of Optimisation in org.ojalgo.optimisation.convex
Classes in org.ojalgo.optimisation.convex that implement OptimisationModifier and TypeClassDescription(package private) class
(package private) class
(package private) class
final class
ConvexData<N extends Comparable<N>>
class
ConvexSolver solves optimisation problems of the form:static final class
static final class
(package private) final class
Solves optimisation problems of the form:(package private) final class
Solves optimisation problems of the form:(package private) final class
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
Solves optimisation problems of the form:(package private) final class
Solves optimisation problems of the form: -
Uses of Optimisation in org.ojalgo.optimisation.integer
Classes in org.ojalgo.optimisation.integer that implement OptimisationModifier and TypeClassDescriptionfinal class
An alternative MIP solver using Gomory Mixed Integer (GMI) cuts – purely iterative with no branching.static final class
final class
static final class
final class
-
Uses of Optimisation in org.ojalgo.optimisation.linear
Classes in org.ojalgo.optimisation.linear that implement OptimisationModifier and TypeClassDescription(package private) final class
Requires all variables to have both lower and upper bounds.class
static final class
Compared toinvalid reference
LinearSolver.StandardBuilder
1) Accepts inequality constraints
2) Has relaxed the requiremnt on the RHS to be non-negative (both equalities and inequalities)static final class
(package private) static final class
An integration to a new/alternative/experimental LP-solver.(package private) static final class
(package private) final class
LP (simplex tableau) meta data.(package private) final class
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
Requires the initial basis to be feasible (doesn't do a phase-1).(package private) class
Meant to replaceSimplexTableauSolver
.(package private) final class
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 -
Uses of Optimisation in org.ojalgo.optimisation.service
Classes in org.ojalgo.optimisation.service that implement OptimisationModifier and TypeClassDescriptionfinal class
(package private) final class