In this paper we prove existence theorem of upper bound constant of multiplier for ELSP and propose an easily programmable algorithm for solving the problem of determining lot size for n items to be produced on a single machine based on the existence theorem. We give some interesting examples to show the bound constant is useful. In some cases we can find optimal solution immediately with the bound constant and it is difficult to find a feasible solution without this bound constant.