期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
参与式教学在“数学规划算法”课程中的应用研究 被引量:1
1
作者 李向利 《无线互联科技》 2021年第2期164-166,共3页
“数学规划算法”是运筹学方向研究生的必修学位课。由于课程概念抽象,公式复杂,理论性强,造成学生理解困难。文章探讨了参与式教学在“数学规划算法”课程中的应用,以提高课程的教学质量。
关键词 “数学规划算法” 研究生 参与式教学 同伴互评
下载PDF
Decomposable Algorithm for Large Dynamic Programming 被引量:1
2
作者 徐付霞 史道济 +1 位作者 董永权 王红丽 《Chinese Quarterly Journal of Mathematics》 CSCD 北大核心 2007年第2期220-224,共5页
An approach about large dynamic programming based on discrete linear system with a quadratic index function is proposed by importing two Lagrange multipliers.
关键词 dynamic programming Lagrange multiplier SUBSYSTEM
下载PDF
Ant-cycle based on Metropolis rules for the traveling salesman problem
3
作者 龚劬 《Journal of Chongqing University》 CAS 2005年第4期229-232,共4页
In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) ... In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) and AC for the traveling salesman problem (TSP). The Metropolis rules in SA were applied to AC and turned out an improved AC. The computational results obtained from the case study indicated that the improved AC algorithm has advantages over the sheer SA or unmixed AC. 展开更多
关键词 heuristics algorithm simulate annealing algorithm metropolis rules ant colony algorithm ant-cycle algorithm traveling salesman problem (TSP)
下载PDF
Filter-sequence of quadratic programming method with nonlinear complementarity problem function
4
作者 金中 濮定国 +1 位作者 张宇 蔡力 《Journal of Shanghai University(English Edition)》 CAS 2008年第2期97-101,共5页
A mechanism for proving global convergence in filter-SQP (sequence of quadratic programming) method with the nonlinear complementarity problem (NCP) function is described for constrained nonlinear optimization pro... A mechanism for proving global convergence in filter-SQP (sequence of quadratic programming) method with the nonlinear complementarity problem (NCP) function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions. 展开更多
关键词 nonlinear complementarity problem (NCP) function FILTER sequence of quadratic programming (SQP) globalconvergence.
下载PDF
A High-Order Dikin-Type Algorithm for P*(k)-LCPs in a Wide Neighborhood of the Central Path
5
作者 GONG Xiao Yu ZHANG Ming Wang 《Journal of Mathematical Research and Exposition》 CSCD 2009年第1期76-84,共9页
Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the c... Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the central path,and its polynomial-time complexity bound is given.Finally,two numerical experiments are provided to show the effectiveness of the proposed algorithms. 展开更多
关键词 complementarity problem high-order affine scaling polynomial-time complexity interior-point algorithm P* (κ)-matrix.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部