The objective of this paper is to derive the analytical solution of the EOQ model of multiple items with both demand-dependent unit cost and leading time using geometric programming approach. The varying purchase and ...The objective of this paper is to derive the analytical solution of the EOQ model of multiple items with both demand-dependent unit cost and leading time using geometric programming approach. The varying purchase and leading time crashing costs are considered to be continuous functions of demand rate and leading time, respectively. The researchers deduce the optimal order quantity, the demand rate and the leading time as decision variables then the optimal total cost is obtained.展开更多
Aproposal to carry out research into the chemistry of molecular agglomerate, jointly made by Tong Zhenhe with CAS Institute of Physical and Chemical Technologies, Jiang Xikui with Shanghai Institute of Organic Chemist...Aproposal to carry out research into the chemistry of molecular agglomerate, jointly made by Tong Zhenhe with CAS Institute of Physical and Chemical Technologies, Jiang Xikui with Shanghai Institute of Organic Chemistry, Shen Jiaocong of Jilin University, and two German and展开更多
安全约束机组组合(security constrained unit commitment,SCUC)是电网出清场景中最为广泛使用的一类模型。建立了一种针对超大规模SCUC现货市场出清问题的求解框架,首先提出了SCUC问题的时间解耦求解方法,通过缩小问题的规模来加快求...安全约束机组组合(security constrained unit commitment,SCUC)是电网出清场景中最为广泛使用的一类模型。建立了一种针对超大规模SCUC现货市场出清问题的求解框架,首先提出了SCUC问题的时间解耦求解方法,通过缩小问题的规模来加快求解速度;其次针对时间解耦后模型的子问题提出了拉格朗日松弛求解技术,在不影响求解准确度的情况下,有效降低了关键困难约束的求解难度。数值实验证明,所提出的框架极大地提升了求解效率,且十分稳定。展开更多
The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex q...The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.展开更多
基金Supported by National High Technology Research and Development Program of China （863 Program） （2006AA04Z183）, National Nat- ural Science Foundation of China （60621001, 60534010, 60572070, 60774048, 60728307）, and the Program for Changjiang Scholars and Innovative Research Groups of China （60728307, 4031002）
文摘The objective of this paper is to derive the analytical solution of the EOQ model of multiple items with both demand-dependent unit cost and leading time using geometric programming approach. The varying purchase and leading time crashing costs are considered to be continuous functions of demand rate and leading time, respectively. The researchers deduce the optimal order quantity, the demand rate and the leading time as decision variables then the optimal total cost is obtained.
文摘Aproposal to carry out research into the chemistry of molecular agglomerate, jointly made by Tong Zhenhe with CAS Institute of Physical and Chemical Technologies, Jiang Xikui with Shanghai Institute of Organic Chemistry, Shen Jiaocong of Jilin University, and two German and
文摘安全约束机组组合(security constrained unit commitment,SCUC)是电网出清场景中最为广泛使用的一类模型。建立了一种针对超大规模SCUC现货市场出清问题的求解框架,首先提出了SCUC问题的时间解耦求解方法,通过缩小问题的规模来加快求解速度;其次针对时间解耦后模型的子问题提出了拉格朗日松弛求解技术,在不影响求解准确度的情况下,有效降低了关键困难约束的求解难度。数值实验证明,所提出的框架极大地提升了求解效率,且十分稳定。
文摘The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.
