MIP_Problem.cc File Reference

#include <ppl-config.h>
#include "MIP_Problem.defs.hh"
#include "globals.defs.hh"
#include "Checked_Number.defs.hh"
#include "Row.defs.hh"
#include "Linear_Expression.defs.hh"
#include "Constraint.defs.hh"
#include "Constraint_System.defs.hh"
#include "Constraint_System.inlines.hh"
#include "Generator.defs.hh"
#include "Scalar_Products.defs.hh"
#include <stdexcept>
#include <deque>
#include <algorithm>
#include <cmath>
#include <iostream>

Include dependency graph for MIP_Problem.cc:

Go to the source code of this file.

Defines
#define	PPL_NOISY_SIMPLEX   0
#define	PPL_SIMPLEX_USE_MIP_HEURISTIC   1
Functions
void	assign (double &d, const mpz_class &c)
template<typename T, typename Policy>
void	assign (double &d, const Parma_Polyhedra_Library::Checked_Number< T, Policy > &c)

---

Define Documentation

#define PPL_NOISY_SIMPLEX   0

Definition at line 40 of file MIP_Problem.cc.

#define PPL_SIMPLEX_USE_MIP_HEURISTIC   1

Definition at line 44 of file MIP_Problem.cc.

---

Function Documentation

template<typename T, typename Policy>

void @65::assign	(	double &	d,
		const Parma_Polyhedra_Library::Checked_Number< T, Policy > &	c
	)			[inline, static]

Definition at line 867 of file MIP_Problem.cc.

References Parma_Polyhedra_Library::raw_value().

                                                                  {
  d = raw_value(c);
}

void @65::assign	(	double &	d,
		const mpz_class &	c
	)			[inline, static]

Definition at line 861 of file MIP_Problem.cc.

Referenced by Parma_Polyhedra_Library::Box< ITV >::add_space_dimensions_and_embed(), Parma_Polyhedra_Library::Box< ITV >::add_space_dimensions_and_project(), Parma_Polyhedra_Library::Grid_Generator_System::affine_image(), Parma_Polyhedra_Library::Generator_System::affine_image(), Parma_Polyhedra_Library::Interval< Boundary, Info >::assign(), Parma_Polyhedra_Library::Box< ITV >::Box(), Parma_Polyhedra_Library::Polyhedron::conversion(), Parma_Polyhedra_Library::Interval< Boundary, Info >::difference_assign(), Parma_Polyhedra_Library::Interval< Boundary, Info >::lower_set(), Parma_Polyhedra_Library::Interval< Boundary, Info >::lower_set_uninit(), Parma_Polyhedra_Library::Interval< Boundary, Info >::refine_existential(), Parma_Polyhedra_Library::Interval< Boundary, Info >::refine_universal(), Parma_Polyhedra_Library::Polyhedron::relation_with(), Parma_Polyhedra_Library::Grid::relation_with(), Parma_Polyhedra_Library::Congruence_System::satisfies_all_congruences(), Parma_Polyhedra_Library::MIP_Problem::steepest_edge_float_entering_index(), Parma_Polyhedra_Library::Interval< Boundary, Info >::upper_set(), and Parma_Polyhedra_Library::Interval< Boundary, Info >::upper_set_uninit().

                                      {
  d = c.get_d();
}