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 interfaceConnects solver constraints and variables back to model entities.static interfaceConstraintstatic interfaceOptimisation.Integration<M extends Optimisation.Model, S extends Optimisation.Solver>AnOptimisation.Modelimplementation should not depend on any specificOptimisation.Solver, andOptimisation.Solverimplementations should be usable independently of anyOptimisation.Model.static interfacestatic interfaceObjectivestatic interfaceBasic description of the size/structure of an optimisation problem.static interfaceAn Optimisation.Solver instance implements a specific optimisation algorithm.interfaceClasses in org.ojalgo.optimisation that implement OptimisationModifier and TypeClassDescription(package private) final classConfiguredIntegration<S extends Optimisation.Solver>final classExpression represents a mathematical expression in the optimization model that can serve as either a constraint or a component of the objective function.final classLets you construct optimisation problems by combining (mathematical) expressions in terms of variables.(package private) static final classstatic final classCounts of different kinds of model entities.static classOptimisation.Solver:s that should be usabale fromExpressionsBasedModelneeds to implement a subclass of this.(package private) static final classclassstatic classGenericSolver.Builder<B extends GenericSolver.Builder<B,S>, S extends GenericSolver> classAOptimisation.Solverimplementation that wraps anExpressionsBasedModel.classModelEntity<ME extends ModelEntity<ME>>ModelEntity is the abstract base class for optimization model components such as variables and expressions in ojAlgo's optimization framework.static enumstatic final classstatic final classstatic enumstatic enumfinal classVariable represents a decision variable in an optimization model. -
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) classfinal classConvexData<N extends Comparable<N>>classConvexSolver solves optimisation problems of the form:static final classstatic final class(package private) final classSolves optimisation problems of the form:(package private) final classSolves optimisation problems of the form:(package private) final classAlgorithm 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 classAlgorithm 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 classAlgorithm 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) classProof-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 classSolves optimisation problems of the form:(package private) final classSolves optimisation problems of the form: -
Uses of Optimisation in org.ojalgo.optimisation.integer
Classes in org.ojalgo.optimisation.integer that implement OptimisationModifier and TypeClassDescriptionfinal classAn alternative MIP solver using Gomory Mixed Integer (GMI) cuts – purely iterative with no branching.static final classfinal classstatic final classfinal class -
Uses of Optimisation in org.ojalgo.optimisation.linear
Classes in org.ojalgo.optimisation.linear that implement OptimisationModifier and TypeClassDescription(package private) final classRequires all variables to have both lower and upper bounds.classstatic final classCompared tothis builder:invalid 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 classAn integration to a new/alternative/experimental LP-solver.(package private) static final class(package private) final classLP (simplex tableau) meta data.(package private) final classFirst runs the dual algorithm (with a possibly modified objective function) to establish feasibility, and then the primal to reach optimality.(package private) final classRequires the initial basis to be feasible (doesn't do a phase-1).(package private) classMeant to replaceSimplexTableauSolver.(package private) final classClassic 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