Theoretically, a minimum volume must exist for a particular algorithm Halstead defines a volume ratio L as the ratio of volume of the most compact form of a program to the volume of the actual program. In actuality, L must always be less than l. In terms of primitive measures, the volume ratio may be expressed as