The topic of unit commitment has been and continues to be of interest to many researchers and is a primary operation for most utilities. Past research has utilized integer programming, dynamic programming, linear programming, gradient, and heuristic techniques. This research combines both linear programming and dynamic programming for unit commitment decisions within a weekly time frame. The result provides most of the advantages of linear programming and dynamic programming with less stringent requirements on the pre solution information needed for unit transition sequences. Further, the research yields a new tool for the solution of the Transaction Evaluation problem. / Ph. D. / incomplete_metadata