DOCSLIB.ORG

Redacted for Privacy Professor Donald Guthrie, Jr

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Redacted for Privacy Professor Donald Guthrie, Jr AN ABSTRACT OF THE THESIS OF John Anthony Battilega for the DOCTOR OF PHILOSOPHY (Name) (Degree) in Mathematics presented on May 4, 1973 (Major) (Date) Title: COMPUTATIONAL IMPROVEMENTS TO BENDERS DECOMPOSITION FOR GENERALIZED FIXED CHARGE PROBLEMS Abstract approved Redacted for privacy Professor Donald Guthrie, Jr. A computationally efficient algorithm has been developed for determining exact or approximate solutions for large scale gener- alized fixed charge problems. This algorithm is based on a relaxa- tion of the Benders decomposition procedure, combined with a linear mixed integer programming (MIP) algorithm specifically designed to solve the problem associated with Benders decomposition and a com- putationally improved generalized upper bounding (GUB) algorithm which solves a convex separable programming problem by generalized linear programming. A dynamic partitioning technique is defined and used to improve computational efficiency.All component algor- ithms have been theoretically and computationally integrated with the relaxed Benders algorithm for maximum efficiency for the gener- alized fixed charge problem. The research was directed toward the approximate solution of a particular class of large scale generalized fixed charge problems, and extensive computational results for problemsof this type are given.As the size of the problem diminishes, therelaxations can be enforced, resulting in a classical Bendersdecomposition, but with special purpose sub-algorithmsand improved convergence pro- perties. Many of the results obtained apply to the sub-algorithmsinde- pendently of the context in which theywere developed. The proce- dure for solving the associated MIP is applicableto any linear 0/1 problem of Benders form, and the techniquesdeveloped for the linear program are applicable to any large scale generalized GUB implemen- tation. Computational Improvements to Benders Decomposition for Generalized Fixed Charge problems by John Anthony Battilega A THESIS submitted to Oregon State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy June 1973 APPROVED: Redacted for privacy Professor of Statistics in charge of major Redacted for privacy Ch rman of Department of Mathematics Redacted for privacy Dean of Graduate School Date thesis is presented May 4, 1973 Typed by Janice Wilson for John Anthony Battilega ACKNOWLEDGEMENTS I am indebted to the following people who directlyorindir- ectly contributed to the results of thisresearch: Dr. R. E. Gaskell, formerly of Oregon State University, whoserved as my major professor during the period 1963-1966;Dr. R. E. D. Woolsey, Colorado School of Mines, for encouragement andincentive; Mr. Warren V. Garrison, formerly of Martin-Marietta Corporation,for basic programming assistance with the first versionof the linear program; Commander D. D. Swain, United States Navy,, for suggestions in the formulation of the original problem andfor sponsorship of the research; Mr. Paul L. Groover, Martin-MariettaCorporation, for assistance and motivation during the initial stages ofthe research, and for listening to my explanations ofmany unsuccessful sorties; Mr. William L. Cotsworth, Martin-Marietta Corporation,for sugges- tions in the area of computational efficiency (particularlyin the implementation of the generalized linear program), forsignificant assistance in the overall programming task, and formany nights jointly spent testing the algorithmon large problems; Dr. Donald Guthrie, Oregon State University, for continuedunderstanding and support as a thesis advisor; and most of all to JosephF. Bozovich, Martin-Marietta Corporation, without whose continuousencouragement, support, and advice this work would not have been possible. 1 am also grateful to Oregon State Universityfor the award of a National Defense Education Act Fellowship for the period 1963-1966. The necessary background and the opportunity to realizethis work are a direct result of manyyears of sacrifice and encourage- ment from my parents, Ercole and Odelia Battilega. My final gratitude, for ten years of unselfish support, and for typing several drafts of this work, is tomy wife, Nancy. This research was supported under contract from the Office of the Assistant Secretary of Defense (Systems Analysis)to Martin- Marietta Corporation, Denver, Colorado. TABLE OF CONTENTS Introduction Problem Formulation 11 20 Problem Solution and Reduction . .... 35 Dynamic Partitioning . Relaxed Decomposition Procedures . 43 Motivation 44 Relaxations of the Benders Procedure 45 Dual Variable Computations . 52 Determination ofy0- ...... .... 56 Alternate Constraint Computations 60 Stability Considerations 72 Integrated Large Scale Generalized Linear Programming 77 GLIB Computational Efficiency 77 Generalized Linear Programming and Dynamic Partitioning 89 Relaxed Benders Algorithm Integration 97 A Starting Basis Algorithm . 100 Scaling Procedures 109 Bootstrap Mixed Integer Programming 112 Computational Improvements to Balas Codes 115 Computational Improvements for Problems of Benders Form120 The Bootstrap Algorithm 121 Relaxed Benders Algorithm integration 126 Stability Modifications 127 Statement of the Algorithm . ..... 131 Computational Experience .... ... 133 Problem Descriptions........... 135 Phases of Development 139 Generalized Linear Program Results .... 139 Associated Mixed Integer Program Results . 146 Relaxed Benders Algorithm Results 147 Stability Modification 1 . .......... 159 Test Problem Convergence ..... .... 160 Relaxation Parameters 161 Summary and Directions for Further Research 170 Summary 170 Directions for Further Research 173 Bibliography 176 Appendix I: Benders Decomposition 190 Appendix II: Generalized Upper Bounding . 195 Appendix III: Balas Additive Algorithm . 202 Appendix IV: A Weapon Allocation Application 208 Appendix V: A Test Problem 217 COMPUTATIONAL IMPROVEMENTS TO BENDER'S DECOMPOSITION FOR GENERALIZED FIXED CHARGE PROBLEMS I. INTRODUCTION This research was motivated by a particular class of resource allocation problems, further described in Appendix IV. The first result obtained was a. mathematical programming model which described - the class of allocation problems. This model is one of the class of problems known as fixed charge problems (Cooper and Drebes (1967), Steinberg (1970), Jones and Soland (1969), Murty (1968), Balinski and Spielberg (1969), and Hirsh and Dantzig (1968).) Simplification of the Model yields the fixed charge transpor- tation or location problems of the general.variety discussed in (1969), Gavett and Plyter (1966), Toregas, Swain, Revelle, and Bergmen (1971), Stroup (1967); and Kuhn and BauMol (1962), although these formulations are pure integer programs. Specifically, the mathematical programming problem of interest is a 0/1 mixed integer programming problem of the following form. - maximize f(x) subject to the constraints _ - Ax +By b (1) x 0 y.=0,1 where f(x) is a concave separable function. A special case of (1) is a linear 0/1 mixed integer program of the form maximize c subject to the constraints - Ax +By 5 b (2) x, 0 . y. 0,1 Problem (1) is a fixed charge problem which directly general- izes the problem described by Miercort and:Soland (1971). Problem (2) generalized the fixed-charge transportation/location problems discussed by Balinski (1961), Hadley (1964), Spielberg (1964), Efroymson and Ray (1966), Gray (1967 and 1971), and Khumawala (1972). (In, this work, Problem (2) will also be used as a part of the algor- ithm for solving (1)..) The dimensionality of the problems of interest classify (1) as a large-scale 0/1 mixed integer program. (100-2000/1 vari- ables, 700-1000 constraint rows, and several hundred thousand con- tinuous variables (related in a special way).) When this research was initiated, it was not clear that (1) could be solved in the desired time (30,-60 minutes, CDC 6400 cpu time). Even though the algorithm was to be developed using the CDC 6400, the procedure must not use machine-dependent features (as in the OPHELIE-II(1970) System, for example)-in an essential way to achieve computational efficiency. Furthermore, published compu- tational results for mixed integer algorithms were not encouraging: most of the problems considered were smaller than (1), solution times were dependent on problem structure, c, solution times Were dependent on the problem data within a given structure, solution times were dependent on the computer, compiler, and code used to implement the algorithm. Nearly all references in the bibliography contain data on one or more of these items. However, summary results citing computation times can be found in Trauth and Woolsey (1969), Mears and Dawkins (1968), Geoffrion and Marsten (1972), Garfinkel and Nemhauser (1972), and Spielberg (1972). The importance of problem structure is empha- sized in Balinski (1965), Balinski and Spielberg (1969), and Geoffrion and Marsten (1972). (These three papers, along with the work of Garfinkel and Nemhauser (1972) give a survey of the state of the art of mixed integer and integer programming.)The effects of algorithm implementation on its efficiency are discussed in Mears and Dawkins (1968) and Klingman, Glover, Karney, and Napier (1971). Because of initial uncertainties involved with the large scale (1), the following additional computational objectives were estab- lished; To solve the problem by generating a sequence of "good" feasible solutions. To be able to bound the deviation of the current solution from the theoretical optimum. If possible, to provide an
Load more

