检索结果-内蒙古大学图书馆

Unilateral contact, dynamic analysis of beams by a time-stepping, quadratic programming procedure

Meccanica 1983年第4期18卷 254-265页

作者： Mitsopoulou, Efthimia Department of Civil Engineering School of Technology Aristotle University of Thessalonik Greece

This paper discusses a method for the dynamic analysis of a slender beam, undergoing «small» deformations and contrasted without friction by a supporting profile. The relevant contact-impact (unilateral constrained) problem is studied, with reference to a discrete model in space and time, after its formulation as a quadratic programming problem (Q.P.P.), with sign constraints only. The contact-impact problem for a rigid supporting profile is first solved, and subsequently the contact problem for an elastic profile. Among available algorithms for the numerical solution, the implicit unconditionaly stable algorithm of Zienkiewicz Wood and Taylor was proved to be the most efficient for the time discretization, while a modification of Hildreth-d'Esopo's algorithm with the introduction of a variable overrelaxation factor, was used for the solution of the Q.P.P. © 1983 Pitagora Editrice Bologna.

关键词： programming problem Tempo Dynamic Analysis Quadratic programming Contact problem

来源：评论

学校读者我要写书评

暂无评论

A further procedure for ordering an input-output matrix: some empirical evidence

引用

Economics of Planning 1973年第1-2期13卷 121-129页

作者： Blin, J.M. Graduate School of Management Northwestern University Evanston United States

In a recent paper Ghosh and Sarkar [5] have developed a model of input-output systems as spatial configurations. Roy has proposed a more efficient solution method;but computation time still increases factorially which rules out its use for large matrices. [15] This note shows that the problem they have formulated belongs to a class of discrete programming problems known as placement or assignment problems. Several natural extensions are briefly discussed. More importantly, an efficient algorithm for the quadratic assignment problem is used to compute the optimal ordering of five comparable input-output matrices (US, Norway, Japan, Italy, India). These preliminary empirical results do show rather stable assignment patterns for the industries;and certain clusters of industries are shown to emerge as hypothesized by Ghosh and Sarkar. © 1973 The Centre for Russian and East European Studies.

关键词： Empirical Result programming problem Solution Method Economic System Assignment problem

来源：评论

学校读者我要写书评

暂无评论

Nonlinear programming in Banach spaces

引用

Journal of Optimization Theory and Applications 1969年第3期4卷 182-190页

作者： Nagahisa, Youji Sakawa, Yoshiyuki Faculty of Engineering Yamaguchi University Ube Yamaguchi Japan Faculty of Engineering Science Osaka University Toyonaka Osaka Japan

This paper is devoted to the formulation of generalized nonlinear programming problems in Banach spaces and to the derivation of the necessary conditions which the solutions of these problems must satisfy. © 1969... 详细信息

关键词： Banach Space programming problem Nonlinear programming Nonlinear programming problem Generalize Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

The minimal cost maximum matching of a graph

引用

Unternehmensforschung Operations Research - Recherche Opérationnelle 1971年第1期15卷 196-210页

作者： De Maio, A.O. Roveda, C.A. Lehrstuhl für Betriebswirtschaftslehre Johannes Gutenberg-Universität Binger Str. 22 65 Mainz

This paper deals with the problem of finding the maximum matching of a weighted graph, having the minimum cost. This problem is solved via a branch and bound algorithm, derived directly from Land and Doig's technique. The linear programming problem associated with each step of the procedure is solved through a primal-dual algorithm. © 1971 Physica-Verlag.

关键词： programming problem Minimal Cost Linear programming problem Weighted Graph Maximum Match

来源：评论

学校读者我要写书评

暂无评论

Geometry of optimality conditions and constraint qualifications

引用

Mathematical programming 1972年第1期2卷 1-18页

作者： Gould, F.J. Tolle, Jon W. University of North Carolina Chapel Hill North Carolina United States

Certain types of necessary optimality conditions for mathematical programming problems are equivalent to corresponding regularity conditions on the constraint set. For any problem, a certain natural optimality condition, dependent upon the particular constraint set, is always satisfied. This condition can be strengthened in numerous ways by invoking appropriate regularity assumptions on the constraint set. Results are presented for Euclidean spaces and some extensions to Banach spaces are given. © 1972 North-Holland Publishing Company.

