OptimumSolverSimplex.hpp
54 auto feasible(const OptimumProblem& problem, OptimumState& state, const OptimumOptions& options) -> OptimumResult;
60 auto simplex(const OptimumProblem& problem, OptimumState& state, const OptimumOptions& options) -> OptimumResult;
71 virtual auto solve(const OptimumProblem& problem, OptimumState& state, const OptimumOptions& options) -> OptimumResult;
The class that implements the simplex algorithm for linear programming problems.
Definition: OptimumSolverSimplex.hpp:36
auto feasible(const OptimumProblem &problem, OptimumState &state, const OptimumOptions &options) -> OptimumResult
Find a feasible point for the linear optimisation problem.
Definition: OptimumSolverSimplex.cpp:478
The base class for all optimization algorithms.
Definition: OptimumSolverBase.hpp:36
virtual auto clone() const -> OptimumSolverBase *
Return a clone of this instance.
Definition: OptimumSolverSimplex.cpp:506
OptimumSolverSimplex()
Construct a default OptimumSolverSimplex instance.
Definition: OptimumSolverSimplex.cpp:461
A type that describes the non-linear constrained optimisation problem.
Definition: OptimumProblem.hpp:49
The namespace containing all components of the Reaktoro library.
Definition: ChemicalScalar.hpp:24
auto operator=(OptimumSolverSimplex other) -> OptimumSolverSimplex &
Assign a copy of an OptimumSolverSimplex instance.
Definition: OptimumSolverSimplex.cpp:472
virtual auto dxdp(VectorConstRef dgdp, VectorConstRef dbdp) -> Vector
Return the sensitivity dx/dp of the solution x with respect to a vector of parameters p.
Definition: OptimumSolverSimplex.cpp:499
A type that describes the options of a optimisation calculation.
Definition: OptimumOptions.hpp:187
virtual ~OptimumSolverSimplex()
Destroy this OptimumSolverSimplex instance.
Definition: OptimumSolverSimplex.cpp:469
A type that describes the state of an optimum solution.
Definition: OptimumState.hpp:29
A type that describes the result of an optimisation calculation.
Definition: OptimumResult.hpp:24
auto simplex(const OptimumProblem &problem, OptimumState &state, const OptimumOptions &options) -> OptimumResult
Solve the linear optimisation problem with starting from a feasible point.
Definition: OptimumSolverSimplex.cpp:483
virtual auto solve(const OptimumProblem &problem, OptimumState &state) -> OptimumResult
Solve the linear optimisation problem by finding a feasible point and then applying a simplex algorit...
Definition: OptimumSolverSimplex.cpp:488
Eigen::Ref< const Eigen::VectorXd > VectorConstRef
< Alias to Eigen type Ref<VectorXd>.
Definition: Matrix.hpp:31