Recommended publications
  • Dynamic Functions in Dyalog
    Direct Functions in Dyalog APL John Scholes – Dyalog Ltd. [email protected] A Direct Function (dfn) is a new function definition style, which bridges the gap between named function expressions such as and APL’s traditional ‘header’ style definition. Simple Expressions The simplest form of dfn is: {expr} where expr is an APL expression containing s and s representing the left and right argument of the function respectively. For example: A dfn can be used in any function context ... ... and of course, assigned a name: Dfns are ambivalent. Their right (and if present, left) arguments are evaluated irrespective of whether these are subsequently referenced within the function body. Guards A guard is a boolean-single valued expression followed by . A simple expression can be preceded by a guard, and any number of guarded expressions can occur separated by s. Guards are evaluated in turn (left to right) until one of them yields a 1. Its corresponding expr is then evaluated as the result of the dfn. A guard is equivalent to an If-Then-Else or Switch-Case construct. A final simple expr can be thought of as a default case: The s can be replaced with newlines. For readability, extra null phrases can be included. The parity example above becomes: Named dfns can be reviewed using the system editor: or , and note how you can comment them in the normal way using . The following example interprets a dice throw: Local Definition The final piece of dfn syntax is the local definition. An expression whose principal function is a simple or vector assignment, introduces a name that is local to the dfn.
    [Show full text]
  • Xerox University Microfilms 300 North Zeeb Road Ann Arbor, Michigan 48106 76-15,823
    INFORMATION TO USERS This material was produced from a microfilm copy of the original document. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependent upon the quality of the original submitted. The following explanation of techniques is provided to help you understand markings or patterns which may appear on this reproduction. 1. The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting thru an image and duplicating adjacent pages to insure you complete continuity. 2. When an image on the film is obliterated with a large round black mark, it is an indication that the photographer suspected that the copy may have moved during exposure and thus cause a blurred image. You will find a good image of the page in the adjacent frame. 3. When a map, drawing or chart, etc., was part of the material being photographed the photographer followed a definite method in "sectioning" the material. It is customary to begin photoing at the upper left hand corner of a large sheet and to continue photoing from left to right in equal sections with a small overlap. If necessary, sectioning is continued again — beginning below the first row and continuing on until complete. 4. The majority of users indicate that the textual content is of greatest value, however, a somewhat higher quality reproduction could be made from "photographs" if essential to the understanding of the dissertation.
    [Show full text]
  • Ginger Documentation Release 1.0
    Ginger Documentation Release 1.0 sfkl / gjh Nov 03, 2017 Contents 1 Contents 3 2 Help Topics 27 3 Common Syntax 53 4 Design Rationales 55 5 The Ginger Toolchain 83 6 Low-Level Implementation 99 7 Release Notes 101 8 Indices and tables 115 Bibliography 117 i ii Ginger Documentation, Release 1.0 This documentation is still very much work in progress The aim of the Ginger Project is to create a modern programming language and its ecosystem of libraries, documen- tation and supporting tools. The Ginger language draws heavily on the multi-language Poplog environment. Contents 1 Ginger Documentation, Release 1.0 2 Contents CHAPTER 1 Contents 1.1 Overview of Ginger Author Stephen Leach Email [email protected] 1.1.1 Background Ginger is our next evolution of the Spice project. Ginger itself is a intended to be a rigorous but friendly programming language and supporting toolset. It includes a syntax-neutral programming language, a virtual machine implemented in C++ that is designed to support the family of Spice language efficiently, and a collection of supporting tools. Spice has many features that are challenging to support efficiently in existing virtual machines: pervasive multiple values, multiple-dispatch, multiple-inheritance, auto-loading and auto-conversion, dynamic virtual machines, implicit forcing and last but not least fully dynamic typing. The virtual machine is a re-engineering of a prototype interpreter that I wrote on holiday while I was experimenting with GCC’s support for FORTH-like threaded interpreters. But the toolset is designed so that writing alternative VM implementations is quite straightforward - and we hope to exploit that to enable embedding Ginger into lots of other systems.
    [Show full text]
  • Speeches and Papers
    ROOMS 1-2-3 THE IMPACT OF STANDARDIZATION FOR THE 70's (PANEL) ROBERT W. BEMER General Electric Company Phoenix, Arizona CHAIRMAN AND TECHNICAL PROGRAM CHAIRMAN'S MESSAGE , CONFERENCE AWARDS ' - Harry Goode Memorial Award 3 Best Paper Award 3 Best Presentation Award 3 TECHNICAL PROGRAM 4 CONFERENCE-AT-A-GLANCE (Centerfold) 52,53 CONFERENCE LUNCHEON 75 Luncheon Speaker 75 EDUCATION PROGRAM 76 SPECIAL ACTIVITIES 76 Conference Reception 76 Conference Luncheon 76 Computer Science and Art Theater 76 Computer Art Exhibit 77 Computer Music Exhibit 77 Scope Tour 77 LADIES PROGRAM 78 Hospitality Suite 78 Activities 78 GENERAL INFORMATION 79 Conference Location 79 MASSACHUSETTS INSTITUTE OF TECHNOLOGY PROJECT MAC Reply to: Project MAC 545 Technology Square Cambridge, Mass. 02139 June 5, 1969 Telephone: (617 ) 864-6900 x6201 Mr. Robert W. Bemer General Electric Company (C-85) 13430 North Black Canyon Highway Phoenix, Arizona 85029 Dear Bob: Thank you very much for your participation in my panel session at the Spring Joint Computer Conference. On the basis of a number of comments I received from both strangers and friends and also my own assessment, I think we had a successful session. I particularly appreciate your willingness to contribute your time and efforts to discussion of the problems of managing software projects. As I may have told you previously, I have been teaching a seminar on this same subject at M.I.T. A number of my students who attended the session were particularly interested in the presentations by the panelists. I would appreciate it if you could send me copies of your slide material for use in my class.
    [Show full text]
  • 2D3-Induced Genes in Osteoblasts
    THE REGULATION AND FUNCTION OF 1,25-DIHYDROXYVITAMIN D3- INDUCED GENES IN OSTEOBLASTS by AMELIA LOUISE MAPLE SUTTON Submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy Advisor: Dr. Paul N. MacDonald Department of Pharmacology CASE WESTERN RESERVE UNIVERSITY August 2005 CASE WESTERN RESERVE UNIVERSITY SCHOOL OF GRADUATE STUDIES We hereby approve the thesis/dissertation of ______________________________________________________ candidate for the ________________________________degree *. (signed)_______________________________________________ (chair of the committee) ________________________________________________ ________________________________________________ ________________________________________________ ________________________________________________ ________________________________________________ (date) _______________________ *We also certify that written approval has been obtained for any proprietary material contained therein. I would like to dedicate this dissertation to my amazing mother. This is the very least I can do to say thank you to the woman who has dedicated her entire life to me. TABLE OF CONTENTS Dedication ii Table of Contents iii List of Tables iv List of Figures v Acknowledgments vii Abstract xiv Chapter I Introduction 1 Chapter II The 1,25(OH)2D3-regulated transcription factor MN1 64 stimulates VDR-medicated transcription and inhibits osteoblast proliferation Chapter III The 1,25(OH)2D3-induced transcription factor 98 CCAAT/enhancer-binding protein-β cooperates with VDR
    [Show full text]
  • FEMA 369 2000 Edition
    Program on Improved Seismic Safety Provisions Of the National Institute of Building Sciences 2000 Edition NEHRP RECOMMENDED PROVISIONS FOR SEISMIC REGULATIONS FOR NEW BUILDINGS AND OTHER STRUCTURES Part 2: Commentary (FEMA 369) The Building Seismic Safety Council (BSSC) was established in 1979 under the auspices of the Na- tional Institute of Building Sciences as an entirely new type of instrument for dealing with the complex regulatory, technical, social, and economic issues involved in developing and promulgating building earth- quake hazard mitigation regulatory provisions that are national in scope. By bringing together in the BSSC all of the needed expertise and all relevant public and private interests, it was believed that issues related to the seismic safety of the built environment could be resolved and jurisdictional problems overcome through authoritative guidance and assistance backed by a broad consensus. The BSSC is an independent, voluntary membership body representing a wide variety of building community interests. Its fundamental purpose is to enhance public safety by providing a national forum that fosters improved seismic safety provisions for use by the building community in the planning, design, construction, regulation, and utilization of buildings. To fulfill its purpose, the BSSC: (1) promotes the development of seismic safety provisions suitable for use throughout the United States; (2) recommends, encourages, and promotes the adoption of appropriate seismic safety provisions in voluntary standards and model codes;
    [Show full text]
  • Computer Science and the Organization of White-Collar Work, 1945-1975
    Post-Industrial Engineering: Computer Science and the Organization of White-Collar Work, 1945-1975 by Andrew Benedict Mamo A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in History in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Cathryn Carson, Chair Professor David Hollinger Professor David Winickoff Spring 2011 Post-Industrial Engineering: Computer Science and the Organization of White-Collar Work, 1945-1975 © 2011 by Andrew Benedict Mamo Abstract Post-Industrial Engineering: Computer Science and the Organization of White-Collar Work, 1945-1975 by Andrew Benedict Mamo Doctor of Philosophy in History University of California, Berkeley Professor Cathryn Carson, Chair The development of computing after the Second World War involved a fundamental reassessment of information, communication, knowledge — and work. No merely technical project, it was prompted in part by the challenges of industrial automation and the shift toward white-collar work in mid-century America. This dissertation therefore seeks out the connections between technical research projects and organization-theory analyses of industrial management in the Cold War years. Rather than positing either a model of technological determinism or one of social construction, it gives a more nuanced description by treating the dynamics as one of constant social and technological co-evolution. This dissertation charts the historical development of what it has meant to work with computers by examining the deep connections between technologists and mid-century organization theorists from the height of managerialism in the 1940s through the decline of the “liberal consensus” in the 1970s. Computing was enmeshed in ongoing debates concerning automation and the relationship between human labor and that of machines.
    [Show full text]
  • Problems of Drug Dependence 1989: Proceedings of the 51St Annual
    National Institute on Drug Abuse MONOGRAPH SERIES Problems of Drug Dependence 1989 Proceedings of the 51st Annual Scientific Meeting The Committee on Problems of Drug Dependence, Inc. U S DEPARTMENT OF HEALTH AND HUMAN SERVICES • Public Health Service • Alcohol, Drug Abuse, and Mental Health Administration Problems of Drug Dependence 1989 Proceedings of the 51st Annual Scientific Meeting The Committee on Problems of Drug Dependence, Inc. Editor: Louis S. Harris, Ph.D. NIDA Research Monograph 95 U.S. DEPARTMENT OF HEALTH AND HUMAN SERVICE Public Health Service Alcohol, Drug Abuse, and Mental Health Administration National Institute on Drug Abuse Off ice of Science 5600 Fishers Lane Rockville, MD 20857 For sale by the Superintendent of Documents, U.S. Government Printing Office Washington, DC 20402 NIDA Research Monographs are prepared by the research divisions of the National Institute on Drug Abuse and published by its Office of Science. The primary objective of the series is to provide critical reviews of research problem areas and techniques, the content of state-of-the-art conferences, and integrative research reviews. Its dual publication emphasis is rapid and targeted dissemination to the scientific and professional community. Editorial Advisors MARTIN W. ADLER, Ph.D. MARY L. JACOBSON Temple University School of Medicine National Federation of Parents for Philadelphia, Pennsylvania Drug-free Youth Omaha, Nebraska SYDNEY ARCHER, Ph.D. Rensselaer Polytechnic Institute Troy, New York REESE T. JONES, M.D. Langley Porter Neuropsychiatric Institute RICHARD E. BELLEVILLE, Ph.D. San Francisco, California NB Associates, Health Sciences Rockville, Maryland DENISE KANDEL, Ph.D. KARST J. BESTEMAN College of Physicians and Surgeons of Alcohol and Drug Problems Association Columbia University of North America New York, New York Washington, D.C.
    [Show full text]
  • Three Implementation Models for Scheme
    Three Implementation Models for Scheme by R. Kent Dybvig A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science. Chapel Hill 1987 Approved by: Advisor Reader Reader c 1987 R. Kent Dybvig ALL RIGHTS RESERVED R. KENT DYBVIG. Three Implementation Models for Scheme (Under the direc- tion of GYULA A. MAGO.) Abstract This dissertation presents three implementation models for the Scheme Program- ming Language. The first is a heap-based model used in some form in most Scheme implementations to date; the second is a new stack-based model that is consider- ably more efficient than the heap-based model at executing most programs; and the third is a new string-based model intended for use in a multiple-processor im- plementation of Scheme. The heap-based model allocates several important data structures in a heap, including actual parameter lists, binding environments, and call frames. The stack-based model allocates these same structures on a stack whenever possible. This results in less heap allocation, fewer memory references, shorter instruction sequences, less garbage collection, and more efficient use of memory. The string-based model allocates versions of these structures right in the program text, which is represented as a string of symbols. In the string-based model, Scheme programs are translated into an FFP language designed specifically to support Scheme. Programs in this language are directly executed by the FFP machine, a multiple-processor string-reduction computer.
    [Show full text]
  • Measuring Space Systems Flexibility: a Comprehensive Six-Element Framework
    Measuring Space Systems Flexibility: A Comprehensive Six-element Framework by Roshanak Nilchiani M.S. Engineering Mechanics, University of Nebraska-Lincoln, 2002 B.S. Mechanical Engineering, Sharif University of Technology, 1998 SUBMITTED TO THE DEPARTMENT OF AERONAUTICS AND ASTRONAUTICS IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY IN AEROSPACE SYSTEMS AT THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 2005 Copyright © 2005 Massachusetts Institute of Technology. All Rights Reserved Author…………………………………………………………….……………………. Space Systems Laboratory, Department of Aeronautics and Astronautics Certified by………………………………………………………………………………. Daniel E. Hastings, Thesis Committee Chair Director, Engineering Systems Division Professor of Engineering Systems and Aeronautics and Astronautics Certified by.…………………………………….…………………….………………… Joseph M. Sussman, Thesis Supervisor Professor of Civil and Environmental Engineering and Engineering Systems Certified by…………………………………………………….………………………… David W. Miller, Thesis Supervisor Associate Professor of Aeronautics and Astronautics Accepted by………………………………………………….………………………………….. Jaime Peraire, Professor of Aeronautics and Astronautics Chair, Committee on Graduate Students 2 Measuring Space Systems Flexibility: A Comprehensive Six-element Framework by Roshanak Nilchiani Submitted To the Department of Aeronautics and Astronautics In Partial Fulfillment of The Requirements For The Degree Of Doctor of Philosophy In Aerospace Systems At the Massachusetts Institute Of Technology Abstract Space systems are extremely delicate and costly engineering artifacts that take a long time to design, manufacture, and launch into space and after they are launched, there is limited access to them. Millions of dollars of space systems assets lost annually, when the space system has failed to meet new market conditions, cannot adapt to new applications, its technology becomes obsolete or when it cannot cope with changes in the environment it operates in.
    [Show full text]
  • Financial Numerical Recipes in C++
    Financial Numerical Recipes in C++. Bernt Arne Ødegaard June 2014 5.1 The interchangeability of discount factors, spot interest rates and forward interest rates . 52 5.2 The term structure as an object . 55 5.2.1 Base class . 55 5.2.2 Flat term structure. 57 5.3 Using the currently observed term structure. 58 5.3.1 Linear Interpolation. 59 5.3.2 Interpolated term structure class. 61 Contents 5.4 Bond calculations with a general term structure and continous compounding . 64 6 The Mean Variance Frontier 67 6.1 Setup . 67 6.2 The minimum variance frontier . 69 1 On C++ and programming. 5 6.3 Calculation of frontier portfolios . 69 1.1 Compiling and linking . 5 6.4 The global minimum variance portfolio . 72 1.2 The structure of a C++ program . 6 6.5 Efficient portfolios . 72 1.2.1 Types . 6 6.6 The zero beta portfolio . 73 1.2.2 Operations . 6 6.7 Allowing for a riskless asset. 73 1.2.3 Functions and libraries . 7 6.8 Efficient sets with risk free assets. 74 1.2.4 Templates and libraries . 7 6.9 Short-sale constraints . 75 1.2.5 Flow control . 8 6.10 The Sharpe Ratio . 75 1.2.6 Input Output . 8 6.11 Equilibrium: CAPM . 76 1.2.7 Splitting up a program . 8 6.11.1 Treynor . 76 1.2.8 Namespaces . 9 6.11.2 Jensen . 76 1.3 Extending the language, the class concept. 9 6.12 Working with Mean Variance and CAPM . 76 1.3.1 date, an example class .
    [Show full text]
  • GWJ Drewes, Taufik Abdullah, Islam and Society in Southeast Asia
    Book Reviews - G.W.J. Drewes, Taufik Abdullah, Islam and society in Southeast Asia, Institute of Southeast Asian studies, Singapore, 1986, XII and 348 pp., Sharon Siddique (eds.) - Th. van den End, T.Valentino Sitoy, A history of Christianity in the Philippines. The initial encounter , Vol. I, Quezon City (Philippines): New day publishers, 1985. - R. Hagesteijn, David G. Marr, Southeast Asia in the 9th to 14th centuries, Singapore: Institute of Southeast Asian studies and the research school of Pacific studies of the Australian National University, 1986, 416 pp., A.C. Milner (eds.) - R. Hagesteijn, Constance M. Wilson, The Burma-Thai frontier over sixteen decades - Three descriptive documents, Ohio University monographs in international studies, Southeast Asia series No. 70, 1985,120 pp., Lucien M. Hanks (eds.) - Barbara Harrisson, John S. Guy, Oriental trade ceramics in South-east Asia, ninth to sixteenth century, Oxford University Press, Singapore, 1986. [Revised, updated version of an exhibition catalogue issued in Australia in 1980, in the enlarged format of the Oxford in Asia studies of ceramic series.] 161 pp. with figs. and maps, 197 catalogue ills., numerous thereof in colour, extensive bibliography, chronol. tables, glossary, index. - V.J.H. Houben, G.D. Larson, Prelude to revolution. Palaces and politics in Surakarta, 1912- 1942. VKI 124, Dordrecht/Providence: Foris publications 1987. - Marijke J. Klokke, Stephanie Morgan, Aesthetic tradition and cultural transition in Java and Bali. University of Wisconsin, Center for Southeast Asian studies, Monograph 2, 1984., Laurie Jo Sears (eds.) - Liaw Yock Fang, Mohamad Jajuli, The undang-undang; A mid-eighteenth century law text, Center for South-East Asian studies, University of Kent at Canterbury, Occasional paper No.
    [Show full text]