, including all inherited members.
| add_constraint(const Constraint &c) | Parma_Polyhedra_Library::MIP_Problem | |
| add_constraints(const Constraint_System &cs) | Parma_Polyhedra_Library::MIP_Problem | |
| add_space_dimensions_and_embed(dimension_type m) | Parma_Polyhedra_Library::MIP_Problem | |
| add_to_integer_space_dimensions(const Variables_Set &i_vars) | Parma_Polyhedra_Library::MIP_Problem | |
| ascii_dump() const | Parma_Polyhedra_Library::MIP_Problem | |
| ascii_dump(std::ostream &s) const | Parma_Polyhedra_Library::MIP_Problem | |
| ascii_load(std::istream &s) | Parma_Polyhedra_Library::MIP_Problem | |
| base | Parma_Polyhedra_Library::MIP_Problem | [private] |
| choose_branching_variable(const MIP_Problem &lp, const Variables_Set &i_vars, dimension_type &branching_index) | Parma_Polyhedra_Library::MIP_Problem | [private, static] |
| clear() | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| compute_generator() const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| compute_simplex_using_exact_pricing() | Parma_Polyhedra_Library::MIP_Problem | [private] |
| compute_simplex_using_steepest_edge_float() | Parma_Polyhedra_Library::MIP_Problem | [private] |
| compute_tableau(std::vector< dimension_type > &worked_out_row) | Parma_Polyhedra_Library::MIP_Problem | [private] |
| const_iterator typedef | Parma_Polyhedra_Library::MIP_Problem | |
| Constraint_Sequence typedef | Parma_Polyhedra_Library::MIP_Problem | [private] |
| constraints_begin() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| constraints_end() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| Control_Parameter_Name enum name | Parma_Polyhedra_Library::MIP_Problem | |
| Control_Parameter_Value enum name | Parma_Polyhedra_Library::MIP_Problem | |
| erase_artificials(dimension_type begin_artificials, dimension_type end_artificials) | Parma_Polyhedra_Library::MIP_Problem | [private] |
| evaluate_objective_function(const Generator &evaluating_point, Coefficient &num, Coefficient &den) const | Parma_Polyhedra_Library::MIP_Problem | |
| external_memory_in_bytes() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| external_space_dim | Parma_Polyhedra_Library::MIP_Problem | [private] |
| feasible_point() const | Parma_Polyhedra_Library::MIP_Problem | |
| first_pending_constraint | Parma_Polyhedra_Library::MIP_Problem | [private] |
| get_control_parameter(Control_Parameter_Name name) const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| get_exiting_base_index(dimension_type entering_var_index) const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| i_variables | Parma_Polyhedra_Library::MIP_Problem | [private] |
| initialized | Parma_Polyhedra_Library::MIP_Problem | [private] |
| input_cs | Parma_Polyhedra_Library::MIP_Problem | [private] |
| input_obj_function | Parma_Polyhedra_Library::MIP_Problem | [private] |
| integer_space_dimensions() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| internal_space_dim | Parma_Polyhedra_Library::MIP_Problem | [private] |
| is_in_base(dimension_type var_index, dimension_type &row_index) const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| is_lp_satisfiable() const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| is_mip_satisfiable(MIP_Problem &lp, const Variables_Set &i_vars, Generator &p) | Parma_Polyhedra_Library::MIP_Problem | [private, static] |
| is_satisfiable() const | Parma_Polyhedra_Library::MIP_Problem | |
| is_satisfied(const Constraint &c, const Generator &g) | Parma_Polyhedra_Library::MIP_Problem | [private, static] |
| is_saturated(const Constraint &c, const Generator &g) | Parma_Polyhedra_Library::MIP_Problem | [private, static] |
| last_generator | Parma_Polyhedra_Library::MIP_Problem | [private] |
| linear_combine(Row &x, const Row &y, const dimension_type k) | Parma_Polyhedra_Library::MIP_Problem | [private, static] |
| mapping | Parma_Polyhedra_Library::MIP_Problem | [private] |
| max_space_dimension() | Parma_Polyhedra_Library::MIP_Problem | [inline, static] |
| merge_split_variable(dimension_type var_index) | Parma_Polyhedra_Library::MIP_Problem | [private] |
| MIP_Problem(dimension_type dim=0) | Parma_Polyhedra_Library::MIP_Problem | [explicit] |
| MIP_Problem(dimension_type dim, In first, In last, const Variables_Set &int_vars, const Linear_Expression &obj=Linear_Expression::zero(), Optimization_Mode mode=MAXIMIZATION) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| MIP_Problem(dimension_type dim, In first, In last, const Linear_Expression &obj=Linear_Expression::zero(), Optimization_Mode mode=MAXIMIZATION) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| MIP_Problem(dimension_type dim, const Constraint_System &cs, const Linear_Expression &obj=Linear_Expression::zero(), Optimization_Mode mode=MAXIMIZATION) | Parma_Polyhedra_Library::MIP_Problem | |
| MIP_Problem(const MIP_Problem &y) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| objective_function() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| OK() const | Parma_Polyhedra_Library::MIP_Problem | |
| operator<<(std::ostream &s, const MIP_Problem &lp) | Parma_Polyhedra_Library::MIP_Problem | [related] |
| operator=(const MIP_Problem &y) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| opt_mode | Parma_Polyhedra_Library::MIP_Problem | [private] |
| optimal_value(Coefficient &num, Coefficient &den) const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| optimization_mode() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| OPTIMIZED enum value | Parma_Polyhedra_Library::MIP_Problem | [private] |
| optimizing_point() const | Parma_Polyhedra_Library::MIP_Problem | |
| parse_constraints(dimension_type &additional_tableau_rows, dimension_type &additional_slack_variables, std::deque< bool > &is_tableau_constraint, std::deque< bool > &is_satisfied_inequality, std::deque< bool > &is_nonnegative_variable, std::deque< bool > &is_remergeable_variable) const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| PARTIALLY_SATISFIABLE enum value | Parma_Polyhedra_Library::MIP_Problem | [private] |
| pivot(dimension_type entering_var_index, dimension_type exiting_base_index) | Parma_Polyhedra_Library::MIP_Problem | [private] |
| PRICING enum value | Parma_Polyhedra_Library::MIP_Problem | |
| pricing | Parma_Polyhedra_Library::MIP_Problem | [private] |
| PRICING_STEEPEST_EDGE_EXACT enum value | Parma_Polyhedra_Library::MIP_Problem | |
| PRICING_STEEPEST_EDGE_FLOAT enum value | Parma_Polyhedra_Library::MIP_Problem | |
| PRICING_TEXTBOOK enum value | Parma_Polyhedra_Library::MIP_Problem | |
| print() const | Parma_Polyhedra_Library::MIP_Problem | |
| process_pending_constraints() | Parma_Polyhedra_Library::MIP_Problem | [private] |
| RAII_Temporary_Real_Relaxation class | Parma_Polyhedra_Library::MIP_Problem | [friend] |
| SATISFIABLE enum value | Parma_Polyhedra_Library::MIP_Problem | [private] |
| second_phase() | Parma_Polyhedra_Library::MIP_Problem | [private] |
| set_control_parameter(Control_Parameter_Value value) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| set_objective_function(const Linear_Expression &obj) | Parma_Polyhedra_Library::MIP_Problem | |
| set_optimization_mode(Optimization_Mode mode) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| solve() const | Parma_Polyhedra_Library::MIP_Problem | |
| solve_mip(bool &have_incumbent_solution, mpq_class &incumbent_solution_value, Generator &incumbent_solution_point, MIP_Problem &mip, const Variables_Set &i_vars) | Parma_Polyhedra_Library::MIP_Problem | [private, static] |
| space_dimension() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| status | Parma_Polyhedra_Library::MIP_Problem | [private] |
| Status enum name | Parma_Polyhedra_Library::MIP_Problem | [private] |
| steepest_edge_exact_entering_index() const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| steepest_edge_float_entering_index() const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| swap(MIP_Problem &y) | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| swap(Parma_Polyhedra_Library::MIP_Problem &x, Parma_Polyhedra_Library::MIP_Problem &y) | Parma_Polyhedra_Library::MIP_Problem | [related] |
| tableau | Parma_Polyhedra_Library::MIP_Problem | [private] |
| textbook_entering_index() const | Parma_Polyhedra_Library::MIP_Problem | [private] |
| total_memory_in_bytes() const | Parma_Polyhedra_Library::MIP_Problem | [inline] |
| UNBOUNDED enum value | Parma_Polyhedra_Library::MIP_Problem | [private] |
| UNSATISFIABLE enum value | Parma_Polyhedra_Library::MIP_Problem | [private] |
| working_cost | Parma_Polyhedra_Library::MIP_Problem | [private] |
| ~MIP_Problem() | Parma_Polyhedra_Library::MIP_Problem | [inline] |