A linear constraint for a linear optimization problem.
Class that represents a set of
An objective function for a linear optimization problem.
Base class for implementing linear optimizers.
A constraint for a linear optimization problem indicating whether all variables must be restricted to non-negative values.
Solves a linear problem using the "Two-Phase Simplex" method.
A callback object that can be provided to a linear optimizer to keep track of the best solution found.
Pivot selection rule to the use for a Simplex solver.
Types of relationships between two cells in a Solver
This class represents exceptions thrown by optimizers when no solution fulfills the constraints.
This class represents exceptions thrown by optimizers when a solution escapes to infinity.
Copyright © 2003–2016 The Apache Software Foundation. All rights reserved.