IARoundingHeuristicMINLP Class Reference

#include <IARoundingHeuristicMINLP.hpp>

Inheritance diagram for IARoundingHeuristicMINLP:

List of all members.

Public Member Functions
	IARoundingHeuristicMINLP (const IAData *data_ptr, const IPData *ip_data_ptr, IASolution *solution_ptr)
virtual	~IARoundingHeuristicMINLP ()
Number	eval_R_i (const Number &I_i, const Number &x_i)
Overloaded from TNLP
virtual bool	get_nlp_info (Index &n, Index &m, Index &nnz_jac_g, Index &nnz_h_lag, IndexStyleEnum &index_style)
virtual bool	get_bounds_info (Index n, Number *x_l, Number *x_u, Index m, Number *g_l, Number *g_u)
virtual bool	get_starting_point (Index n, bool init_x, Number *x_init, bool init_z, Number *z_L, Number *z_U, Index m, bool init_lambda, Number *lambda)
virtual bool	eval_f (Index n, const Number *x, bool new_x, Number &obj_value)
virtual bool	eval_grad_f (Index n, const Number *x, bool new_x, Number *grad_f)
virtual bool	eval_g (Index n, const Number *x, bool new_x, Index m, Number *g)
virtual bool	eval_jac_g (Index n, const Number *x, bool new_x, Index m, Index nele_jac, Index *iRow, Index *jCol, Number *values)
virtual bool	eval_h (Index n, const Number *x, bool new_x, Number obj_factor, Index m, const Number *lambda, bool new_lambda, Index nele_hess, Index *iRow, Index *jCol, Number *values)
Solution Methods
virtual void	finalize_solution (SolverReturn status, Index n, const Number *x, const Number *z_L, const Number *z_U, Index m, const Number *g, const Number *lambda, Number obj_value, const IpoptData *ip_data, IpoptCalculatedQuantities *ip_cq)
Private Member Functions
Number	eval_r_i (const Number &I_i, const Number &x_i)
Number	eval_grad_r_i (const Number &I_i, const Number &x_i)
Number	eval_hess_r_i (const Number &I_i, const Number &x_i)
Number	eval_s_i (const Number &I_i, const Number &x_i)
Number	eval_grad_s_i (const Number &I_i, const Number &x_i)
Number	eval_hess_s_i (const Number &I_i, const Number &x_i)
Number	eval_grad_R_i (const Number &I_i, const Number &x_i)
Number	eval_hess_R_i (const Number &I_i, const Number &x_i)
Number	eval_S_i (const Number &I_i, const Number &x_i)
Number	eval_grad_S_i (const Number &I_i, const Number &x_i)
Number	eval_hess_S_i (const Number &I_i, const Number &x_i)
	IARoundingHeuristicMINLP ()
	IARoundingHeuristicMINLP (const IARoundingHeuristicMINLP &)
IARoundingHeuristicMINLP &	operator= (const IARoundingHeuristicMINLP &)
Private Attributes
IANlp	baseNlp
const IAData *	data
const IPData *	ip_data
IASolution *	solution
const bool	debugging
const bool	verbose

---

Detailed Description

Definition at line 52 of file IARoundingHeuristicMINLP.hpp.

---

Constructor & Destructor Documentation

IARoundingHeuristicMINLP	(	const IAData *	data_ptr,
		const IPData *	ip_data_ptr,
		IASolution *	solution_ptr
	)

default constructor

Definition at line 33 of file IARoundingHeuristicMINLP.cpp.

~IARoundingHeuristicMINLP

(

)

[virtual]

default destructor

Definition at line 47 of file IARoundingHeuristicMINLP.cpp.

IARoundingHeuristicMINLP

(

)

[private]

IARoundingHeuristicMINLP

(

const IARoundingHeuristicMINLP &

)

[private]

---

Member Function Documentation

bool eval_f	(	Index	n,
		const Number *	x,
		bool	new_x,
		Number &	obj_value
	)		[virtual]

Method to return the objective value

Definition at line 112 of file IARoundingHeuristicMINLP.cpp.

