In compiler theory, optimization is the process of fine-tuning the output of a compiler to curtail or capitalize on some aspects of an executable computer program. Optimization is commonly implemented using a chain of optimizing transformations, algorithms which inputs a program and transform it to produce an equivalent output program that yields better performance. In this study, we propose a novel technique which involves the concept of dominators to optimize the code. This technique is employed to a graph, depicting the program flow (CFG) from which, the information is extracted and the loop invariants are relocated to the dominating program block there by reducing the redundant computation.