The optimizer cannot transform an inequality predicate into an equivalent equality or range predicate(s). Therefore the BITMAP INDEX (RANGE SCAN) and BITMAP INDEX (SINGLE VALUE) access paths are not available for inequality predicates. However, a bitmap index can be used to satisfy an inequality predicate using the BITMAP INDEX (FULL SCAN) access path in the same way that a simple rowid index can be used to satisfy an inequality predicate using the INDEX (FAST FULL SCAN) access path.

Is it absolutely necessary to use an = condition versus a != condition on a bitmap index column to ensure the use of the index by the optimizer?