排序方式: 共有12条查询结果,搜索用时 234 毫秒
1.
In many decision-making situations, each activity that can be undertaken may have associated with it both a fixed and a variable cost. Recently, we have encountered serveral practical problems in which the fixed cost of undertaking an activity depends upon which other activities are also undertaken. To our knowledge, no existing optimization model can accomodate such a fixed cost structure. To do so, we have therefore developed a new model called the interactive fixed charge linear programming problem (IFCLP). In this paper we present and motivate problem (IFCLP), study some of its characteristics, and present a finite branch and bound algorithm for solving it. We also discuss the main properties of this algorithm. 相似文献
2.
Harold R. Winton 《战略研究杂志》2013,36(6):853-877
This article explores a perennial theme in the literature of strategic studies: the relationship between military theory and the military profession. It begins with a conceptual analysis of this relationship. It then investigates what military theorists themselves have had to say about the utility of their craft. It concludes by assessing the actual influence of military theory on selected individuals and institutions. The individuals are George S. Patton, Jr., and Ulysses S. Grant. The institutions are the United States Army and the United States Air Force in the late twentieth century. The fundamental finding is suggested in the title: military theory can indeed be quite useful in the maturation of military commanders and in the development of martial institutions, but it is not always necessary and by no means perfect. It should thus be studied assiduously but used with caution. 相似文献
3.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
4.
Harold P. Benson 《海军后勤学研究》2004,51(4):467-476
The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
5.
6.
Harold P. Benson 《海军后勤学研究》1985,32(1):165-177
We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code. 相似文献
7.
We propose and justify the proposition that finding truly global representations of the efficient sets of multiple objective mathematical programs is a worthy goal. We summarize the essential elements of a general global shooting procedure that seeks such representations. This procedure illustrates the potential benefits to be gained from procedures for globally representing efficient sets in multiple objective mathematical programming. © 1997 John Wiley & Sons, Inc. 相似文献
8.
9.
Harold Greenberg 《海军后勤学研究》1969,16(3):417-421
We convert a quadratic assignment problem [1] with a nonconvex objective function into an integer linear program. We then solve the equivalent integer program by a simple enumeration that produces global minima. 相似文献
10.
Harold Sackrowitz 《海军后勤学研究》1985,32(1):53-56
Traditionally continuous sampling plans have been evaluated according to relatively few criteria. These typically include the OC curve (on which AQL systems are based), the ASN, and the AOQ curve. These characteristics are all calculated under the assumption that the process is “in control” so that mathematically they are derived as long-term averages. Thus, any two plans which (long term) spend the same proportion of time on each type of sampling inspection will be identical relative to these criteria. This is true whether sampling from lots or doing unit-by-unit inspection. The goal is to first establish desirable additional criteria and then to develop methods to determine which procedure (of those which satisfy the standard criteria) is optimal relative to the new criteria. To be considered will be measures of a plan's ability to detect a sudden drop in quality (such as ARL). 相似文献