全文获取类型
收费全文 | 410篇 |
免费 | 8篇 |
专业分类
418篇 |
出版年
2021年 | 3篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 5篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 94篇 |
2011年 | 4篇 |
2010年 | 3篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2007年 | 3篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2003年 | 8篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1997年 | 3篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 9篇 |
1988年 | 13篇 |
1987年 | 9篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 8篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1948年 | 4篇 |
排序方式: 共有418条查询结果,搜索用时 0 毫秒
11.
This paper calls attention to an experimental design which enhances the efficiency of the technique described by B. F. Houston and R. A. Huffman [3]. This alternative design is a modification of the simplex lattice design developed by Scheffé [6] for the mixture problem. While not possessing the optimal statistical properties of the central composite design proposed in [3], such as minimum bias and minimum variance, this modified design is optimum with respect to the number of design points employed; hence, it is the minimum cost design. Further, the design proposed in this note is excellent for use in multiple-block experimentation, which is very often required with constrained systems. 相似文献
12.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study. 相似文献
13.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
14.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
15.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology. 相似文献
16.
Consider an “intractable” optimization problem for which no efficient solution technique exists. Given a systematic procedure for generating independent heuristic solutions, we seek to obtain interval estimates for the globally optimal solution using statistical inference. In previous work, accurate point estimates have been derived. Determining interval estimates, however, is a considerably more difficult task. In this paper, we develop straightforward procedures which compute confidence intervals efficiently in order to evaluate heuristic solutions and assess deviations from optimality. The strategy presented is applicable to a host of combinatorial optimization problems. The assumptions of our model, along with computational experience, are discussed. 相似文献
17.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
18.
We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi-infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n-space with maximization of a linear function in non-negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn-Tucker saddle-point equivalence theorem for arbitrary convex functions in n-space where differentiability is no longer assumed. 相似文献
19.
The classical Economic Order Quantity Model requires the parameters of the model to be constant. Some EOQ models allow a single parameter to change with time. We consider EOQ systems in which one or more of the cost or demand parameters will change at some time in the future. The system we examine has two distinct advantages over previous models. One obvious advantage is that a change in any of the costs is likely to affect the demand rate and we allow for this. The second advantage is that often, the times that prices will rise are fairly well known by announcement or previous experience. We present the optimal ordering policy for these inventory systems with anticipated changes and a simple method for computing the optimal policy. For cases where the changes are in the distant future we present a myopic policy that yields costs which are near-optimal. In cases where the changes will occur in the relatively near future the optimal policy is significantly better than the myopic policy. 相似文献
20.
A complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transformation to canonical form, exploitation of the Farkas-Minkowki lemma and the duality relationships which emerge from the Charnes-Cooper linear programming equivalent for general linear fractional programming. The formulations as well as the proofs and the transformations provided by our general linear fractional programming theory are here employed to provide a substantial simplification for this class of cases. The augmentation developing the explicit solution is presented, for clarity, in an algorithmic format. 相似文献