| basic_vars | Aleph::Simplex< T > | mutableprivate |
| compute_pivot_col() const noexcept | Aleph::Simplex< T > | inlineprivate |
| compute_pivot_row(int p) const noexcept | Aleph::Simplex< T > | inlineprivate |
| count_artificial_vars() const noexcept | Aleph::Simplex< T > | inlineprivate |
| create_matrix() | Aleph::Simplex< T > | inlineprivate |
| create_restriction(ConstraintType type=ConstraintType::LE) | Aleph::Simplex< T > | inlineprivate |
| dual_solve() | Aleph::Simplex< T > | inline |
| enable_bland_rule() noexcept | Aleph::Simplex< T > | inline |
| eps | Aleph::Simplex< T > | private |
| find_value(const size_t j) const noexcept | Aleph::Simplex< T > | inlineprivate |
| get_all_reduced_costs() const | Aleph::Simplex< T > | inline |
| get_all_shadow_prices() const | Aleph::Simplex< T > | inline |
| get_degenerate_pivot_count() const noexcept | Aleph::Simplex< T > | inline |
| get_elapsed_time_ms() const noexcept | Aleph::Simplex< T > | inline |
| get_iteration_count() const noexcept | Aleph::Simplex< T > | inline |
| get_num_restrictions() const noexcept | Aleph::Simplex< T > | inline |
| get_num_vars() const noexcept | Aleph::Simplex< T > | inline |
| get_objetive_function() noexcept | Aleph::Simplex< T > | inline |
| get_objetive_function() const noexcept | Aleph::Simplex< T > | inline |
| get_objetive_function_coef(size_t i) const | Aleph::Simplex< T > | inline |
| get_optimization_type() const noexcept | Aleph::Simplex< T > | inline |
| get_pivot_count() const noexcept | Aleph::Simplex< T > | inline |
| get_restriction(const size_t rest_num) | Aleph::Simplex< T > | inline |
| get_restriction_coef(const size_t rest_num, size_t idx) | Aleph::Simplex< T > | inline |
| get_solution(size_t i) const noexcept | Aleph::Simplex< T > | inline |
| get_state() const noexcept | Aleph::Simplex< T > | inline |
| get_stats() const noexcept | Aleph::Simplex< T > | inline |
| is_basic_variable(size_t var_idx) const | Aleph::Simplex< T > | inline |
| latex_linear_program(const std::string &name) const | Aleph::Simplex< T > | inline |
| latex_matrix(const std::string &name, const int d=2, const int p=-1, const int q=-1) const | Aleph::Simplex< T > | inline |
| latex_solve(const char *name=nullptr) | Aleph::Simplex< T > | inline |
| load_solution() noexcept | Aleph::Simplex< T > | inline |
| m | Aleph::Simplex< T > | private |
| Not_Solved enum value | Aleph::Simplex< T > | |
| num_artificial | Aleph::Simplex< T > | private |
| num_rest | Aleph::Simplex< T > | private |
| num_var | Aleph::Simplex< T > | private |
| objective_sensitivity(size_t var_idx) const | Aleph::Simplex< T > | inline |
| objetive | Aleph::Simplex< T > | private |
| objetive_value() const noexcept | Aleph::Simplex< T > | inline |
| operator=(const Simplex &)=delete | Aleph::Simplex< T > | |
| operator=(Simplex &&)=default | Aleph::Simplex< T > | |
| opt_type | Aleph::Simplex< T > | private |
| pivot_col_buffer | Aleph::Simplex< T > | mutableprivate |
| pivot_row_buffer | Aleph::Simplex< T > | mutableprivate |
| pivot_rule | Aleph::Simplex< T > | private |
| PivotRule enum name | Aleph::Simplex< T > | |
| prepare_linear_program() | Aleph::Simplex< T > | inline |
| print_matrix() const | Aleph::Simplex< T > | inline |
| print_sensitivity_analysis() const | Aleph::Simplex< T > | inline |
| print_stats() const | Aleph::Simplex< T > | inline |
| put_eq_restriction(const T *coefs) | Aleph::Simplex< T > | inline |
| put_ge_restriction(const T *coefs) | Aleph::Simplex< T > | inline |
| put_objetive_function(const DynArray< T > &coefs) | Aleph::Simplex< T > | inline |
| put_objetive_function(const T coefs[]) | Aleph::Simplex< T > | inline |
| put_objetive_function_coef(size_t i, const T &coef) | Aleph::Simplex< T > | inline |
| put_restriction(const T *coefs=nullptr, ConstraintType type=ConstraintType::LE) | Aleph::Simplex< T > | inline |
| put_restriction(const DynArray< T > &coefs, ConstraintType type=ConstraintType::LE) | Aleph::Simplex< T > | inline |
| put_restriction_coef(const size_t rest_num, const size_t idx, const T &coef) | Aleph::Simplex< T > | inline |
| reduced_cost(size_t var_idx) const | Aleph::Simplex< T > | inline |
| rest_list | Aleph::Simplex< T > | private |
| rest_types | Aleph::Simplex< T > | private |
| rhs_sensitivity(size_t rest_idx) const | Aleph::Simplex< T > | inline |
| select_pivot(int &p, int &q) noexcept | Aleph::Simplex< T > | inlineprivate |
| set_epsilon(T epsilon) noexcept | Aleph::Simplex< T > | inline |
| set_maximize() noexcept | Aleph::Simplex< T > | inline |
| set_minimize() noexcept | Aleph::Simplex< T > | inline |
| set_optimization_type(OptimizationType type) noexcept | Aleph::Simplex< T > | inline |
| set_pivot_rule(PivotRule rule) noexcept | Aleph::Simplex< T > | inline |
| shadow_price(size_t rest_idx) const | Aleph::Simplex< T > | inline |
| Simplex(const size_t n, OptimizationType type=OptimizationType::Maximize) | Aleph::Simplex< T > | inlineexplicit |
| Simplex(const Simplex &)=delete | Aleph::Simplex< T > | |
| Simplex(Simplex &&)=default | Aleph::Simplex< T > | |
| solution | Aleph::Simplex< T > | private |
| solve() | Aleph::Simplex< T > | inline |
| Solved enum value | Aleph::Simplex< T > | |
| Solving enum value | Aleph::Simplex< T > | |
| State enum name | Aleph::Simplex< T > | |
| state | Aleph::Simplex< T > | private |
| stats | Aleph::Simplex< T > | mutableprivate |
| to_pivot(size_t p, size_t q) | Aleph::Simplex< T > | inlineprivate |
| Unbounded enum value | Aleph::Simplex< T > | |
| Unfeasible enum value | Aleph::Simplex< T > | |
| update_rhs_and_reoptimize(size_t rest_idx, T new_rhs) | Aleph::Simplex< T > | inline |
| verify_rest_index(const size_t i) const | Aleph::Simplex< T > | inlineprivate |
| verify_solution() const | Aleph::Simplex< T > | inline |
| verify_var_index(const size_t i) const | Aleph::Simplex< T > | inlineprivate |
| ~Simplex() | Aleph::Simplex< T > | inline |
1.9.8