# Package org.apache.commons.math3.optim.linear

package org.apache.commons.math3.optim.linear
Optimization algorithms for linear constrained problems.

Related Packages
Package
Description
org.apache.commons.math3.optim
Generally, optimizers are algorithms that will either `minimize` or `maximize` a scalar function, called the `objective function`.
org.apache.commons.math3.optim.univariate
One-dimensional optimization algorithms.
Class
Description
LinearConstraint
A linear constraint for a linear optimization problem.
LinearConstraintSet
Class that represents a set of `linear constraints`.
LinearObjectiveFunction
An objective function for a linear optimization problem.
LinearOptimizer
Base class for implementing linear optimizers.
NoFeasibleSolutionException
This class represents exceptions thrown by optimizers when no solution fulfills the constraints.
NonNegativeConstraint
A constraint for a linear optimization problem indicating whether all variables must be restricted to non-negative values.
PivotSelectionRule
Pivot selection rule to the use for a Simplex solver.
Relationship
Types of relationships between two cells in a Solver `LinearConstraint`.
SimplexSolver
Solves a linear problem using the "Two-Phase Simplex" method.
SolutionCallback
A callback object that can be provided to a linear optimizer to keep track of the best solution found.
UnboundedSolutionException
This class represents exceptions thrown by optimizers when a solution escapes to infinity.