On minimizing the size of regions in programs

Different formulations are discussed for the problem of minimizing the total size of data field is reserved in the program. These problems are reduced to those of linear integer programming. A numerical example is given where rearrangement of a real program in compliance with an optimal solution reduces the size of the memory field assigned for storing the data by 40 per cent.