In this paper, a deterministic bounding procedure for the global optimization of mixed-integer bi-level programming problem is proposed. The aim has been to develop an efficient algorithm deal with case study in electricity retail market. problem, retailer wants define time-of-use tariff structure maximize profits, but he take into account consumers’ reaction by means re-scheduling appliance op...