全文获取类型
收费全文 | 397篇 |
免费 | 0篇 |
专业分类
397篇 |
出版年
2021年 | 6篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 3篇 |
2016年 | 8篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 63篇 |
2012年 | 3篇 |
2009年 | 4篇 |
2007年 | 13篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 10篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 15篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有397条查询结果,搜索用时 0 毫秒
381.
We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented. 相似文献
382.
This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed. 相似文献
383.
We investigate periodic replacement policies with minimal repair at failure, thereby, minimizing the average expected cost per unit time over an infinite time span. The standard cost structure is modified by the introduction of a term which takes adjustment costs into account. 相似文献
384.
Nature of Renyi's entropy and associated divergence function is discussed in terms of concave (convex) and pseudoconcave (pseudoconvex) functions. 相似文献
385.
R. H. Baker 《Defense & Security Analysis》1989,5(3):271-274
Izbrannye Proizvedennia. By M. V. Frunze. Moscow (1957) 相似文献
386.
387.
Control charts are widely used for process surveillance. The design of a control chart refers to the choice of sample size, the width of the control limits, and the interval between samples. Economic designs have been widely investigated and shown to be an effective method of determining control chart parameters. This article describes two different manufacturing process models to which the X¯ control chart is applied: The first model assumes that the process continues in operation while searches for the assignable cause are made, and the second assumes that the process must be shut down during the search. Economic models of the control chart for these two manufacturing process models are developed, and the sensitivity of the control chart parameters to the choice of model is explored. It is shown that the choice of the proper manufacturing process model is critical because selection of an inappropriate process model may result in significant economic penalties. 相似文献
388.
This article examines measures of economic efficiency in aircraft production. In particular, a type of nonlinear frontier estimation is contrasted with more traditional methods for estimating a dynamic cost function. This cost function is grounded in economic theory, and it is consistent with knowledge of the aircraft-production process. The model includes the effects of both learning and production rate on total program costs. The usefulness of the model is demonstrated with an example that relates to the acquisition of military equipment. It is shown through various sensitivity analyses that an alternative procurement policy for an aircraft program could have resulted in increased efficiency and hence a lower total program cost to the government. 相似文献
389.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved. 相似文献
390.
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm. 相似文献