中文说明： uint 承诺问题是非常 imprtant 在电力系统运行分析中的问题。我们可以假设我们有 N 电源发电机组提供给我们，我们有预测的需求送达。问单位承诺问题的区域的问题大约是，如下所示： 鉴于有大量的 N 发电机组以满足预计的需求，其中的这些子集应使用以提供最低运作成本的完整集合子集的？ 在这里我已经解决了此问题使用拉格朗日松弛最小化方法这是一种非常灵活的方法来解决这些问题。附加的代码可能会扩大为更多的单位数。
English Description：
uint commitment problem is very imprtant problem in power systems operation analysis. we may assume that we have N power generating units available to us and that we have a foreast of the demand to be served. The question that is asked in the unit commitment problem area is approximately as follows: Given that there are a number of subsets of the complete set of N generating units that would satisfy the expected demand, which of these subsets should be used in order to provide the minimum operation cost? Here I have solved this problem using Lagrange Relaxation minimization method which is a very flexible method to solve these problems. The codes attached may be expanded for more number of units.