1. A computer-implemented method for generating a near-optimum product markdown plan for a plurality of uniform pricing levels having a required inventory sell-through target over all of the plurality of uniform pricing levels, the method comprising, executing instructions on a processor to receive uniform pricing level data for a uniform pricing level from a computer-readable data store; executing instructions on a processor to generate a plurality of feasible markdown schedules for the uniform pricing level, wherein each of the plurality of feasible markdown schedules meets all individual constraints for the uniform pricing level; executing instructions on a processor to remove all dominated feasible markdown schedules for the uniform pricing level to generate one or more candidate markdown schedules for the uniform pricing level; executing instructions on a processor to generate the near-optimum product markdown plan of one candidate markdown schedule for each of the plurality of uniform pricing levels, wherein generating the near-optimum product markdown plan includes: executing instructions on a processor to execute a limited exact algorithm solver for a plurality of iterations to generate a product markdown plan on each iteration; wherein a product markdown plan is selected as the near-optimum product markdown plan if the product markdown plan generates an expected revenue within a threshold percentage of a revenue upper bound; executing instructions on a processor to execute a dynamic programming solver to generate the near-optimum product markdown plan if no product markdown plan generated by the limited exact algorithm solver is within the threshold percentage of the revenue upper bound; executing instructions on a processor to store the near-optimum product markdown plan in a computer-readable medium.