bool eval_g	(	Index	n,
		const Number *	x,
		bool	new_x,
		Index	m,
		Number *	g
	)		[virtual]

Method to return the constraint residuals

Definition at line 124 of file IARoundingHeuristicMINLP.cpp.

bool eval_grad_f	(	Index	n,
		const Number *	x,
		bool	new_x,
		Number *	grad_f
	)		[virtual]

Method to return the gradient of the objective

Definition at line 118 of file IARoundingHeuristicMINLP.cpp.

Number eval_grad_r_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_grad_R_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_grad_s_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_grad_S_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

bool eval_h	(	Index	n,
		const Number *	x,
		bool	new_x,
		Number	obj_factor,
		Index	m,
		const Number *	lambda,
		bool	new_lambda,
		Index	nele_hess,
		Index *	iRow,
		Index *	jCol,
		Number *	values
	)		[virtual]

Method to return: 1) The structure of the hessian of the lagrangian (if "values" is NULL) 2) The values of the hessian of the lagrangian (if "values" is not NULL)

Definition at line 138 of file IARoundingHeuristicMINLP.cpp.

Number eval_hess_r_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_hess_R_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_hess_s_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_hess_S_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

bool eval_jac_g	(	Index	n,
		const Number *	x,
		bool	new_x,
		Index	m,
		Index	nele_jac,
		Index *	iRow,
		Index *	jCol,
		Number *	values
	)		[virtual]

Method to return: 1) The structure of the jacobian (if "values" is NULL) 2) The values of the jacobian (if "values" is not NULL)

Definition at line 130 of file IARoundingHeuristicMINLP.cpp.

Number eval_r_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_R_i	(	const Number &	I_i,
		const Number &	x_i
	)

Number eval_s_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

Number eval_S_i	(	const Number &	I_i,
		const Number &	x_i
	)		[private]

void finalize_solution	(	SolverReturn	status,
		Index	n,
		const Number *	x,
		const Number *	z_L,
		const Number *	z_U,
		Index	m,
		const Number *	g,
		const Number *	lambda,
		Number	obj_value,
		const IpoptData *	ip_data,
		IpoptCalculatedQuantities *	ip_cq
	)		[virtual]

This method is called when the algorithm is complete so the TNLP can store/write the solution

Definition at line 146 of file IARoundingHeuristicMINLP.cpp.

bool get_bounds_info	(	Index	n,
		Number *	x_l,
		Number *	x_u,
		Index	m,
		Number *	g_l,
		Number *	g_u
	)		[virtual]

Method to return the bounds for my problem

Definition at line 57 of file IARoundingHeuristicMINLP.cpp.

bool get_nlp_info	(	Index &	n,
		Index &	m,
		Index &	nnz_jac_g,
		Index &	nnz_h_lag,
		IndexStyleEnum &	index_style
	)		[virtual]

Method to return some info about the nlp

Definition at line 50 of file IARoundingHeuristicMINLP.cpp.

bool get_starting_point	(	Index	n,
		bool	init_x,
		Number *	x_init,
		bool	init_z,
		Number *	z_L,
		Number *	z_U,
		Index	m,
		bool	init_lambda,
		Number *	lambda
	)		[virtual]

Method to return the starting point for the algorithm

Definition at line 92 of file IARoundingHeuristicMINLP.cpp.

IARoundingHeuristicMINLP& operator=

(

const IARoundingHeuristicMINLP &

)

[private]

---

Member Data Documentation

IANlp baseNlp [private]

Definition at line 127 of file IARoundingHeuristicMINLP.hpp.

const IAData* data [private]

Definition at line 130 of file IARoundingHeuristicMINLP.hpp.

const bool debugging [private]

Definition at line 135 of file IARoundingHeuristicMINLP.hpp.

const IPData* ip_data [private]

Definition at line 131 of file IARoundingHeuristicMINLP.hpp.

IASolution* solution [private]

Definition at line 133 of file IARoundingHeuristicMINLP.hpp.

const bool verbose [private]

Definition at line 136 of file IARoundingHeuristicMINLP.hpp.

---

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

• IARoundingHeuristicMINLP.hpp
• IARoundingHeuristicMINLP.cpp