线性规划中的单纯形法，单纯形法是求解线性规划的最主要方法，程序首先确定初始可行解，如没有找到，则引入人工变量或松弛变量来求解-Of linear programming simplex method, simplex method for solving linear programming are the most important methods, procedures to determine first of all, the initial feasible solution, such as not found, then the introduction of artificial variables or slack variable is used to solve
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001203s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.107424s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001103s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001144s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001222s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003320s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001041s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003845s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015603s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001196s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 130062 [ RunTime:0.019712s ]
