全文获取类型
收费全文 | 546篇 |
免费 | 3篇 |
专业分类
化学 | 6篇 |
力学 | 11篇 |
综合类 | 3篇 |
数学 | 511篇 |
物理学 | 18篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2019年 | 1篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 10篇 |
2013年 | 25篇 |
2012年 | 71篇 |
2011年 | 9篇 |
2010年 | 7篇 |
2009年 | 19篇 |
2008年 | 8篇 |
2007年 | 9篇 |
2006年 | 23篇 |
2005年 | 14篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 16篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 14篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 15篇 |
1985年 | 25篇 |
1984年 | 25篇 |
1983年 | 19篇 |
1982年 | 24篇 |
1981年 | 15篇 |
1980年 | 28篇 |
1979年 | 19篇 |
1978年 | 30篇 |
1977年 | 5篇 |
1972年 | 2篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有549条查询结果,搜索用时 15 毫秒
11.
R. S. Dembo 《Mathematical Programming》1979,17(1):156-175
In this paper we analyse algorithms for the geometric dual of posynomial programming problems, that make explicit use of second order information. Out of two possible approaches to the problem, it is shown that one is almost always superior. Interestingly enough, it is the second, inferior approach that has dominated the geometric programming literature.This work was partially supported by the National Research Council of Canada, Grant A3552 and National Science Foundation Grant ENG78-21615.Earlier versions of this paper were presented at the Optimization Days Conference in Montreal (May 1976) and the TIMS meeting in Athens (July 1977). 相似文献
12.
基于可靠度的结构优化的序列近似规划算法 总被引:3,自引:0,他引:3
基于可靠度的优化的最直观解法是把可靠度和优化的各自算法搭配一起形成嵌套两层次迭代。为改善其收敛性提高计算效率,人们提出了功能测度法、半无限规划法、单层次算法等多种改进方法。本文对传统结构优化界的经典序列近似规划法改造并扩展应用于求解基于可靠度的结构优化问题,构造该问题的序列近似规划模型和求解过程;其核心思想是在每个近似规划子问题中采用近似可靠度指标对设计变量的线性近似,在优化迭代过程中同步更新设计变量和随机空间中的近似验算点坐标,以达到可靠度分析和优化迭代同步收敛的目标。为了算法的实施,还推导出近似可靠度指标的半解析灵敏度计算公式,编制了程序,最终实现与通用软件的连接。论文用算例证实算法的有效性。 相似文献
13.
本文把稳健统计的影响函数概念引入到了概率约束下的随机规划模型中.在一定条件下,得到了三个模型最优解的影响函数表达式. 相似文献
14.
Włodzimierz Ogryczak 《Annals of Operations Research》1994,51(1):33-44
Real-life decision problems are usually so complex they cannot be modeled with a single objective function, thus creating a need for clear and efficient techniques of handling multiple criteria to support the decision process. The most commonly used technique is Goal Programming. It is clear and appealing, but in the case of multiobjective optimization problems strongly criticized due to its noncompliance with the efficiency (Pareto-optimality) principle. On the other hand, the reference point method, although using similar control parameters as Goal Programming, always generates efficient solutions. In this paper, we show how the reference point method can be modeled within the Goal Programming methodology. It allows us to simplify implementations of the reference point method as well as shows how Goal Programming with relaxation of some traditional assumptions can be extended to a multiobjective optimization technique meeting the efficiency principle. 相似文献
15.
Finding an efficient solution to linear bilevel programming problem: An effective approach 总被引:1,自引:0,他引:1
Multilevel programming is developed to solve the decentralized problem in which decision makers (DMs) are often arranged within a hierarchical administrative structure. The linear bilevel programming (BLP) problem, i.e., a special case of multilevel programming problems with a two level structure, is a set of nested linear optimization problems over polyhedral set of constraints. Two DMs are located at the different hierarchical levels, both controlling one set of decision variables independently, with different and perhaps conflicting objective functions. One of the interesting features of the linear BLP problem is that its solution may not be Paretooptimal. There may exist a feasible solution where one or both levels may increase their objective values without decreasing the objective value of any level. The result from such a system may be economically inadmissible. If the decision makers of the two levels are willing to find an efficient compromise solution, we propose a solution procedure which can generate effcient solutions, without finding the optimal solution in advance. When the near-optimal solution of the BLP problem is used as the reference point for finding the efficient solution, the result can be easily found during the decision process. 相似文献
16.
邓汉鼎 《高校应用数学学报(A辑)》1996,(4):485-490
为了解决三角债问题,银行给出一笔贷款,应该如何分配这笔贷款,使清理的债务达到最大。本文建立这个问题的数学模型,并且给出一个解法。 相似文献
17.
Recently, linear programming problems with special structures have assumed growing importance in mathematical programming.
It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational
solution of large-scale linear programming problems. A linear program is said to contain an embedded network structure provided
that some subset of its constraints can be interpreted as specifying conservation of flow. If a column of the constraint matrix
has at most two non-zeros, then it leads to embedded generalized network structure and if these non-zeros are unit elements
and of opposite signs, then it leads to embedded pure network structure.
In this paper, we are concerned with algorithms for detecting embedded pure network structures within linear programs. The
network extraction methods are presented in two groups. The first group covers deletion and addition based algorithms and
the second group covers GUB based algorithms. We have extended the GUB based algorithm appearing in the second group by introducing
Markowitz merit count approach for exploiting matrix non zeros. A set of well known test problems has been used to carry out
computational experiments which show that our extensions to the GUB based algorithms give better results than the algorithms
reported earlier. 相似文献
18.
关于二次规划问题分段线性同伦算法的改进 总被引:1,自引:0,他引:1
杨冰 《高校应用数学学报(A辑)》1995,(4):417-424
本文利用Cholesky分解,Gauss消去等技术和定义适当的同伦映射,将关于二次规划问题的分段线性同伦算法加以改进,改进后的算法,对于严格凸二次规划来说,计算效率与Goldfarb-Idnani的对偶法相当。 相似文献
19.
Jacob Flachs 《Mathematical Programming》1981,20(1):327-347
General and quasi-concave non-differentiable cases of the maximization of the minimun between two functions are considered. With the aid of duality theory for mathematical programming involving conjugate-like operators and by defining a bifunction we construct a new Lagrangian and generate a class of perturbations. New saddle-point theorems are presented, and equivalence is proved between the existence of a saddle-point and the existence of a certain cone-supporting property of the perturbation function. These results suggest possible improvements in multiplier methods.This work was partially supported by a grant from Control Data. 相似文献
20.
R. R. Meyer 《Mathematical Programming》1983,26(1):21-39
Recursive separable programming algorithms based on local, two-segment approximations are described for the solution of separable
convex programs. Details are also given for the computation of lower bounds on the optimal value by both a primal and a dual
approach, and these approaches are compared. Computational comparisons of the methods are provided for a variety of test problems,
including a water supply application (with more than 600 constraints and more than 900 variables) and an econometric modelling
problem (with more than 200 variables).
Research supported by National Science Foundation Grants MCS74-20584 A02 and MCS-7901066. 相似文献