THE NON - STOCK EXCHANGE DEALS OPTIMIZATION USING NETFLOW METHOD. V.B.Gorsky, V.P.Stepanov. Saving Bank of Russian Federation,
|
|
- Delilah Sullivan
- 5 years ago
- Views:
Transcription
1 THE NON - STOCK EXCHANGE DEALS OPTIMIZATION USING NETFLOW METHOD. V.B.Gorsky, V.P.Stepanov. Saving Bank of Russian Federation, dwhome@sbrf.ru Abstract. We would like to present the solution of the following problem: some organization has a number of clients, which have their own portfolios of bonds ( or it can be any type of commodities ). Sometimes they would like to buy, to sell, or to sell one type of bond and to buy another bond on money from the bond sale, or from some client account. The clients can do it through external organizatio(p.e. on Stock Exchange), but the exchange operations between them inside the organization will be more profitable for them. The tasks are 1) to reveal the chains of mutual exchanges between client bids with maximum value of internal bond flow ; 2) to calculate the required external stock exchange operations and the importance of each of them. Each client has its own position in scale of priority. Besides each client has own requisitions on the exchange operation, the price of commodity in sale must be higher then some value and vice versa in buy operations the price must be lower then another value. For example, the 1-st client wants to sell monitors, the 2-nd client wants to sell printers and on received money to buy monitors, the 3-rd client sells keyboards and buys printers, the 4-th client buys keyboards. Some part of client bids can be realized without stock using this chain provided sell and buy prices satisfy each other. But, par example, if the sell price of 3-rd client is higher then buy price of the 4-th client the whole exchange chain will be impossible. It will possible only if some stock buy offer fulfilling the 3-rd client sell requisitions will be found. Besides, in cash flow the whole buy sum must be less then whole sell sum plus client account sum for each client. The resolving algorithm and program find not only horizontal, but also vertical chain exchanges, because the same client can simultaneously buy and sell several commodities. The algorithm finds the required stock exchanges and calculates the order of priority of each of them. The priority of each stock deals is proportional to the number of non-stock exchanges which will be possible after such stock deal completion. The integer-valued solution is founded using iterative netflow algorithm taking into account the whole net of commodity and cash flow, including the cash flows arising due to buy and sell sum mismatch. The primary requests and the final results, including a set of checks, can be in any form: text or excel file, any database format with SAS access. Using netdraw procedure we present the graphical form of obtained solution. The system enables to store and to reproduce the initial conditions and final and intermediate results of obtained resolution in SAS or external database. 1/8
2 THE NON - STOCK EXCHANGE DEALS OPTIMIZATION USING NETFLOW METHOD. V.B.Gorsky, V.P.Stepanov. Saving Bank of Russian Federation, oriscb@sbrf.ru We would like to present our solution of the optimization problem of non-stock exchange deals between and more clients wishful to buy, to sell or to do buy and sell simultaneously some commodities. For example, some organization has a number of clients, which have their own portfolios of bonds. Sometimes they would like to buy, to sell on money from their own account, or to sell one type of bond and to buy another bond on money from the bond sale during the stock-exchange session. The clients can do it through some external organization ( p.e. on Stock Exchange), but direct exchange operations between them without stock exchange will be more profitable for them because of the more acceptable price and absence of stock tax. The resolving of the problem can be subdivided into two stages. - Non-stock exchange decision. The chains of mutual exchanges between the clients with maximum value of internal bond price flow to be revealed. It means that the beginning of all chains are the clients selling the bonds (commodities) and the closing elements of all chains are clients buying bonds (commodities). Insight the chains are clients buying and selling bonds (commodities) simultaneously. Of course every client can have a lot of exchange operations with other clients, even for single bond (or type of commodity). Any connection with external organization (stock exchange) on this stage are prohibited. This deals are to be accomplished before the stockexchange session will begin. - Exchange decision with stock operations. The calculation of the required stock exchange operations and the importance of each of them are to be performed. The importance of any stock exchange operations is defined by the volume of non-stock exchange deals be enabled by the stock operation. We should have an opportunity during the stock session to estimate the losses which we would have if some necessary stock operation would not be accomplished. Additional restrictions. Each client has its own position in scale of priority. In other equal conditions the client with higher priority will be the first in queue on nonstock exchange operations. Besides each client has own requisitions on the exchange operation, the price of commodity in sale must be higher then some value and vice versa in buy operations the price must be lower then some another value. For example, the 1-st client wants to sell monitors, the 2-nd client wants to sell printers and on received money to buy monitors, the 3-rd client sells keyboards and buys printers, the 4-th client buys keyboards. The flow of commodities and cash on each step are defined by the least bid in money terms of exchanges in this chain. Some part of client bids can be realized without stock using this chain provided sell 2/8
3 and buy prices satisfy each other. This is the simplest example of the first non-stock exchange decision. But if we propose that the asked sell price of 3-rd client on keyboards is higher then bid buy price of the 4-th client the whole exchange chain would be impossible. It will be possible only if some stock buy offer fulfilling the 3-rd client asked sell requisitions will be found. In this case we shell obtain internal exchange decision with some stock-end deals. Of course for 4-th client we should found the stock exchange sell offer, with sell price lower than bid buy price of the 4-th client. Some another restrictions exists on commodity quantity flow. For sell deals the maximum sell value is defined by client bid. For buy operation the maximum buy quantity is defined as the least quantity between two values : a) client bid and b) money on client account plus possible client sell operations in money terms. The primary client bids can be read from some standard MS Excel form, or from any relational database with supported SAS connection. The bids include the client code, bid type (sell, buy, or sell and buy), requirements (the acceptable price range), asked bid quantity and money sum on client accounts. Besides some additional information is required, for example average commodity stock prices, because the non-stock exchange operations can be accomplished by average stock prices. Lets consider the stages of the problem solution. 1. We select bids which can take part in non-stock exchange deals. We select clients bids on commodities which are simultaneously in sell and buy bids. Furthermore we select only clients buy bids with prices which are higher then the lowest sell price on the bid commodity, and we select sell bids with prices which are lower then the highest buy price on the bid commodity. 2. The non-selected bids that can be realized only through the stock, because declared commodities are only in sell or only in buy bids, aren t considered in our task later. 3. The non-stock exchange decision is founded. The whole list of exchange operations between clients are calculated. Several checks are to be fulfilled for testing of decision correctness. 4. Exchange decision with stock operations is founded. The list of all required stock deals and non-stock exchange operations available after completion of the stock deals are calculated. Besides the list of non-stock exchange operation is furnished for each required stock deal. In the list opposite to every stock deal the exchange operations are reported which would be impossible if the stock deals will not be accomplished. 3/8
4 Sell Clients Sell Bonds Buy Bonds Buy Clients Client1 Bond1 Bond11 Bond12 Client11 -Money Client2 Bond2 Bond13 Client12 +Money Bond3 Bond14 Client3 Bond4 Bond15 Client13 Fig.1.. The simple sell bids (left) and the buy bids(right). Arrows shows the motion direction of the bonds. Now we shell discuss the items of the non-stock exchange decision in details. 1. We shell use NETFLOW procedure and we shell describe nodes and flow capacities. 2. At first we shell describe simple sell or buy bids. In the NETFLOW PROC this deals are described as in Fig.1. All ARC capacities are expressed in money units. The ARC capacities from - /+MONEY to Clients are INFINITY, while the ARC capacities from CLIENTS to BONDS are (client bids quantity)*(bonds market price). 3. The sell and buy bids are described as in Fig.2. Buy Bonds Bond11 Bond3 Buy and Sell Clients Client21 Sell Bonds Bond1 Bond11 Buy and Sell Clients Client21 Bond1 Bond13 Client22 Bond2 Bond13 Client22 Bond2 Bond14 Bond1 Client23 Bond3 Bond4 Bond14 Client23 Bond3 Bond4 Fig.2. The buy and sell primary bids (left), the scheme after the reducing of the buy and sell bids. Summing up lets enumerate the steps of the net construction for NETFLOW proc. The scheme is shown in Fig.3. 4/8
5 1. We put two nodes -MONEY, +MONEY, which will be the source and the sink nodes. 2. We put all the clients as a nodes on the scheme. 3. We put all the bonds as a nodes taking part in sell and buy bids simultaneously on the scheme. 4. We connect -MONEY with CLIENTs only selling bonds by ARCs with capacities equals to infinity and COST equals to We connect CLIENTs only buying bonds with +MONEY by ARCs with capacities equals to amount of money on clients accounts and COST equals to We connect CLIENTs (nodes), selling bonds, with appropriate SELL BONDs (nodes) with ARCs having capacities equal to (clients sell bids quantity) times (bond market price) and COST equals to We connect CLIENTs (nodes) with +MONEY (nodes) by ARCs having capacities equals to amounts on clients accounts and COST equals to We connect BUY BONDs (nodes) with appropriate CLIENTs (nodes), buying this bonds, by ARCs having capacities equals to (amounts on clients accounts) + (selling bonds sum). All this value is rounded to the price of integer number of buying bonds. COST equals to We connect -MONEY with CLIENTs, both buying and selling bonds, by ARCs taking into account the effect integer rounding, arising due to price difference of selling and buying bonds. The CAPACITY of this ARCs equals to price of appropriate single selling bond, and COST equals to 10. (9) (7) -Money(1) (4) Selling (6) Selling & Buying Buying (5) +Money(1) (8) (6) Bonds(3) (8) Fig.3. The scheme of NETFLOW proc used for problem resolution. Numbers denotes stages described above. Arrows show the bond movement directions< while cash moves in opposite direction. 5/8
6 Now lets consider the algorithm of resolving the NETFLOW proc. Some complication exists: we should obtain the resolution in integer values. Besides the rest from rounding we should include in goal function in some cases. 1) (OUTER LOOP) 2) (INNER LOOP)We resolve the NETFLOW proc. 3) (INNER LOOP)We round the cash flows on arrows with numbers (6) and (8) and limit the CAPAC values on this ARCs with this rounded values. 4) (INNER LOOP)We return to step 1 until the loop convergence. 5) (OUTER LOOP) We decrease the CAPAC values on arrows (6), (7) and (8) on obtained FLOW values. 6) (OUTER LOOP) We increase money client account sums on rounding values: CAPAC of arrows(7) on FLOWS of arrows(9) 7) (OUTER LOOP) Return to step 1 until the values on steps (6) & (8) will be less then the price of appropriate single bond. 8) The final result is the sum of solutions obtained in OUTER CYCLE. The results are represented in table and graph form using NETDRAW proc. Fig.4. Some part of the graphical solution of the NETFLOW proc. Several pages are necessary for representing the all scheme. Each rectangle with clients includes whole information about deals: quantity, bond price, client code; the bond rectangle includes information about the bond.. Now lets consider the second solution : exchange decision with stock operations. The scheme for NETFLOW proc has the following structure (Fig.5). In addition to 9 points shown on Fig.3 and enumerated above for no non-stock exchange operations the following nodes and arcs are added to the scheme. 10. Bonds (nodes), which are only in buy bids, but only for clients having both buy and sell bids, and for which their sell side can take part in non-stock 6/8
7 exchange. For clients buying bonds, which are only in buy bids only stock exchange deal is possible. 11. Bonds (nodes), which are only in sell bids, but for clients having buy side also, that can participate in non-stock exchange STOCK, which is intermediate node between -MONEY and bonds, which are only in buy bids STOCK, which is intermediate node between bonds, which are only in sell bids, and +MONEY. 14. The ARCs between -STOCK and -MONEY, +STOCK and +MONEY have CAPAC equals to INFINITY and COST equals to The ARCs from -STOCK to buy BONDs nodes and from sell BONDs nodes to +STOCK have CAPAC equals to buy and sell bond bids respectively in money terms. The stages of resolution of the scheme are the same as it was discussed before 1)-8). (7) (9) Selling (15) Buying (5) +Money(1) -Money(1) (14) (4) (6) (15) Selling & Buying (8) (14) -Stock (selling bonds) (12) (6) Bonds(3) (8) +Stock (buying bonds) (13) Bonds (only in buy bids)(10) Bonds (only in sell bids)(11) Fig.5. The NETFLOW scheme for exchange decision terminated with stock operations. The importance of each deal operation was estimated by the following procedure. Consequently ARCs CAPAC of the stock operations was assimilated to zero, and common variation of non-stock exchange volume in money terms was estimated. The more the difference of non-stock exchange money operation volume with and without the stock deal, the more important is considered stock exchange operation. 7/8
8 In our conditions the range of clients was of the order of 100, number of bonds was about 100, and number of bids was approximately Thus we described our way for optimization of non-stock exchanges between clients buying and selling different commodities. The integer-valued solution is founded using iterative netflow algorithm taking into account the whole net of commodities and cash flow, including the cash flows arising due to buy and sell sum mismatch. The system enables to store and to reproduce the initial conditions and final and intermediate results of obtained resolution in native SAS or external database. 8/8
Lecture 6. 1 Polynomial-time algorithms for the global min-cut problem
ORIE 633 Network Flows September 20, 2007 Lecturer: David P. Williamson Lecture 6 Scribe: Animashree Anandkumar 1 Polynomial-time algorithms for the global min-cut problem 1.1 The global min-cut problem
More informationGibbs Fields: Inference and Relation to Bayes Networks
Statistical Techniques in Robotics (16-831, F10) Lecture#08 (Thursday September 16) Gibbs Fields: Inference and Relation to ayes Networks Lecturer: rew agnell Scribe:ebadeepta ey 1 1 Inference on Gibbs
More informationWhile the story has been different in each case, fundamentally, we ve maintained:
Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 22 November 20 2008 What the Hatfield and Milgrom paper really served to emphasize: everything we ve done so far in matching has really, fundamentally,
More informationConsider the Texaco-Pennzoil case in influence-diagram form, as shown in Figure 4S.1.
1 CHAPTER 4 Online Supplement Solving Influence Diagrams: The Details Consider the Texaco-Pennzoil case in influence-diagram form, as shown in Figure 4S.1. This diagram shows the tables of alternatives,
More informationMixed FIFO/Pro Rata Match Algorithms
Mixed FIFO/Pro Rata Match Algorithms Robert Almgren and Eugene Krel May 3, 23 The NYSE LIFFE exchange has announced a change, effective May 29, 23, to the pro rata trade matching algorithm for three month
More informationA t S + b r t T B (h i + 1) (t S + t T ) C h i (t S + t T ) + t S + b t T D (h i + n) (t S + t T )
Suppose we have a primary B+-tree index where the leaves contain search keys and RIDs, and the RIDs point to the records in a file that is ordered on the index search key. Assume that the blocks in the
More informationLecture 10: The knapsack problem
Optimization Methods in Finance (EPFL, Fall 2010) Lecture 10: The knapsack problem 24.11.2010 Lecturer: Prof. Friedrich Eisenbrand Scribe: Anu Harjula The knapsack problem The Knapsack problem is a problem
More informationSupply Chains: Planning with Dynamic Demand
Department of Industrial Engineering Supply Chains: Planning with Dynamic Demand Jayant Rajgopal, Ph.D., P.E. Department of Industrial Engineering University of Pittsburgh Pittsburgh, PA 15261 PRODUCTION
More informationQuadratic Modeling Elementary Education 10 Business 10 Profits
Quadratic Modeling Elementary Education 10 Business 10 Profits This week we are asking elementary education majors to complete the same activity as business majors. Our first goal is to give elementary
More informationAdvanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras Lecture 23 Minimum Cost Flow Problem In this lecture, we will discuss the minimum cost
More informationLecture 3. Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges
Decision Models Lecture 3 1 Lecture 3 Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges Bidding Problems Summary and Preparation
More informationPHILLIP FUTURES PTA. POEMS Installation and Quick Start User Guideline
PHILLIP FUTURES PTA POEMS 1.8.3 Installation and Quick Start User Guideline NOTICE The best effort has been put in to ensure that the information given in this POEMS Professional 1.8.3 Quick Start User
More informationThis is Interest Rate Parity, chapter 5 from the book Policy and Theory of International Finance (index.html) (v. 1.0).
This is Interest Rate Parity, chapter 5 from the book Policy and Theory of International Finance (index.html) (v. 1.0). This book is licensed under a Creative Commons by-nc-sa 3.0 (http://creativecommons.org/licenses/by-nc-sa/
More informationA Recursive Partitioning Algorithm for Space Information Flow
A Recursive Partitioning Algorithm for Space Information Flow Jiaqing Huang Department of Electronics and Information Engineering Huazhong University of Science and Technology, China jqhuang@mail.hust.edu.cn
More informationSTICHTING SHELL PENSIOENFONDS
STICHTING SHELL PENSIOENFONDS Attachment to Regulations VI 1 January 2014 Content Attachment to Regulations VI of Stichting Shell Pensioenfonds... 3 1. Flexibility options concerning Retirement Age and
More information1) S = {s}; 2) for each u V {s} do 3) dist[u] = cost(s, u); 4) Insert u into a 2-3 tree Q with dist[u] as the key; 5) for i = 1 to n 1 do 6) Identify
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 17: October 25, 2016 Dijkstra s Algorithm Dijkstra s algorithm for the SSSP problem generates the shortest paths in nondecreasing order of the shortest
More informationOct/Nov Ban They play an intermediation role between issuers and consumers of financial instruments;
Oct/Nov 2016 Ban 2601 Question 1: 1. Discount houses - Are the oldest of the money market players; - They play an intermediation role between issuers and consumers of financial instruments; - They are
More informationImplied Price Functionality Overview
Implied Price Functionality Overview Implied Orders First Generation An implied order is an order created from individual outright orders available in the market place. Implied IN/OUT spreading occurs
More informationMicroeconomics 2nd Period Exam Solution Topics
Microeconomics 2nd Period Exam Solution Topics Group I Suppose a representative firm in a perfectly competitive, constant-cost industry has a cost function: T C(q) = 2q 2 + 100q + 100 (a) If market demand
More informationis a path in the graph from node i to node i k provided that each of(i i), (i i) through (i k; i k )isan arc in the graph. This path has k ; arcs in i
ENG Engineering Applications of OR Fall 998 Handout The shortest path problem Consider the following problem. You are given a map of the city in which you live, and you wish to gure out the fastest route
More information1 Supply and Demand. 1.1 Demand. Price. Quantity. These notes essentially correspond to chapter 2 of the text.
These notes essentially correspond to chapter 2 of the text. 1 Supply and emand The rst model we will discuss is supply and demand. It is the most fundamental model used in economics, and is generally
More informationProject Management Fundamentals
Project Management Fundamentals Course No: B04-003 Credit: 4 PDH Najib Gerges, Ph.D., P.E. Continuing Education and Development, Inc. 9 Greyridge Farm Court Stony Point, NY 10980 P: (877) 322-5800 F: (877)
More informationAllocation on the France-Belgium interconnection. Intra-day allocation mechanism
Allocation on the France-Belgium interconnection Intra-day allocation mechanism Information note Table of contents 1. Introduction... 2 2. Product characteristics... 2 2.1. Basis principles... 2 2.2. The
More information56:171 Operations Research Midterm Examination October 25, 1991 PART ONE
56:171 O.R. Midterm Exam - 1 - Name or Initials 56:171 Operations Research Midterm Examination October 25, 1991 Write your name on the first page, and initial the other pages. Answer both questions of
More informationEconomic decision analysis: Concepts and applications
Economic decision analysis: Concepts and applications Jeffrey M. Keisler Stockholm, 23 May 2016 My background and this work Education in DA and Economics Government and industry consulting Portfolio DA
More informationAN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS*
526 AN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS* By JIN Y. YEN (University of California, Berkeley) Summary. This paper presents an algorithm
More informationT R A D E FX BASIC. 1. What is Forex? 2. 8 Majors. 3. What is bought and sold? 4. Types of Charts. 5. Basic Terms EBOOK 01.
T R A D E 1. What is Forex? 2. 8 Majors 3. What is bought and sold? 4. Types of Charts 5. Basic Terms FX BASIC EBOOK 01 FX BASICS 02 What do you know about Forex? The terminology FOREX stands for the Foreign
More informationSample Report. Donor Performance Analysis
Sample Report Donor Performance Analysis Contents Contents 1 Analysis by Donor Life Cycle Stage 2 Introduction 3 Total File Trends 5 New Donors 9 Second New Donors (New Last ) 12 Multi- Donors 15 Lapsed
More informationImplied Liquidity From Redundant Futures Markets. John Curran, MD, Products and Services, CME Group October 15, 2007
Implied Liquidity From Redundant Futures Markets John Curran, MD, Products and Services, CME Group October 15, 2007 Overview of futures contracts Futures are standardized contracts to buy or sell a commodity
More informationMath 1314 Week 6 Session Notes
Math 1314 Week 6 Session Notes A few remaining examples from Lesson 7: 0.15 Example 17: The model Nt ( ) = 34.4(1 +.315 t) gives the number of people in the US who are between the ages of 45 and 55. Note,
More information1. $57.80 The bill is about $58. So, a 20% tip would be $58 divided by 5, which is $11.60.
End of Chapter Test Name Date Estimate a 20% tip for each of the bills shown. 1. $57.80 The bill is about $58. So, a 20% tip would be $58 divided by 5, which is $11.60. 2. $122.46 The bill is about $122.
More informationProblem Set 2: Answers
Economics 623 J.R.Walker Page 1 Problem Set 2: Answers The problem set came from Michael A. Trick, Senior Associate Dean, Education and Professor Tepper School of Business, Carnegie Mellon University.
More informationSCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT. BF360 Operations Research
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit 3 Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 3: Sensitivity and Duality 3 3.1 Sensitivity
More informationDark pool usage and individual trading performance
Noname manuscript No. (will be inserted by the editor) Dark pool usage and individual trading performance Yibing Xiong Takashi Yamada Takao Terano the date of receipt and acceptance should be inserted
More information(i.e. the rate of change of y with respect to x)
Section 1.3 - Linear Functions and Math Models Example 1: Questions we d like to answer: 1. What is the slope of the line? 2. What is the equation of the line? 3. What is the y-intercept? 4. What is the
More informationIEOR E4004: Introduction to OR: Deterministic Models
IEOR E4004: Introduction to OR: Deterministic Models 1 Dynamic Programming Following is a summary of the problems we discussed in class. (We do not include the discussion on the container problem or the
More informationNASDAQ Futures (NFX) Combination & Implied Orders Technical Reference Document. Version
NASDAQ Futures (NFX) Combination & Implied Orders Technical Reference Document Version 1.01 2017-7-10 CONFIDENTIALITY/DISCLAIMER This Combination and Implied Orders Techinical Reference Guide is being
More informationEE365: Markov Decision Processes
EE365: Markov Decision Processes Markov decision processes Markov decision problem Examples 1 Markov decision processes 2 Markov decision processes add input (or action or control) to Markov chain with
More informationa 13 Notes on Hidden Markov Models Michael I. Jordan University of California at Berkeley Hidden Markov Models The model
Notes on Hidden Markov Models Michael I. Jordan University of California at Berkeley Hidden Markov Models This is a lightly edited version of a chapter in a book being written by Jordan. Since this is
More informationGLOSSARY OF OPTION TERMS
ALL OR NONE (AON) ORDER An order in which the quantity must be completely filled or it will be canceled. AMERICAN-STYLE OPTION A call or put option contract that can be exercised at any time before the
More informationRISK MITIGATION IN FAST TRACKING PROJECTS
Voorbeeld paper CCE certificering RISK MITIGATION IN FAST TRACKING PROJECTS Author ID # 4396 June 2002 G:\DACE\certificering\AACEI\presentation 2003 page 1 of 17 Table of Contents Abstract...3 Introduction...4
More informationSCHEDULE CREATION AND ANALYSIS. 1 Powered by POeT Solvers Limited
SCHEDULE CREATION AND ANALYSIS 1 www.pmtutor.org Powered by POeT Solvers Limited While building the project schedule, we need to consider all risk factors, assumptions and constraints imposed on the project
More informationHandout 4: Deterministic Systems and the Shortest Path Problem
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 4: Deterministic Systems and the Shortest Path Problem Instructor: Shiqian Ma January 27, 2014 Suggested Reading: Bertsekas
More informationPrice, Income and Cross Elasticity
Price, Income and Cross the concept The responsiveness of one variable to changes in another When price rises, what happens to demand? Demand falls BUT! How much does demand fall? the concept If price
More information3.1 Measures of Central Tendency
3.1 Measures of Central Tendency n Summation Notation x i or x Sum observation on the variable that appears to the right of the summation symbol. Example 1 Suppose the variable x i is used to represent
More informationPrinciples of Program Analysis: Algorithms
Principles of Program Analysis: Algorithms Transparencies based on Chapter 6 of the book: Flemming Nielson, Hanne Riis Nielson and Chris Hankin: Principles of Program Analysis. Springer Verlag 2005. c
More informationQUADRATIC. Parent Graph: How to Tell it's a Quadratic: Helpful Hints for Calculator Usage: Domain of Parent Graph:, Range of Parent Graph: 0,
Parent Graph: How to Tell it's a Quadratic: If the equation's largest exponent is 2 If the graph is a parabola ("U"-Shaped) Opening up or down. QUADRATIC f x = x 2 Domain of Parent Graph:, Range of Parent
More informationLINES AND SLOPES. Required concepts for the courses : Micro economic analysis, Managerial economy.
LINES AND SLOPES Summary 1. Elements of a line equation... 1 2. How to obtain a straight line equation... 2 3. Microeconomic applications... 3 3.1. Demand curve... 3 3.2. Elasticity problems... 7 4. Exercises...
More informationMethodology. Our team of analysts uses technical and chartist analysis to draw an opinion and make decisions. The preferred chartist elements are:
Methodology Technical analysis is at the heart of TRADING CENTRAL's expertise. Our methodology is proven. Our chartist and quantitative approach allows us to intervene on different investment horizons.
More informationThe Management of Park Equipment and Machinery Used in the Construction Industry and Housing Sector
The Management of Park Equipment and Machinery Used in the Construction Industry and Housing Sector Rustam Khayrullin 1,*, Pavel Marichev² ¹Doctor of Physics and Mathematics, Professor, Moscow State University
More informationPolynomials * OpenStax
OpenStax-CNX module: m51246 1 Polynomials * OpenStax This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 4.0 In this section students will: Abstract Identify
More informationPrice Elasticity of Demand
4 ELASTICITY The price elasticity of demand is a units-free measure of the responsiveness of the quantity demanded of a good to a change in its price when all other influences on buying plans remain the
More informationA study on the significance of game theory in mergers & acquisitions pricing
2016; 2(6): 47-53 ISSN Print: 2394-7500 ISSN Online: 2394-5869 Impact Factor: 5.2 IJAR 2016; 2(6): 47-53 www.allresearchjournal.com Received: 11-04-2016 Accepted: 12-05-2016 Yonus Ahmad Dar PhD Scholar
More informationAttachment B: Examples. Auction Notice California Cap-and-Trade Program and Québec Cap-and-Trade System Joint Auction of Greenhouse Gas Allowances
Attachment B: Examples Auction Notice California Cap-and-Trade Program and Québec Cap-and-Trade System Joint Auction of Greenhouse Gas Allowances This attachment provides information and examples of how
More informationIssues. Senate (Total = 100) Senate Group 1 Y Y N N Y 32 Senate Group 2 Y Y D N D 16 Senate Group 3 N N Y Y Y 30 Senate Group 4 D Y N D Y 22
1. Every year, the United States Congress must approve a budget for the country. In order to be approved, the budget must get a majority of the votes in the Senate, a majority of votes in the House, and
More informationDEMAND FOR MONEY. Ch. 9 (Ch.19 in the text) ECON248: Money and Banking Ch.9 Dr. Mohammed Alwosabi
Ch. 9 (Ch.19 in the text) DEMAND FOR MONEY Individuals allocate their wealth between different kinds of assets such as a building, income earning securities, a checking account, and cash. Money is what
More informationChapter 3. Numerical Descriptive Measures. Copyright 2016 Pearson Education, Ltd. Chapter 3, Slide 1
Chapter 3 Numerical Descriptive Measures Copyright 2016 Pearson Education, Ltd. Chapter 3, Slide 1 Objectives In this chapter, you learn to: Describe the properties of central tendency, variation, and
More informationFamily Vacation. c 1 = c n = 0. w: maximum number of miles the family may drive each day.
II-0 Family Vacation Set of cities denoted by P 1, P 2,..., P n. d i : Distance from P i 1 to P i (1 < i n). d 1 = 0 c i : Cost of dinner, lodging and breakfast when staying at city P i (1 < i < n). c
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 21 Successive Shortest Path Problem In this lecture, we continue our discussion
More informationx is a random variable which is a numerical description of the outcome of an experiment.
Chapter 5 Discrete Probability Distributions Random Variables is a random variable which is a numerical description of the outcome of an eperiment. Discrete: If the possible values change by steps or jumps.
More informationVivid Reports 2.0 Budget User Guide
B R I S C O E S O L U T I O N S Vivid Reports 2.0 Budget User Guide Briscoe Solutions Inc PO BOX 2003 Station Main Winnipeg, MB R3C 3R3 Phone 204.975.9409 Toll Free 1.866.484.8778 Copyright 2009-2014 Briscoe
More informationDecision Support Tool for Project Time-Cost Trade-off
Decision Support Tool for Project Time-Cost Trade-off Fikri Dweiri Industrial Engineering and Engineering Management Department University of Sharjah Sharjah, UAE, 27272 fdweiri@sharjah.ac.ae Abstract
More informationIntermediate Microeconomics (UTS 23567) * Preliminary and incomplete Available at
Proposed solutions for tutorial 5 Intermediate Microeconomics (UTS 23567) * Preliminary and incomplete Available at https://backwardinduction.blog/tutoring/ Office hours on Mondays from 9 am till am in
More informationDoes Encourage Inward FDI Always Be a Dominant Strategy for Domestic Government? A Theoretical Analysis of Vertically Differentiated Industry
Lin, Journal of International and Global Economic Studies, 7(2), December 2014, 17-31 17 Does Encourage Inward FDI Always Be a Dominant Strategy for Domestic Government? A Theoretical Analysis of Vertically
More informationProject Management Chapter 13
Lecture 12 Project Management Chapter 13 Introduction n Managing large-scale, complicated projects effectively is a difficult problem and the stakes are high. n The first step in planning and scheduling
More informationPARELLIZATION OF DIJKSTRA S ALGORITHM: COMPARISON OF VARIOUS PRIORITY QUEUES
PARELLIZATION OF DIJKSTRA S ALGORITHM: COMPARISON OF VARIOUS PRIORITY QUEUES WIKTOR JAKUBIUK, KESHAV PURANMALKA 1. Introduction Dijkstra s algorithm solves the single-sourced shorest path problem on a
More informationWeek 19 Algebra 2 Assignment:
Week 9 Algebra Assignment: Day : pp. 66-67 #- odd, omit #, 7 Day : pp. 66-67 #- even, omit #8 Day : pp. 7-7 #- odd Day 4: pp. 7-7 #-4 even Day : pp. 77-79 #- odd, 7 Notes on Assignment: Pages 66-67: General
More informationTHE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE
THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE GÜNTER ROTE Abstract. A salesperson wants to visit each of n objects that move on a line at given constant speeds in the shortest possible time,
More informationContinuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization
1 of 6 Continuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization 1. Which of the following is NOT an element of an optimization formulation? a. Objective function
More informationthe display, exploration and transformation of the data are demonstrated and biases typically encountered are highlighted.
1 Insurance data Generalized linear modeling is a methodology for modeling relationships between variables. It generalizes the classical normal linear model, by relaxing some of its restrictive assumptions,
More informationEC102: Market Institutions and Efficiency. A Double Auction Experiment. Double Auction: Experiment. Matthew Levy & Francesco Nava MT 2017
EC102: Market Institutions and Efficiency Double Auction: Experiment Matthew Levy & Francesco Nava London School of Economics MT 2017 Fig 1 Fig 1 Full LSE logo in colour The full LSE logo should be used
More information4. Introduction to Prescriptive Analytics. BIA 674 Supply Chain Analytics
4. Introduction to Prescriptive Analytics BIA 674 Supply Chain Analytics Why is Decision Making difficult? The biggest sources of difficulty for decision making: Uncertainty Complexity of Environment or
More informationUSD CRUDE PALM OIL FUTURES (FUPO)
CONTENT Contract Specifications 1 Frequently Asked Questions 2-7 Appendix 1: 8 FUPO Funds Payment/Receipt for Residents DISCLAIMER These FAQs have been provided by Bursa Malaysia Derivatives Berhad ( Bursa
More informationExcel & Business Math Video/Class Project #37 Trade Discounts, Series Discounts, Net Cost Equivalents & Wholesale Cost
Topics Excel & Business Math Video/Class Project #37 Trade Discounts, Series Discounts, Net Cost Equivalents & Wholesale Cost 1) Retail & Wholesale Businesses. List Price and Wholesale Cost.... 2 2) Trade
More informationSAS Data Mining & Neural Network as powerful and efficient tools for customer oriented pricing and target marketing in deregulated insurance markets
SAS Data Mining & Neural Network as powerful and efficient tools for customer oriented pricing and target marketing in deregulated insurance markets Stefan Lecher, Actuary Personal Lines, Zurich Switzerland
More informationChapter DIFFERENTIAL EQUATIONS: PHASE SPACE, NUMERICAL SOLUTIONS
Chapter 10 10. DIFFERENTIAL EQUATIONS: PHASE SPACE, NUMERICAL SOLUTIONS Abstract Solving differential equations analytically is not always the easiest strategy or even possible. In these cases one may
More informationCV and EV. Measuring Welfare Effects of an Economic Change. ECON 483 ST in Environmental Economics
CV and EV Measuring Welfare Effects of an Economic Change ECON 483 ST in Environmental Economics Kevin Wainwright Welfare and Economic Change Welfare is, in simple terms, the level of well-being of a group.
More informationnot to be republished NCERT Chapter 2 Consumer Behaviour 2.1 THE CONSUMER S BUDGET
Chapter 2 Theory y of Consumer Behaviour In this chapter, we will study the behaviour of an individual consumer in a market for final goods. The consumer has to decide on how much of each of the different
More informationA block chain based decentralized exchange
A block chain based decentralized exchange Harsh Patel Harsh.patel54@gmail.com Abstract. A pure peer to peer version of the exchange system would allow all parties access to the market without relying
More informationDetermining Exchange Rates. Determining Exchange Rates
Determining Exchange Rates Determining Exchange Rates Chapter Objectives To explain how exchange rate movements are measured; To explain how the equilibrium exchange rate is determined; and To examine
More informationCrashing the Schedule An Algorithmic Approach with Caveats and Comments
ing the Schedule An Algorithmic Approach with Caveats and Comments Gilbert C. Brunnhoeffer, III PhD, P.E. and B. Gokhan Celik PhD LEED AP Roger Williams University Bristol, Rhode Island and Providence
More informationQUICK START. Your Guide to Using Telemet Orion
QUICK START Your Guide to Using Telemet Orion 1 Your Telemet investment platform is organized into Workspaces and component displays. Component displays are individual windows with market data, charts,
More informationIntroduction to Bond Markets
Wisconsin School of Business December 10, 2014 Bonds A bond is a financial security that promises to pay a fixed (known) income stream in the future Issued by governments, state agencies (municipal bonds),
More informationCS221 / Spring 2018 / Sadigh. Lecture 7: MDPs I
CS221 / Spring 2018 / Sadigh Lecture 7: MDPs I cs221.stanford.edu/q Question How would you get to Mountain View on Friday night in the least amount of time? bike drive Caltrain Uber/Lyft fly CS221 / Spring
More informationLecture 7: MDPs I. Question. Course plan. So far: search problems. Uncertainty in the real world
Lecture 7: MDPs I cs221.stanford.edu/q Question How would you get to Mountain View on Friday night in the least amount of time? bike drive Caltrain Uber/Lyft fly CS221 / Spring 2018 / Sadigh CS221 / Spring
More informationChapter 15: Dynamic Programming
Chapter 15: Dynamic Programming Dynamic programming is a general approach to making a sequence of interrelated decisions in an optimum way. While we can describe the general characteristics, the details
More informationTo earn the extra credit, one of the following has to hold true. Please circle and sign.
CS 188 Fall 2018 Introduction to Artificial Intelligence Practice Midterm 1 To earn the extra credit, one of the following has to hold true. Please circle and sign. A I spent 2 or more hours on the practice
More informationIPO VITAL SIGNS. Participant Training Guide
IPO VITAL SIGNS http://ipovitalsigns.com February, 2008 Table of Contents Introduction...2 Course Objectives...2 IPO Vital Signs Login...3 Search IPO Vital Signs...4 Using the IPO Process for Law Firms
More informationA Priority System for Allocating an O&M Budget
A Priority System for Allocating an O&M Budget Elsie Myers Martin Lee Merkhofer Lee Merkhofer Consulting This paper describes a priority system developed for Northern States Power to allocate its annual
More informationBubbles in a minority game setting with real financial data.
Bubbles in a minority game setting with real financial data. Frédéric D.R. Bonnet a,b, Andrew Allison a,b and Derek Abbott a,b a Department of Electrical and Electronic Engineering, The University of Adelaide,
More informationDocument A101 TM. Standard Form of Agreement Between Owner and Contractor where the basis of payment is a Stipulated Sum
Document A101 TM 2007 Standard Form of Agreement Between Owner and Contractor where the basis of payment is a Stipulated Sum AGREEMENT made as of the day of in the year (In words, indicate day, month and
More information56:171 Operations Research Midterm Examination Solutions PART ONE
56:171 Operations Research Midterm Examination Solutions Fall 1997 Answer both questions of Part One, and 4 (out of 5) problems from Part Two. Possible Part One: 1. True/False 15 2. Sensitivity analysis
More informationDegree of Operating Leverage (DOL) EBIT Percentage change in EBIT EBIT DOL. Percentage change in sales Q
Chapter 16 Web Extension: Degree of Leverage I n our discussion of operating leverage in Chapter 16, we made no mention of financial leverage, and when we discussed financial leverage, operating leverage
More informationTheory of Consumer Behavior First, we need to define the agents' goals and limitations (if any) in their ability to achieve those goals.
Theory of Consumer Behavior First, we need to define the agents' goals and limitations (if any) in their ability to achieve those goals. We will deal with a particular set of assumptions, but we can modify
More informationCS360 Homework 14 Solution
CS360 Homework 14 Solution Markov Decision Processes 1) Invent a simple Markov decision process (MDP) with the following properties: a) it has a goal state, b) its immediate action costs are all positive,
More informationDUALITY AND SENSITIVITY ANALYSIS
DUALITY AND SENSITIVITY ANALYSIS Understanding Duality No learning of Linear Programming is complete unless we learn the concept of Duality in linear programming. It is impossible to separate the linear
More informationRegional Flow-based allocations. State-of-play
Page 1 of 15 Regional Flow-based allocations State-of-play March 2007 ETSO Final paper Page 2 of 15 Contents 1. Introduction... 3 2. Flow-based allocations... 3 3. Status of flow-based allocations... 6
More informationRecall: Data Flow Analysis. Data Flow Analysis Recall: Data Flow Equations. Forward Data Flow, Again
Data Flow Analysis 15-745 3/24/09 Recall: Data Flow Analysis A framework for proving facts about program Reasons about lots of little facts Little or no interaction between facts Works best on properties
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense May 22, 2018 Marco Chiarandini DM559/DM55 Linear and integer programming Sheet, Spring 2018 [pdf format] Contains Solutions!
More informationEconomics 102 Discussion Handout Week 14 Spring Aggregate Supply and Demand: Summary
Economics 102 Discussion Handout Week 14 Spring 2018 Aggregate Supply and Demand: Summary The Aggregate Demand Curve The aggregate demand curve (AD) shows the relationship between the aggregate price level
More information