lt

LT Checks if polytope P is a strict subset of polytope Q

 status = lt(P,Q,Options)

 ---------------------------------------------------------------------------
 DESCRIPTION
 ---------------------------------------------------------------------------
 STATUS = LT(P,Q) returns TRUE (1) if P<Q (i.e. P is a strict subset of Q)

 USAGE:
   P<Q
   lt(P,Q)
   lt(P,Q,Options)

 NOTE:
   comparing two polyarrays involves making a minkowski sum of one of them
   with an epsilon-box. This operation is computationally very expensive, so
   try to use no-strict operator (<=) if possible.

 NOTE:
   If P is an empty polytope, the statement is always TRUE
   If Q is an empty polytope, the statement is always FALSE

 ---------------------------------------------------------------------------
 INPUT
 ---------------------------------------------------------------------------
 P,Q                 - Polytopes
 Options.rel_tol     - relative tolerance
 Options.abs_tol     - absolute tolerance
 Options.lpsolver    - LP solver to use (see help mpt_solveLP)
 Options.verbose     - level of verbosity
 Options.elementwise - compares two polyarrays elementwise

 Note: If Options is missing or some of the fields are not defined, the default
       values from mptOptions will be used

 ---------------------------------------------------------------------------
 OUTPUT                                                                                                    
 ---------------------------------------------------------------------------
 status           - Logical statement (true if P<Q, false otherwise)

 see also LE, GT, EQ, NE, GE