LP_data_and_hook Class Reference

#include <lp.h>

Inheritance diagram for LP_data_and_hook:

Collaboration diagram for LP_data_and_hook:

Public Member Functions
	LP_data_and_hook ()
virtual	~LP_data_and_hook ()
int	compute_rc (const VOL_dvector &u, VOL_dvector &rc)
	compute reduced costs
int	solve_subproblem (const VOL_dvector &u, const VOL_dvector &rc, double &lcost, VOL_dvector &x, VOL_dvector &v, double &pcost)
	Solve the subproblem for the subgradient step.
int	heuristics (const VOL_problem &p, const VOL_dvector &x, double &heur_val)
	Starting from the primal vector x, run a heuristic to produce an integer solution.
Public Attributes
VOL_lp	lp_pb
VOL_dvector	rhs
VOL_ivector	ix
double	icost

Detailed Description

Definition at line 32 of file lp.h.

LP_data_and_hook::LP_data_and_hook ( ) [inline]

Definition at line 39 of file lp.h.

virtual LP_data_and_hook::~LP_data_and_hook ( ) [inline, virtual]

Definition at line 40 of file lp.h.

int LP_data_and_hook::compute_rc	(	const VOL_dvector &	u,
		VOL_dvector &	rc
	)			`[virtual]`

compute reduced costs

Parameters:

	u	(IN) the dual variables
	rc	(OUT) the reduced cost with respect to the dual values

int LP_data_and_hook::solve_subproblem	(	const VOL_dvector &	dual,
		const VOL_dvector &	rc,
		double &	lcost,
		VOL_dvector &	x,
		VOL_dvector &	v,
		double &	pcost
	)			`[virtual]`

Solve the subproblem for the subgradient step.

Parameters:

	dual	(IN) the dual variables
	rc	(IN) the reduced cost with respect to the dual values
	lcost	(OUT) the lagrangean cost with respect to the dual values
	x	(OUT) the primal result of solving the subproblem
	v	(OUT) b-Ax for the relaxed constraints
	pcost	(OUT) the primal objective value of `x`