全文获取类型
收费全文 | 94篇 |
免费 | 3篇 |
专业分类
化学 | 3篇 |
力学 | 5篇 |
数学 | 89篇 |
出版年
2017年 | 2篇 |
2016年 | 2篇 |
2015年 | 1篇 |
2014年 | 1篇 |
2013年 | 1篇 |
2012年 | 4篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 5篇 |
2008年 | 1篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 7篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 9篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1982年 | 2篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1974年 | 2篇 |
排序方式: 共有97条查询结果,搜索用时 250 毫秒
1.
Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak
estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum,
minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity
networks is considered.
Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002 相似文献
2.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
3.
Horst W. Hamacher Martine Labbé Stefan Nickel Anders J.V. Skriver 《Annals of Operations Research》2002,110(1-4):33-53
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect).We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results. 相似文献
4.
Fernández F. R. Monroy L. Puerto J. 《Journal of Optimization Theory and Applications》1998,99(2):403-421
In this paper, we deal with multicriteria matrix games. Different solution concepts have been proposed to cope with these games. Recently, the concept of Pareto-optimal security strategy which assures the property of security in the individual criteria against an opponent's deviation in strategy has been introduced. However, the idea of security behind this concept is based on expected values, so that this security might be violated by mixed strategies when replications are not allowed. To avoid this inconvenience, we propose in this paper a new concept of solution for these games: the G-goal security strategy, which includes as part of the solution the probability of obtaining prespecified values in the payoff functions. Thus, attitude toward risk together with payoff values are considered jointly in the solution analysis. 相似文献
5.
M. A. Morón C. Romero F. R. Ruiz del Portal 《Journal of Optimization Theory and Applications》1996,91(3):643-649
The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain. 相似文献
6.
W. Schmitendorf 《Journal of Optimization Theory and Applications》1979,27(1):135-146
Optimal control problems with a vector performance index and uncertainty in the state equations are investigated. Nature chooses the uncertainty, subject to magnitude bounds. For these problems, a definition of optimality is presented. This definition reduces to that of a minimax control in the case of a scalar cost and to Pareto optimality when there is no uncertainty or disturbance present. Sufficient conditions for a control to satisfy this definition of optimality are derived. These conditions are in terms of a related two-player zero-sum differential game and suggest a technique for determining the optimal control. The results are illustrated with an example.This research was supported by AFOSR under Grant No. 76-2923. 相似文献
7.
W. Stadler 《Journal of Optimization Theory and Applications》1979,29(1):1-52
In this survey, the history of the subject from 1776 until 1960 is presented. A brief biographical sketch of Vilfredo Pareto is given first. Then, the more or less simultaneous development of the concepts of utility, preference, and welfare theory follows, with results which go back to Hausdorff and Cantor. A brief discussion of the work of Borel and von Neumann as initiators of game theory is included. Each of these areas has developed enough to warrant its own survey; hence, they are reviewed here only insofar as they provide necessary foundations. Thereafter, the concepts of efficiency, vector maximum problem, and Pareto optimality are reviewed in connection with production theory, programming, and economics. The survey is presented within a unified mathematical framework, and the emphasis is on mathematical results, rather than psychological or socio-economic discussion. To enable the reader to draw conclusions without having to obtain each article himself, the results have been presented in somewhat more detail than usual. 相似文献
8.
G. Teters 《Mechanics of Composite Materials》2005,41(5):461-466
Multicriteria optimization of the structure and geometry of a laminated anisotropic composite plate subjected to the thermal
and biaxial action is considered. From known properties of the monolayer and the given values of variable structural parameters,
the thermoelastic properties of the layered composite are determined. The criteria to be optimized—the transverse critical
load and the longitudinal thermal stresses—depend on two variable design parameters of composite properties and temperature.
In the space of the optimization criteria, the domain of allowable solutions and the Pareto-optimal subdomain are found.
__________
Translated from Mekhanika Kompozitnykh Materialov, Vol. 41, No. 5, pp. 683–690, September–October, 2005. 相似文献
9.
V. V. Podinovski 《Computational Mathematics and Mathematical Physics》2008,48(11):1981-1998
Multicriteria decision-making problems under bounded (above, below, or from both sides) continuous or discrete criteria are considered. Methods for comparing variants of solutions using the information accumulated in the form of interval estimates of replacing the values of some criteria by the values of others (such replacements are called tradeoffs; in other words, this can be considered as a compensation of the deterioration of some criteria by improving the values of others) are proposed along with simple consistency conditions of such information. The issue of constructing the set of nondominated variants is discussed. 相似文献
10.
D. Ghose 《Journal of Optimization Theory and Applications》1991,68(3):463-481
In this paper, a scalar game is derived from a zero-sum multicriteria matrix game, and it is proved that the solution of the new game with strictly positive scalarization is a necessary and sufficient condition for a strategy to be a Pareto-optimal security strategy (POSS) for one of the players in the original game. This is done by proving that a certain set, which is the extension of the set of security level vectors in the criterion function space, is convex and polyhedral. It is also established that only a finite number of scalarizations are necessary to obtain all the POSS for a player. An example is included to illustrate the main steps in the proof.This work was done while the author was a Research Associate in the Department of Electrical Engineering at the Indian Institute of Science and was financially supported by the Council of Scientific and Industrial Research, Delhi, India.The author wishes to express his gratefulness to Professor U. R. Prasad for helpful discussions and to two anonymous referees for suggestions which led to an improved presentation. 相似文献