全文获取类型
收费全文 | 302篇 |
免费 | 0篇 |
国内免费 | 10篇 |
专业分类
化学 | 4篇 |
力学 | 2篇 |
数学 | 305篇 |
物理学 | 1篇 |
出版年
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 4篇 |
2016年 | 2篇 |
2015年 | 5篇 |
2014年 | 10篇 |
2013年 | 13篇 |
2012年 | 24篇 |
2011年 | 14篇 |
2010年 | 13篇 |
2009年 | 22篇 |
2008年 | 34篇 |
2007年 | 29篇 |
2006年 | 13篇 |
2005年 | 9篇 |
2004年 | 10篇 |
2003年 | 11篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有312条查询结果,搜索用时 15 毫秒
1.
非光滑非凸多目标规划解的充分条件 总被引:4,自引:0,他引:4
Kuhn-Tucker型条件的充分性一直是最优化理论中引人注意的一个问题.本文对非光滑函数提出了几个非凸概念,然后,讨论了非光滑非凸多目标规划中Kuhn-Tucker型条件和Fritz John型条件的充分性,在很弱的条件下,建立了一系列充分条件. 相似文献
2.
In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints. 相似文献
3.
本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法 相似文献
4.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献
5.
Optimality conditions are obtained for a nonlinear fractional multiobjective programming problem involving η-semidifferentiable functions. Also, a general dual is formulated and a duality result is proved using concepts of generalized ρ-semilocally type I-preinvex functions. 相似文献
6.
多目标最优化的一种积分型实现算法 总被引:2,自引:1,他引:1
在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法.本文利用数论中的一致分布佳点集列,较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则.并经过有关函数数值计算表明该算法是有效的,可用来求解多目标最优化问题的有效解. 相似文献
7.
Joël Benoist 《Journal of Global Optimization》2003,25(3):321-335
In finite dimensional Euclidean space, we prove the contractibility of the efficient frontier of simply shaded sets. This work extends the result of Peleg [7], which confirms the contractibility of the efficient frontier in the convex case. 相似文献
8.
In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis
of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets
of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness
of these algorithms are given. 相似文献
9.
P. A. V. Ferreira M. E. S. Machado 《Journal of Optimization Theory and Applications》1996,89(3):659-680
Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNPq and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments. 相似文献
10.
Necessary conditions for a given pointx
0 to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f
1,...,f
m
),F:XR
m,XR
m, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df
1(x
0)|i=1,...,m}T
*(X, x
0) need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.The authors would like to thank the anonymous referee for the suggestions which led to an improved presentation of the paper. 相似文献