Arageli::simplex_method::linear_prog_task< T, REFCNT > Class Template Reference

Model of the linear programming task with partial integer constraints. More...

#include <simplex_method.hpp>

Inheritance diagram for Arageli::simplex_method::linear_prog_task< T, REFCNT >:

List of all members.

Public Types
typedef vector< T, REFCNT >	c_type
typedef matrix< T, REFCNT >	a_type
typedef vector< T, REFCNT >	b_type
typedef vector< constraint_type, REFCNT >	relation_type
typedef vector< constraint_type, REFCNT >	individual_type
Public Member Functions
	linear_prog_task ()
	linear_prog_task (const c_type &c_a, const a_type &a_a, const b_type &b_a, const relation_type &relation_a, const individual_type &individual_a, optimum_type optimum_a=ot_max)
	linear_prog_task (const c_type &c_a, const a_type &a_a, const b_type &b_a, optimum_type optimum_a=ot_max)
optimum_type	optimum () const
const c_type &	c () const
const a_type &	a () const
const b_type &	b () const
const relation_type &	relation () const
const individual_type &	individual () const
bool	is_canonical () const
bool	is_standard () const
bool	is_integer () const
bool	is_partial_integer () const
bool	is_normal () const
void	change_optimal (optimum_type)
void	canonical ()
void	standard ()
void	dual ()

---

Detailed Description

template<typename T, bool REFCNT = true>
class Arageli::simplex_method::linear_prog_task< T, REFCNT >

Model of the linear programming task with partial integer constraints.

c*x -> min/max, A*x RELATION b, where RELATION is vector relations (for each row)

Definition at line 2366 of file simplex_method.hpp.

---

Member Typedef Documentation

template<typename T, bool REFCNT = true>

typedef matrix<T, REFCNT> Arageli::simplex_method::linear_prog_task< T, REFCNT >::a_type

Definition at line 2371 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

typedef vector<T, REFCNT> Arageli::simplex_method::linear_prog_task< T, REFCNT >::b_type

Definition at line 2372 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

typedef vector<T, REFCNT> Arageli::simplex_method::linear_prog_task< T, REFCNT >::c_type

Definition at line 2370 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

typedef vector<constraint_type, REFCNT> Arageli::simplex_method::linear_prog_task< T, REFCNT >::individual_type

Definition at line 2374 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

typedef vector<constraint_type, REFCNT> Arageli::simplex_method::linear_prog_task< T, REFCNT >::relation_type

Definition at line 2373 of file simplex_method.hpp.

---

Constructor & Destructor Documentation

template<typename T, bool REFCNT = true>

Arageli::simplex_method::linear_prog_task< T, REFCNT >::linear_prog_task

(

)

[inline]

Definition at line 2376 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

Arageli::simplex_method::linear_prog_task< T, REFCNT >::linear_prog_task	(	const c_type &	c_a,
		const a_type &	a_a,
		const b_type &	b_a,
		const relation_type &	relation_a,
		const individual_type &	individual_a,
		optimum_type	optimum_a = ot_max
	)			[inline]

Definition at line 2379 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

Arageli::simplex_method::linear_prog_task< T, REFCNT >::linear_prog_task	(	const c_type &	c_a,
		const a_type &	a_a,
		const b_type &	b_a,
		optimum_type	optimum_a = ot_max
	)			[inline]

Definition at line 2398 of file simplex_method.hpp.

---

Member Function Documentation

template<typename T, bool REFCNT = true>

const a_type& Arageli::simplex_method::linear_prog_task< T, REFCNT >::a

(

)

const [inline]

Definition at line 2415 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

const b_type& Arageli::simplex_method::linear_prog_task< T, REFCNT >::b

(

)

const [inline]

Definition at line 2416 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

const c_type& Arageli::simplex_method::linear_prog_task< T, REFCNT >::c

(

)

const [inline]

Definition at line 2414 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

void Arageli::simplex_method::linear_prog_task< T, REFCNT >::canonical

(

)

[inline]

Definition at line 2429 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

void Arageli::simplex_method::linear_prog_task< T, REFCNT >::change_optimal

(

optimum_type

)

template<typename T, bool REFCNT = true>

void Arageli::simplex_method::linear_prog_task< T, REFCNT >::dual

(

)

template<typename T, bool REFCNT = true>

const individual_type& Arageli::simplex_method::linear_prog_task< T, REFCNT >::individual

(

)

const [inline]

Definition at line 2418 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

bool Arageli::simplex_method::linear_prog_task< T, REFCNT >::is_canonical

(

)

const

template<typename T, bool REFCNT = true>

bool Arageli::simplex_method::linear_prog_task< T, REFCNT >::is_integer

(

)

const

template<typename T, bool REFCNT = true>

bool Arageli::simplex_method::linear_prog_task< T, REFCNT >::is_normal

(

)

const

template<typename T, bool REFCNT = true>

bool Arageli::simplex_method::linear_prog_task< T, REFCNT >::is_partial_integer

(

)

const

template<typename T, bool REFCNT = true>

bool Arageli::simplex_method::linear_prog_task< T, REFCNT >::is_standard

(

)

const

template<typename T, bool REFCNT = true>

optimum_type Arageli::simplex_method::linear_prog_task< T, REFCNT >::optimum

(

)

const [inline]

Definition at line 2413 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

const relation_type& Arageli::simplex_method::linear_prog_task< T, REFCNT >::relation

(

)

const [inline]

Definition at line 2417 of file simplex_method.hpp.

template<typename T, bool REFCNT = true>

void Arageli::simplex_method::linear_prog_task< T, REFCNT >::standard

(

)

---

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

• simplex_method.hpp

---