tg_polyreduce

PURPOSE

SYNOPSIS

DESCRIPTION

 purpose: 
 Given a polyhedron Ax<=B, return an equivalent polyhedron At x<=Bt by
 eliminating redundant constraints.
 Consider only hyperplanes for removal that with indices given in the set 
 'candidates'.
 If cddUse==1, use cdd('find_interior') to determine if the polyhedron is 
 empty (instead of polyreduce) and use cdd('reduce_h') to determine the
 non-redundant hyperplanes (instead of a loop with lpsolve)

 At,Bt        = reduced polyhedron
 isemptypoly  = 1 if (A,B) is empty
 keptrows     = rows of (A,B) kept in (At,Bt)

CROSS-REFERENCE INFORMATION

• length LENGTH Returns number of regions over which the explicit control law is defined
• double DOUBLE Function used to access internal properties of the given polytope
• end END Returns the last element in a given polytope array
• isfulldim ISFULLDIM Checks if a polytope is full dimensional
• length LENGTH Returns number of elements in a polytope array
• polytope POLYTOPE Default constructor for the POLYTOPE object
• reduce REDUCE Reduces the polytope by removing redundant inequalities
• size SIZE Returns size of the given polytope object
• mpt_solveLPi MPT_SOLVELPi Interface to various LP solvers (version without errorchecks)
• polyinnerball CHEBYBALL_F Computes center and radius of the largest ball inscribed in a polytope

• mpt_exHyperAdv ===============================================================================
• mpt_hyparr2 ===============================================================================