全文获取类型
收费全文 | 1957篇 |
免费 | 33篇 |
国内免费 | 91篇 |
专业分类
化学 | 107篇 |
晶体学 | 1篇 |
力学 | 38篇 |
综合类 | 3篇 |
数学 | 1504篇 |
物理学 | 140篇 |
无线电 | 288篇 |
出版年
2023年 | 20篇 |
2022年 | 27篇 |
2021年 | 35篇 |
2020年 | 30篇 |
2019年 | 30篇 |
2018年 | 31篇 |
2017年 | 27篇 |
2016年 | 32篇 |
2015年 | 31篇 |
2014年 | 75篇 |
2013年 | 149篇 |
2012年 | 136篇 |
2011年 | 83篇 |
2010年 | 63篇 |
2009年 | 130篇 |
2008年 | 118篇 |
2007年 | 101篇 |
2006年 | 78篇 |
2005年 | 75篇 |
2004年 | 66篇 |
2003年 | 41篇 |
2002年 | 61篇 |
2001年 | 50篇 |
2000年 | 47篇 |
1999年 | 38篇 |
1998年 | 39篇 |
1997年 | 40篇 |
1996年 | 42篇 |
1995年 | 34篇 |
1994年 | 30篇 |
1993年 | 17篇 |
1992年 | 18篇 |
1991年 | 10篇 |
1990年 | 12篇 |
1989年 | 6篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 24篇 |
1985年 | 29篇 |
1984年 | 27篇 |
1983年 | 19篇 |
1982年 | 29篇 |
1981年 | 16篇 |
1980年 | 31篇 |
1979年 | 25篇 |
1978年 | 32篇 |
1977年 | 5篇 |
1972年 | 2篇 |
1969年 | 2篇 |
1967年 | 1篇 |
排序方式: 共有2081条查询结果,搜索用时 9 毫秒
731.
We consider the problem of computing upper and lower bounds on the price of an European basket call option, given prices on
other similar options. Although this problem is hard to solve exactly in the general case, we show that in some instances
the upper and lower bounds can be computed via simple closed-form expressions, or linear programs. We also introduce an efficient
linear programming relaxation of the general problem based on an integral transform interpretation of the call price function.
We show that this relaxation is tight in some of the special cases examined before. 相似文献
732.
C. Ling L. Q. Qi G. L. Zhou S. Y. Wu 《Journal of Optimization Theory and Applications》2006,129(1):147-164
The semi-infinite programming (SIP) problem is a program with infinitely many constraints. It can be reformulated as a nonsmooth
nonlinear programming problem with finite constraints by using an integral function. Due to the nondifferentiability of the
integral function, gradient-based algorithms cannot be used to solve this nonsmooth nonlinear programming problem. To overcome
this difficulty, we present a robust smoothing sequential quadratic programming (SQP) algorithm for solving the nonsmooth
nonlinear programming problem. At each iteration of the algorthm, we need to solve only a quadratic program that is always
feasible and solvable. The global convergence of the algorithm is established under mild conditions. Numerical results are
given.
Communicated by F. Giannessi
His work was supported by the Hong Kong Research Grant Council
His work was supported by the Australian Research Council. 相似文献
733.
《Optimization》2012,61(6):841-861
This article studies stability and optimality for convex parametric programming models in abstract spaces. Necessary conditions for continuity of the feasible set mapping are given in complete metric spaces. This continuity is characterized for models in which the space of decision variables is reflexive Banach space. The main result on optimality characterizes locally optimal parameters relative to stable perturbations of the parameter. The result is stated in terms of the existence of a saddle-point for a Lagrangian that uses a finite Borel measure. It does not hold for unstable perturbations even if the model is finite dimensional. The results are applicable to various formulations of control and optimal control problems. 相似文献
734.
《Optimization》2012,61(1):93-108
Sensitivity to perturbations of the vector objective function and/or the constraints is studied for the efficient (or weakly) set associated to a linear multicriteria program whose the feasible polyhedron is not necessarily assumed to be nondegenerate. Namely, the efficient set in the linear case being a connected union of some faces of the polyhedron, then we establish firstly second order necessary and sufficient conditions for the feasibility of a degenerate vertex under small perturbations, and finally, we give necessary and sufficient conditions of Simplex type, for a such vertex, or incident face to it, to be efficient and mostly to preserve this quality after the perturbations. 相似文献
735.
《Optimization》2012,61(1):59-79
In sensitivity analysis one wants to know how the problem and the optimal solutions change under the variation of the input data. We consider the case when variation happens in the right-hand side of the constraints and/or in the linear term of the objective function. We are interested to find the range of the parameter variation in Convex Quadratic Optimization (CQO) problems where the support set of a given primal optimal solution remains invariant. This question has been first raised in Linear Optimization (LO) and known as Type II (so-called Support Set Invariancy) sensitivity analysis. We present computable auxiliary problems to identify the range of parameter variation in support set invariancy sensitivity analysis for CQO. It should be mentioned that all the given auxiliary problems are LO problems and can be solved by an interior point method in polynomial time. We also highlight the differences between the characteristics of support set invariancy sensitivity analysis for LO and CQO. 相似文献
736.
《Optimization》2012,61(3):283-304
Given a convex vector optimization problem with respect to a closed ordering cone, we show the connectedness of the efficient and properly efficient sets. The Arrow–Barankin–Blackwell theorem is generalized to nonconvex vector optimization problems, and the connectedness results are extended to convex transformable vector optimization problems. In particular, we show the connectedness of the efficient set if the target function f is continuously transformable, and of the properly efficient set if f is differentiably transformable. Moreover, we show the connectedness of the efficient and properly efficient sets for quadratic quasiconvex multicriteria optimization problems. 相似文献
737.
《Optimization》2012,61(3-4):373-383
This paper presents a resource allocation model via Goal Programming (GP) in a long-range planning horizon in university management. In the proposed model, the introduction of new courses in the academic units and the allocation of available budget within the academic units as well as the forecast of the budget which is actually needed for better academic performance are taken into consideration. An illustrative example is presented to expound the model 相似文献
738.
《Optimization》2012,61(4):313-319
The paper deals with nonsmooth quasiconvex functions and develops a quasidifferential analysis for this class of functions. Therefore, in terms of sub and superdifferentials, first order approximations of the functions are derived, optimality conditions are stated and directions of descent (either simple feasible or of steepest descent) are determined. Moreover, a relation among positively homogeneous convex and quasiconvex functions is established 相似文献
739.
《Optimization》2012,61(1-4):369-385
In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed 相似文献
740.
Reinaldo Castro Souza André Luı´s Marques Marcato Bruno Henriques Dias Fernando Luiz Cyrino Oliveira 《European Journal of Operational Research》2012
In electrical power systems with strong hydro generation, the use of adequate techniques to generate synthetic hydrological scenarios is extremely important for the evaluation of the ways the system behaves in order to meet the forecast energy demand. This paper proposes a new model to generate natural inflow energy scenarios in the long-term operation planning of large-sized hydrothermal systems. This model is based on the Periodic Autoregressive Model, PAR (p), where the identification of the p orders is based on the significance of the Partial Autocorrelation Function (PACF) estimated via Bootstrap, an intensive computational technique. The scenarios generated through this new technique were applied to the operation planning of the Brazilian Electrical System (BES), using the previously developed methodology of Stochastic Dynamic Programming based on Convex Hull algorithm (SDP-CHull). The results show that identification via Bootstrap is considerably more parsimonious, leading to the identification of lower orders models in most cases which retains the statistical characteristics of the original series. Additionally it presents a closer total mean operation cost when compared to the cost obtained via historic series. 相似文献