期刊文献+
共找到10篇文章
< 1 >
每页显示 20 50 100
基于云与或树的复杂决策问题规约研究 被引量:2
1
作者 王洪利 冯玉强 《哈尔滨工业大学学报》 EI CAS CSCD 北大核心 2007年第7期1131-1134,共4页
针对复杂决策问题的规约问题,给出了基于云模型与或树与群体决策的规约方法.阐述问题规约的基本概念及其与群体决策的关系,给出了基于云模型的问题解树的代价与可解度计算,基于云模型与或树的复杂决策问题归约过程,给出了复杂决策问题... 针对复杂决策问题的规约问题,给出了基于云模型与或树与群体决策的规约方法.阐述问题规约的基本概念及其与群体决策的关系,给出了基于云模型的问题解树的代价与可解度计算,基于云模型与或树的复杂决策问题归约过程,给出了复杂决策问题云与或树的启发式搜索算法.该方法充分表达了复杂决策问题归约中群体判断的模糊性和随机性,具有较大的客观性. 展开更多
关键词 复杂决策 问题规约 与或树 云模型
下载PDF
问题规约法在解决刚体动力学问题中的应用
2
作者 许英姿 沈玉凤 李丽君 《科教导刊》 2019年第10期23-24,共2页
根据人工智能中知识的表示方法,结合最近发展区理论,运用逆向思维的思维方式对理论力学中单自由度刚体系统动力学普遍定理综合应用问题的求解进行了探讨。
关键词 问题规约 最近发展区 逆向思维
下载PDF
基于矩阵分解的质量计划规约、优化模型 被引量:5
3
作者 陈俊 唐晓青 《计算机集成制造系统-CIMS》 EI CSCD 1998年第6期21-25,共5页
本文在Clausing/Makabe-ASIQFD模型基础上,采用其逐级分解的方法,引进时间、时序、数理逻辑、代价和可行性等概念,并加入人员机制,提出了基于矩阵分解的质量计划规约、优化模型;该模型通过引导使用者对质量... 本文在Clausing/Makabe-ASIQFD模型基础上,采用其逐级分解的方法,引进时间、时序、数理逻辑、代价和可行性等概念,并加入人员机制,提出了基于矩阵分解的质量计划规约、优化模型;该模型通过引导使用者对质量目标进行逐级矩阵分解;对分解的最终结果进行推理、方案搜索与优化、冗余剔除、冲突检查和排序,以获得可实施的。 展开更多
关键词 质量计划 问题规约 优化 排序 质量管理 企业
下载PDF
用问题归约法求解物体系统平衡问题
4
作者 许英姿 沈玉凤 《大学教育》 2017年第4期40-41,58,共3页
规约法是人工智能所描述的知识表示的方法之一。运用逆向思维的思维方式,提出用问题规约法求解理论力学课程中物体系统平衡问题约束力的方法,并通过算例进行验证。算例证明该方法是一种解决物体系统平衡问题的最优化的方法。
关键词 问题规约 逆向思维 系统平衡
下载PDF
破解三个难题 深化校企合作 被引量:9
5
作者 魏寒柏 卢致俊 张海峰 《中国大学教学》 CSSCI 北大核心 2010年第9期78-80,共3页
校企合作是高职院校实施工学结合人才培养模式的基本途径,但目前高职教育校企合作面临着一些问题,具体可归纳为动力性问题、稳定性问题、规约性问题。应从资源依赖的视角解决动力性问题,以合作联盟的形式解决稳定性问题,用建章立制... 校企合作是高职院校实施工学结合人才培养模式的基本途径,但目前高职教育校企合作面临着一些问题,具体可归纳为动力性问题、稳定性问题、规约性问题。应从资源依赖的视角解决动力性问题,以合作联盟的形式解决稳定性问题,用建章立制的办法解决规约性问题。 展开更多
关键词 校企合作 动力性问题 稳定性问题 规约问题
下载PDF
CONSTRAINT QUALIFICATIONS AND DUAL PROBLEMS FOR QUASI-DIFFERENTIABLE PROGRAMMING
6
作者 殷洪友 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2002年第2期199-202,共4页
In classical nonlinear programming, it is a general method of developing optimality conditions that a nonlinear programming problem is linearized as a linear programming problem by using first order approximations of ... In classical nonlinear programming, it is a general method of developing optimality conditions that a nonlinear programming problem is linearized as a linear programming problem by using first order approximations of the functions at a given feasible point. The linearized procedure for differentiable nonlinear programming problems can be naturally generalized to the quasi differential case. As in classical case so called constraint qualifications have to be imposed on the constraint functions to guarantee that for a given local minimizer of the original problem the nullvector is an optimal solution of the corresponding 'quasilinearized' problem. In this paper, constraint qualifications for inequality constrained quasi differentiable programming problems of type min {f(x)|g(x)≤0} are considered, where f and g are qusidifferentiable functions in the sense of Demyanov. Various constraint qualifications for this problem are presented and a new one is proposed. The relations among these conditions are investigated. Moreover, a Wolf dual problem for this problem is introduced, and the corresponding dual theorems are given. 展开更多
关键词 quasi differentiable programming constraint qualification dual problems
下载PDF
Modified Augmented Lagrange Multiplier Methods for Large-Scale Chemical Process Optimization 被引量:6
7
作者 梁昔明 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2001年第2期167-172,共6页
Chemical process optimization can be described as large-scale nonlinear constrained minimization. The modified augmented Lagrange multiplier methods (MALMM) for large-scale nonlinear constrained minimization are studi... Chemical process optimization can be described as large-scale nonlinear constrained minimization. The modified augmented Lagrange multiplier methods (MALMM) for large-scale nonlinear constrained minimization are studied in this paper. The Lagrange function contains the penalty terms on equality and inequality constraints and the methods can be applied to solve a series of bound constrained sub-problems instead of a series of unconstrained sub-problems. The steps of the methods are examined in full detail. Numerical experiments are made for a variety of problems, from small to very large-scale, which show the stability and effectiveness of the methods in large-scale problems. 展开更多
关键词 modified augmented Lagrange multiplier methods chemical engineering optimization large-scale non- linear constrained minimization numerical experiment
下载PDF
New semidefinite programming relaxations for box constrained quadratic program 被引量:3
8
作者 XIA Yong 《Science China Mathematics》 SCIE 2013年第4期877-886,共10页
We establish in this paper optimal parametric Lagrangian dual models for box constrained quadratic program based on the generalized D.C.(difference between convex) optimization approach,which can be reformulated as se... We establish in this paper optimal parametric Lagrangian dual models for box constrained quadratic program based on the generalized D.C.(difference between convex) optimization approach,which can be reformulated as semidefinite programming problems.As an application,we propose new valid linear constraints for rank-one relaxation. 展开更多
关键词 box constrained quadratic program Lagrangian dual semidefinite programming D.C. optimiza- tion lower bound ZONOTOPE
原文传递
GLOBAL CONVERGENCE OF A CLASS OF SMOOTH PENALTY METHODS FOR SEMI-INFINITE PROGRAMMING
9
作者 Changyu WANG Haiyan ZHANG Fang LIU 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2011年第4期769-783,共15页
For the semi-infinite programming (SIP) problem, the authors first convert it into an equivalent nonlinear programming problem with only one inequality constraint by using an integral function, and then propose a sm... For the semi-infinite programming (SIP) problem, the authors first convert it into an equivalent nonlinear programming problem with only one inequality constraint by using an integral function, and then propose a smooth penalty method based on a class of smooth functions. The main feature of this method is that the global solution of the penalty function is not necessarily solved at each iteration, and under mild assumptions, the method is always feasible and efficient when the evaluation of the integral function is not very expensive. The global convergence property is obtained in the absence of any constraint qualifications, that is, any accumulation point of the sequence generated by the algorithm is the solution of the SIP. Moreover, the authors show a perturbation theorem of the method and obtain several interesting results. Furthermore, the authors show that all iterative points remain feasible after a finite number of iterations under the Mangasarian-Fromovitz constraint qualification. Finally, numerical results are given. 展开更多
关键词 Global convergence semi-infinite programming smooth penalty function perturbation function.
原文传递
A Rapid Path Planner for Autonomous Ground Vehicle Using Section Collision Detection
10
作者 冷哲 董敏周 +1 位作者 董刚奇 闫杰 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第3期306-309,共4页
Rapid path planner plays an important role in autonomous ground vehicle (AGV) operation. Depending on the non-holonomic kinematics constraints of AGV, its path planning problem is discussed. Since rapidly-exploring ... Rapid path planner plays an important role in autonomous ground vehicle (AGV) operation. Depending on the non-holonomic kinematics constraints of AGV, its path planning problem is discussed. Since rapidly-exploring random tree (RRT) can directly take non-holonomic constraints into consideration, it is selected to solve this problem. By applying extra constraints on the movement, the generation of new configuration in RRT algorithm is simplified and accelerated. With section collision detection method applied, collision detection within the planer becomes more accurate and efficient. Then a new path planner is developed. This method complies with the non-holonomic constraints, avoids obstacles effectively and can be rapidly carried out while the vehicle is running. Simulation shows that this path planner can complete path planning in less than 0.5 s for a 170 mx 170 m area with moderate obstacle complexity. 展开更多
关键词 autonomous ground vehicle (AGV) non-holonomic constraints rapidly-exploring random tree (RRT) path planning collision detection
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部