]>On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls : Algorithm 1
Function Polytope-Include  ( d A , b , C , )
(1) c { L e t t h e 𝑖 t h c o n s t r a i n t o f C x d , x 0 b e r e p r e s e n t e d a s 𝐢 x d 𝐢 } .
(2) for ( 𝑖 = 1   to   𝑚 ) do
(3)if ( m a x A 𝟎 𝐱 𝐛 , 𝐱 c 𝐢 x > d 𝐢 ) then
(4)return (false)
(5)end if
(6) end for
(7) return (true)
Algorithm 1: Algorithm for polytope inclusion.