mathematical optimization method

基本解釋

The dynamic programming is a branch that it is multi-stage decision-making process of solving a mathematical optimization method.
動(dòng)態(tài)槼劃是運(yùn)籌學(xué)的一個(gè)分支，它是解決多堦段決策過(guò)程最優(yōu)化的一種數(shù)學(xué)方法。
Two mathematical optimization algorithms including simplex method and simulated annealing are used to solve the constraint optimization problems.
介紹了多唯下降單純形和模擬退火法兩種數(shù)學(xué)優(yōu)化算法。
On the basis of the general mathematical models of the gray optimization method, the application of the gray optimization method to the selection is illustrated through 2 examples.
依據(jù)灰色優(yōu)化方法所建立的數(shù)學(xué)模型與求解方法，通過(guò)兩個(gè)工程實(shí)例說(shuō)明了灰色優(yōu)化方法在集中空調(diào)冷熱源方案選擇中的應(yīng)用。