Simplex method for objective optimization of xinan
2016-08-23
0 0 0
4.0
Other
Earn points
1953 United States mathematician G.B. Danzig for improved simplex method of accumulated rounding errors in each iteration, modified simplex method is proposed. Roughly the same basic steps, and the simplex method, the main difference is in the successive iterations no longer based on Gaussian elimination, but directly by the inverse of the old array to new array to calculate the inverse, and then determine the number of tests. Doing so can reduce the accumulated error iterations, improves the accuracy, but also reduces the storage on your computer. Optimum seeking method in mathematics is to find a faster more accurate calculation method of extreme value of function. 1953 United States mathematician j. Kiefer made a single factor and 0.618 optimization which fraction method (also known as the Golden law), later parabola method is proposed. As for two-factor and multi-factor optimization method, it involves more complicated issues, methods and ideas are more commonly u
vb
模型
参数
单纯
客观
优选法
新安江
Related Source Codes
Student Management System
0
0
no vote
FTP upload and download written in VB
0
0
no vote
Qq batch login
0
0
no vote
Example MSNPopup
0
0
no vote
Password management software
0
0
no vote
No comment