SCIL::ILP_Problem Class Reference

#include <ilp_problem.h>

List of all members.

Creation
	ILP_Problem (Optsense optSense, bool price=false)
	The constructor creates a new problme instance for the solution of an ILP.
virtual	~ILP_Problem ()
	The destructor cleans up dynamicaly alocated memory.
Creation of the Model
var	add_variable (double obj, double lBound, double uBound, Vartype vt, Activation a=Static)
cons	add_basic_constraint (cons_sense s, double r, Activation a=Static)
cons	add_basic_constraint (cons_obj *c, Activation a=Static)
var	add_variable (var_obj *v, Activation a=Static)
void	add_sym_constraint (sym_constraint *c)
	adds the symbolic constraint c to the model.
void	set_coefficient (var v, cons i, double d)
void	set_primal_heuristic (primal_heuristic *P)
	adds a primal heuristic to the model.
Inspection of the Model
int	number_of_variables ()
	Returns the number of variables in the model.
int	number_of_constraints ()
	Returns the number of basic constraints in the model.
Configurations
const LEDA::string &	configuration (const LEDA::string &) const
	get the configuration for a string.
LEDA::string &	configuration (const LEDA::string &)
	set the configuration.
void	read_configuration_file (LEDA::string)
	reads a configuration file.
Execution Commands
void	optimize ()
	Computes the optimal solution for the current model.
Exploid the solution
double	get_solution (var v)
	returns the value of $v$ in the best found solution.
double	get_solution (row &r)
	returns the solution found for the row r.

---

Detailed Description

The class for Integer Linear Programming problems

Definition at line 28 of file ilp_problem.h.

---

Constructor & Destructor Documentation

ILP_Problem::ILP_Problem (  Optsense    optSense, bool    price = false )

The constructor needs only the optimization sense, i.e. one of Optsense_Min and Optsense_Max Definition at line 61 of file core-abacus/ilp_problem.cc.

---

Member Function Documentation

cons SCIL::ILP_Problem::add_basic_constraint (  cons_obj *    c, Activation    a = Static )

adds an instance of a basic-constraint-schema to the root of the BCP-tree. Definition at line 131 of file core-abacus/ilp_problem.cc. References SCIL::cons_obj::Acons(), and SCIL::cons_obj::init().

cons SCIL::ILP_Problem::add_basic_constraint (  cons_sense    s, double    r, Activation    a = Static )

adds a primitive basic constraint to the root of the BCP-tree. s specifies the sense (one of Less, Equal, or Greater) and r the right-hand-side of the constraint. Definition at line 142 of file core-abacus/ilp_problem.cc. References SCIL::cons_obj::set_rhs(), and SCIL::cons_obj::set_sense().

var SCIL::ILP_Problem::add_variable (  var_obj *    v, Activation    a = Static )

adds the instance of the variable-schema to the root of the BCP-tree. Definition at line 117 of file core-abacus/ilp_problem.cc. References SCIL::var_obj::AVar(), and SCIL::var_obj::init().

var SCIL::ILP_Problem::add_variable (  double    obj, double    lBound, double    uBound, Vartype    vt, Activation    a = Static )

adds a primitve variable to the root of the BCP-tree. obj specifies the objectiv function value, lBound and uBound the lower and upper bound of the variable and vt the type of the variable (one of Vartype_Integer or Vartype_Continous). Activation specifies, if the system is allowed to remove the variable from the LP or not. Definition at line 98 of file core-abacus/ilp_problem.cc.

void ILP_Problem::set_coefficient (  var    v, cons    i, double    d )

sets the coefficient for variable v and ineqality i to d in the LP-Matrix. Definition at line 158 of file core-abacus/ilp_problem.cc.

---

The documentation for this class was generated from the following files:

• ilp_problem.h
• core-abacus/ilp_problem.cc
• core-scip/ilp_problem.cc

---