Package org.ojalgo.optimisation.linear
package org.ojalgo.optimisation.linear
-
ClassDescriptionRequires all variables to have both lower and upper bounds.Compared to
invalid reference
LinearSolver.StandardBuilder
1) Accepts inequality constraints
2) Has relaxed the requiremnt on the RHS to be non-negative (both equalities and inequalities)An integration to a new/alternative/experimental LP-solver.LP (simplex tableau) meta data.First runs the dual algorithm (with a possibly modified objective function) to establish feasibility, and then the primal to reach optimality.Requires the initial basis to be feasible (doesn't do a phase-1).Meant to replaceSimplexTableauSolver
.Exit fromSimplexStore.ColumnState.BASIS
to eitherSimplexStore.ColumnState.LOWER
orSimplexStore.ColumnState.UPPER
.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