Gallemore, J.G. · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 1954
In the operations analysis curriculum at the United States Naval Postgraduate School numerous reports were presented from 1952 to 1954 which exemplified some methods and techniques for comparing weapons, methods, strategies, etc., quantitatively using a measure of effectiveness. These reports seemed to place little emphasis on the relative amount of effort or assets available to implement a final decision. This paper is written to emphasize the necessity of considering not only the amount of effort available but also the manner and times at which increments of effort became available.
Cited by 0Open access
NG KANG TZE · National University of Singapore · 2021
Bachelor's
Cited by 0
Ø. Andreassen, T.O. Olsen · Modeling Identification and Control A Norwegian Research Bulletin · 1983
An algorithm for optimal boiler load allocation is compared with a sub-optimal algorithm and with equal load distribution. Advantages and disadvantages of the optimal and sub-optimal algorithms are discussed, and by a practical example it is demonstrated that the optimal algorithm may give substantial cost reductions.
Cited by 2Open access
Koo-min Ahn, Sehun Kim · 2003
Cited by 0
Yashwant K. Malaiya · Wiley Encyclopedia of Operations Research and Management Science · 2011
Abstract The overall reliability of a complex system, designed as an assembly of subsystems, depends on the subsystem reliability metrics. The cost of each subsystem is a function of its reliability. This article considers the problem of allocating the reliability values to minimize the total cost while achieving the reliability target. The reliability allocation problem is applicable to mechanical and electrical systems as well as computer hardware and software. The approach involves expressing the system reliability in terms of the subsystem reliability values and specifying the cost function for each subsystem, which allows setting up an optimization problem. Software reliability allocation is examined as a detailed example and some preliminary apportionment approaches are presented. While in many cases, it is possible to use exact optimization methods, a complex case may require use of iterative approaches.
Cited by 4
J. Dhaene · VUBIR (Vrije Universiteit Brussel) · 2012
Cited by 0
Jan Dhaene, Andreas Tsanakas, Emiliano A. Valdez et al. · Munich Personal RePEc Archive (Ludwig Maximilian University of Munich) · 2009
This paper develops a unifying framework for allocating the aggregate capital of a finan-cial firm to its business units. The approach relies on an optimisation argument, requiring that the weighted sum of measures for the deviations of the business unit’s losses from their respective allocated capitals be minimised. This enables the association of alternative allo-cation rules to specific decision criteria and thus provides the risk manager with flexibility to meet specific target objectives. The underlying general framework reproduces many capital allocation methods that have appeared in the literature and allows for several possible ex-tensions. An application to an insurance market with policyholder protection is additionally provided as an illustration.
Cited by 27
Karun Adusumilli, Friedrich Geiecke, Claudio Schilter · arXiv (Cornell University) · 2019
Dynamic decisions are pivotal to economic policy making. We show how existing evidence from randomized control trials can be utilized to guide personalized decisions in challenging dynamic environments with budget and capacity constraints. Recent advances in reinforcement learning now enable the solution of many complex, real-world problems for the first time. We allow for restricted classes of policy functions and prove that their regret decays at rate n^(-0.5), the same as in the static case. Applying our methods to job training, we find that by exploiting the problem's dynamic structure, we achieve significantly higher welfare compared to static approaches.
Cited by 2Open access
Tracey S. Seymour · AIMR Conference Proceedings · 1995
Asset allocation for individual clients begins with goal setting, a critical aspect of which is determining long-term financial needs. For this purpose, “what if” scenarios are effective. Achieving optimal asset allocation for clients may require educating clients about the importance of diversification, standard deviation, and the efficient frontier. The author describes three broad portfolio strategies that can be used to meet the investment needs of a wide range of clients.This presentation comes from the Managing Assets for Individual Investors conference held in Chicago, Illinois, on February 28 - March 1, 1995.
Cited by 0Open access
Haipeng Yao, Tao Huang, Chenglin Zhao et al. · 2014
Cited by 0
Vincent Le Nir, Marc Moonen, Jan Verlinden et al. · 2007
Recently, the duality between Multiple Input Multiple Output ... Channels (BC) has been established under a total power constraint. The same set of rates for MAC can be achieved in BC exploiting the MAC-BC duality formulas while preserving the total power constraint. In this paper, we describe the BC optimal power allocation applying this duality in a downstream x-Digital Subscriber Lines (xDSL) context under a total power constraint for all modems over all tones. Then, a new algorithm called BC-Optimal Spectrum Balancing (BC-OSB) is devised for a more realistic power allocation under per-modem total power constraints. The capacity region of the primal BC problem under per-modem total power constraints is found by the dual optimization problem for the BC under permodem total power constraints which can be rewritten as a dual optimization problem in the MAC by means of a precoder matrix based on the Lagrange multipliers. We show that the duality gap between the two problems is zero. The multi-user power allocation problem has been solved for interference channels and MAC using the OSB algorithm. In this paper we solve the problem of multiuser power allocation for the BC case using the OSB algorithm as well and we derive a computational efficient algorithm that will be referred to as BC-OSB. Simulation results are provided for two VDSL2 scenarios: the first one with Differential-Mode (DM) transmission only and the second one with both DM and Phantom-Mode (PM) transmissions.
Cited by 0
Daan H. de Groot, Jean‐Baptiste Caillau, Jean‐Luc Gouzé · SPIRE - Sciences Po Institutional REpository · 2021
International audience
Cited by 0Open access
A. Venkataramana, J. Carr, R. S. Ramshaw · IEEE Power Engineering Review · 1987
A systematic procedure is developed to locate reactive power devices in a power system based on a set of indices, that are based on overall system conditions. After identifying the desired locations, the cost of installation and number of reactive power devices, subject to any required practical and real economic constraints, are minimized. Existing controllers are fully utilized before adding any new devices. Linearized sensitivity relationships of power systems are used to obtain an objective function for minimizing the cost of installation. The constraints include the limits on dependent variables (reactive powers of the generators, load bus voltages) and control variables (generator voltages, tap positions, switchable reactive power sources). A parametric linear programming technique based on active set analysis is proposed to solve the reactive power allocation problem.
Cited by 0
Amihai Glazer, Refael Hassin · Economics Letters · 1998
Cited by 1
Xiaolin Wu · 2002
Given M quantizers of variable rates, scaler or/and vector, the globally optimal allocation of B bits to the M quantizers can be computed in O(MB/sup 2/) time with integer constraint, or O(MB2/sup B/) time without. The author also considers the nested optimization problem of optimal bit allocation with respect to optimal quantizers. Various algorithmic techniques are proposed to solve this new problem in pseudo-polynomial time.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 11
Gregory W. Brown, Juha Joenväärä, Christian Lundblad et al. · SSRN Electronic Journal · 2024
Cited by 0Open access
2010
This paper develops a unifying framework for allocating the aggregate capital of a financial firm to its business units. The approach relies on an optimisation argument, requiring that the weighted sum of measures for the deviations of the business unit’s losses from their respective allocated capitals be minimised. The approach is fair insofar as it requires capital to be close to the risk that necessitates holding it. The approach is additionally very flexible in the sense that different forms of the objective function can reflect alternative definitions of corporate risk tolerance. Owing to this flexibility, the general framework reproduces several capital allocation methods that appear in the literature and allows for alternative interpretations and possible extensions.
Cited by 0
Jan Dhaene, et al. · 2009
This paper develops a unifying framework for allocating the aggregate capital of a financial firm to its business units. The approach relies on an optimisation argument, requiring that the weighted sum of measures for the deviations of the business unit’s losses from their respective allocated capitals be minimised. This enables the association of alternative allocation rules to specific decision criteria and thus provides the risk manager with flexibility to meet specific target objectives. The underlying general framework reproduces many capital allocation methods that have appeared in the literature and allows for several possible extensions. An application to an insurance market with policyholder protection is additionally provided as an illustration.
Cited by 0
Merino Sautua, Izaskun, Merino Sautua, Izaskun · Spiral (Imperial College London) · 2008
Cited by 0
John H. Reif · 2011
Cited by 0