关键词： Optimality Condition Euclidean Space Mathematical Method programming problem Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

On the extremal properties of the solution in dynamics of rigid-viscoplastic bodies allowing for large displacement effects

引用

Meccanica 1972年第4期7卷 236-247页

作者： Capurso, Michele Istituto di Scienza delle Costruzioni Università di Bologna Italy

This paper discusses the dynamics of rigid-viscoplastic bodies, bearing in mind large displacement effects. The extremal properties of the incremental solution of the dynamic problem are demonstrated. It is shown that the true instantaneous acceleration field minimizes some quadratic functionals in a class of functions constrained by linear equations and inequalities. It is also shown that, by idealizing the body as an assemblage of finite elements, the above principles reduce the problem to the solution of a classical quadratic programming problem that can be solved by several well-known efficient algorithms. Thus a general purpose finite element program for the dynamic analysis of rigid-viscoplastic structures can be derived by using the concepts shown in this paper. © 1972 Tamburini Editore s.p.a. Milano.

关键词： Mechanical Engineer Civil Engineer Linear Equation programming problem Dynamic Analysis

来源：评论

学校读者我要写书评

暂无评论

Nonlinear programming: Global use of the Lagrangian

引用

Journal of Optimization Theory and Applications 1970年第2期6卷 150-160页

作者： Zwart, P. Department of Applied Mathematics and Computing Sciences Washington University St. Louis Missouri United States

In some constrained nonlinear programming problems possessing several local optima, a local optimum can be recognized as the global optimum by looking closely at the Lagrangian, the augmented function. Similarly, classes of constrained optimization problems, such as geometric programming problems, can be recognized as possessing at most a single local optimum. © 1970 Plenum Publishing Corporation.

关键词： Global Optimum programming problem Local Optimum Nonlinear programming Constrain Optimization problem

来源：评论

学校读者我要写书评

暂无评论

On the convergence of a numerical method for optimal control problems

引用

Journal of Optimization Theory and Applications 1969年第5期4卷 330-342页

作者： Daniel, James W. Department of Computer Sciences University of Wisconsin Madison Wisconsin United States

Under suitable restrictions, convergence to the solutions of a class of optimal control problems is proved for a method by Rosen in which the differential equations, constraints, and cost functional are discretized, and the resulting mathematical programming problem is solved approximately by a penalty-function approach. © 1969 Plenum Publishing Corporation.

关键词： Differential Equation Control problem Rosen programming problem Optimal Control problem

来源：评论

学校读者我要写书评

暂无评论

A computational comparison of some non-linear programs

引用

Mathematical programming 1973年第1期4卷 144-154页

作者： Asaadi, J. Plan Organization Informatics Division Documentation Centre Teheran Iran

This article deals mainly with a comparison of certain computational techniques used for the solution of non-linear constrained mathematical programming problems. © 1973 The Mathematical programming Society.

关键词： Mathematical Method programming problem Mathematical programming Computational Technique Mathematical programming problem

来源：评论

学校读者我要写书评

暂无评论

Stability and optimization of viscoelastic cylindrical shells made out of composites under combined loading

引用

Mechanics of Composite Materials 1983年第6期18卷 685-691页

作者： Siryus, V.Yu. Teters, G.A. Institute of Polymer Mechanics Academy of Sciences of the Latvian SSR Riga Latvia

The numerical investigation of the functions describing the physical restrictions in the problem of the optimization of cylindrical shells made out of composites with a viscoelastic binder which has been carried out in this work has shown that the optimization problem which has been considered above belongs to the class of convex programming problems. The parameters of the optimal design for the shell, i.e., the mass G^* and the relative fractions of the reinforcements Θ₁, Θ₂, and Θ₃, arranged according to the corresponding schemes, are substantially dependent on the time for which the construction is utilized τ_op. A comparison of the optimal designs of a shell at the same utilization times τ_op has shown that the use of three-dimensional reinforcement schemes with an insignificant gain in mass provides a gain in the volume of the reinforcement in comparison with the planar reinforcement schemes of 22 to 24%. In the optimal shell designs, the increase in the flexure with respect to time is always a nondecaying nature. © 1983 Plenum Publishing Corporation.

关键词： Optimal Design programming problem Cylindrical Shell Numerical Investigation Physical Restriction

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：