DOCSLIB.ORG

Optimal Time-Varying Cash Allocation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

DEGREE PROJECT IN MATHEMATICS, SECOND CYCLE, 30 CREDITS STOCKHOLM, SWEDEN 2020 Optimal Time-Varying Cash Allocation DAVID OLANDERS KTH ROYAL INSTITUTE OF TECHNOLOGY SCHOOL OF ENGINEERING SCIENCES Optimal Time-Varying Cash Allocation DAVID OLANDERS Degree Projects in Scientific Computing (30 ECTS credits) Master’s Programme in Applied and Computational Mathematics (120 credits) KTH Royal Institute of Technology year 2020 Supervisor at Trustly Group AB: Ludvig Vikström Supervisor at KTH: Sigrid Källblad Nordin Examiner at KTH: Sigrid Källblad Nordin TRITA-SCI-GRU 2020:087 MAT-E 2020:050 Royal Institute of Technology School of Engineering Sciences KTH SCI SE-100 44 Stockholm, Sweden URL: www.kth.se/sci iii Abstract A payment is the most fundamental aspect of a trade that involves funds. In recent years, the development of new payment services has accelerated signif- icantly as the world has moved further into the digital era. This transition has led to an increased demand of digital payment solutions that can handle trades across the world. As trades today can be agreed at any time wherever the payer and payee are located, the party that mediates payments must at any time to be available in order to mediate an agreed exchange. This requires the pay- ment service provider to always have funds available in the required countries and currencies in order for trades to always be available. This thesis concerns how a payment service provider can reallocate capital in a cost efficient way in order for trades to always be available. Traditionally, the reallocation of capital is done in a rule-based manner, which discard the cost dimension and thereby only focus on the reallocation itself. This thesis concerns methods to optimally reallocate capital focusing on the cost of transferring capital within the network. Where the concerned methods has the potential of transferring capital in a far more cost efficient way. When mathematically formulating the reallocation decisions as an opti- mization problem, the cost function is formulated as a linear program with both Boolean and real constraints. This impose non-feasibility of locating the optimal solution using traditional methods for linear programs, why developed traditional and more advanced methods were used. The model was evaluated based on a large number of simulations in comparison with the performance of a rule-based reallocation system. The developed model provides a significant cost reduction compared to the rule-based approach and thereby outperforms the traditional reallocation system. Future work should focus on expanding the model by broadening the available transfer options, by increasing the considered uncertainty via a bayesian treatment and finally by considering all cost aspects of the network. iv Sammanfattning En betalning är den mest fundamentala aspekten av handel som involverar ka- pital. De senaste åren har utvecklingen av nya betalmedel ökat drastiskt då världen fortsatt att utvecklas genom digitaliseringen. Utvecklingen har lett till en ökad efterfrågan på digitala betalningslösningar som kan hantera handel över hela världen. Då handel idag kan ske när som helst oberoende av var be- talaren och betalningsmottagaren befinner sig, måste systemet som genomför betalningen alltid vara tillgängligt för att kunna förmedla handel mellan olika parter. Detta kräver att betalningssystemet alltid måste ha medel tillgängligt i efterfrågade länder och valutor för att handeln ska kunna genomföras. Den här uppsatsen fokuserar på hur kapital kostnadseffektivt kan omallokeras i ett betalsystem för att säkerställa att handel alltid är tillgängligt. Traditionellt har omallokeringen av kapital gjorts på ett regelbaserat sätt, vilket inte tagit hänsyn till kostnadsdimensionen och därigenom enbart foku- serat på själva omallokeringen. Den här uppsatsen använder metoder för att optimalt omallokera kapital baserat på kostnaderna för omallokeringen. Däri- genom skapas en möjlighet att flytta kapital på ett avsevärt mer kostnadseffek- tivt sätt. När omallokeringsbesluten formuleras matematiskt som ett optimerings- problem är kostnadsfunktionen formulerad som ett linjärt program med både Booleska och reella begränsningar av variablerna. Detta gör att traditionella lösningsmetoder för linjära program inte är användningsbara för att finna den optimala lösningen, varför vidareutveckling av tradtionella metoder tillsam- mans med mer avancerade metoder använts. Modellen utvärderades baserat på ett stort antal simuleringar som jämförde dess prestanda med det regelba- serade systemet. Den utvecklade modellen presterar en signfikant kostnadsreduktion i jäm- förelse med det regelbaserade systemet och överträffar därigenom det traditio- nellt använda systemet. Framtida arbete bör fokusera på att expandera model- len genom att utöka de potentiella överföringsmöjligheterna, att ta ökad hän- syn till osäkerhet genom en bayesiansk hantering, samt slutligen att integrera samtliga kostnadsaspekter i nätverket. v Acknowledgement This thesis is the final part of my Master’s degree in Applied and Computa- tional Mathematics at KTH Royal Institute of Technology in Stockholm, Swe- den. My work was carried out at Trustly Group AB who welcomed me with open arms and enthusiastic support. Here, I wish to express my profound grat- itude to all who contributed in creating this opportunity for me to finish my Master’s degree, but also to all who supported me throughout my work with this thesis. First of all, I would like to thank my supervisor at Trustly Group AB, Ludvig Vikström, who throughout my work supported me with both valuable theoret- ical knowledge and technical experience. Ludvig has always been available whenever I have asked for guidance, and his background as a Data Scientist with deep mathematical knowledge helped me through the challenge of ap- proaching an optimization problem as a Master’s student from the statistical branch. I am very thankful to Trustly Group AB who gave me the opportunity to deepen my optimization skill set while simultaneously integrating me into the organi- zation. I have had the luxury of closely witnessing very competent people in action inside a rapidly evolving company, which have made me develop and learn skills valuable in my future career. Thanks to my academical supervisor Sigrid Källblad Nordin, who supported me and energized my work with enthusiastic compliments of my thesis’s prob- lem setting. Our discussions help me in finding the path to my proposed solu- tion. Lastly, thanks to my family for unconditional support, encouragement and love. Completing my Engineering’s degree and especially my Master’s de- gree would never have been possible without your support and help. Stockholm, May 2020 David Olanders Contents 1 Introduction 1 2 Payment Services 4 2.1 Transfer Network . .4 2.2 Network Management . .5 2.3 Network Costs . .5 2.4 Network Delimitations . .7 2.5 Cash Allocation . .8 3 Mathematical Background 9 3.1 Constrained Optimization . .9 3.1.1 Convex and Non-Convex Optimization . 10 3.1.2 Linear Programming . 11 3.1.3 Integer Linear Programming . 11 3.1.4 Mixed Integer Linear Programming . 12 3.1.5 Relaxation of a Mixed Integer Linear Program . 13 3.1.6 Duality . 13 3.1.7 Big-M Method . 14 3.2 Bayesian Inference . 15 3.2.1 Bayesian Decision Theory . 17 3.3 Graph Notation . 17 4 Data 19 4.1 Available Data . 19 4.1.1 Initial Exploration . 21 4.1.2 Missing Data Handling, Simplifications and Final Mod- elling Data . 22 vi CONTENTS vii 5 Methods 23 5.1 Mathematical Formulation of the Transfer Networks Optimiza- tion Problem . 23 5.1.1 Reduced Optimization Formulation . 24 5.2 Algorithms . 25 5.2.1 The Simplex Method . 25 5.2.2 The Dual Simplex Algorithm . 26 5.2.3 Branch-and-Bound for ILP and MILP . 27 5.2.4 Branch-and-Cut . 33 5.3 Probability Distribution Fitting of Available Data . 33 5.4 Simulation Driven Approach of Calculating the Expected cost 34 5.4.1 Considering Uncertainty . 34 6 Results and Discussion 36 6.1 Initial Capital Allocation . 36 6.2 Network Case One - Without Internal Transfers . 37 6.3 Network Case Two - Rule-Based Transfers . 39 6.4 Network Case Three - Optimized Reallocation . 40 6.5 Discussion . 42 7 Conclusions and Future Work 45 Bibliography 47 A Flow chart of the Simplex method 50 B Flow chart of the Branch-and-Bound algorithm 52 List of Figures 3.1 An example of a visual representation of a network with ver- tices v and edges e, collected from [19]. 18 4.1 Sample from the data file containing the bank accounts. 19 4.2 Sample from cost file containing transaction costs. 20 4.3 A sample from the transaction file containing the Pay-ins and Pay-outs. 20 4.4 A sample from the pre-processed transaction data. 21 5.1 The feasible region L0 of an example ILP, collected from [20]. 28 5.2 The enumeration tree after the first branching, collected from [20]. 29 5.3 The first subdivision of the feasible region, collected from [20]. 29 5.4 The enumeration tree after the second branching, collected from [20]. 30 5.5 The final subdivision of the feasible region, collected from [20]. 31 5.6 The final enumeration tree, collected from [20]. 32 6.1 Median with 90% confidence interval of 1000 random sam- ples of daily flows with replacement for summation of nega- tive balance over the entire network . 38 6.2 Relation between the Starting Balance multiple and how reli- able the Transfer network is in terms of Pay-outs. 38 A.1 The Simplex method, collected from [21] . 51 B.1 The Branch-and-Bound algorithm for a maximization ILP prob- lem, collected from [20]. 53 viii LIST OF FIGURES ix List of Abbreviations Table 1: Reference table for the abbreviations used throughout the thesis Abbreviation Acronym Definition FinTech Financial Technology LP Linear Programming ILP Integer Linear Programming MILP Mixed Integer Linear Programming EUR Euro MEUR Million Euro Cur Currency List of Tables 1 Reference table for the abbreviations used throughout the thesis ix 4.1 Summarized data information .
Recommended publications
  • Matroidal Subdivisions, Dressians and Tropical Grassmannians

    Matroidal Subdivisions, Dressians and Tropical Grassmannians

    Matroidal subdivisions, Dressians and tropical Grassmannians vorgelegt von Diplom-Mathematiker Benjamin Frederik Schröter geboren in Frankfurt am Main Von der Fakultät II – Mathematik und Naturwissenschaften der Technischen Universität Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften – Dr. rer. nat. – genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. Wilhelm Stannat Gutachter: Prof. Dr. Michael Joswig Prof. Dr. Hannah Markwig Senior Lecturer Ph.D. Alex Fink Tag der wissenschaftlichen Aussprache: 17. November 2017 Berlin 2018 Zusammenfassung In dieser Arbeit untersuchen wir verschiedene Aspekte von tropischen linearen Räumen und deren Modulräumen, den tropischen Grassmannschen und Dressschen. Tropische lineare Räume sind dual zu Matroidunterteilungen. Motiviert durch das Konzept der Splits, dem einfachsten Fall einer polytopalen Unterteilung, wird eine neue Klasse von Matroiden eingeführt, die mit Techniken der polyedrischen Geometrie untersucht werden kann. Diese Klasse ist sehr groß, da sie alle Paving-Matroide und weitere Matroide enthält. Die strukturellen Eigenschaften von Split-Matroiden können genutzt werden, um neue Ergebnisse in der tropischen Geometrie zu erzielen. Vor allem verwenden wir diese, um Strahlen der tropischen Grassmannschen zu konstruieren und die Dimension der Dressschen zu bestimmen. Dazu wird die Beziehung zwischen der Realisierbarkeit von Matroiden und der von tropischen linearen Räumen weiter entwickelt. Die Strahlen einer Dressschen entsprechen den Facetten des Sekundärpolytops eines Hypersimplexes. Eine besondere Klasse von Facetten bildet die Verallgemeinerung von Splits, die wir Multi-Splits nennen und die Herrmann ursprünglich als k-Splits bezeichnet hat. Wir geben eine explizite kombinatorische Beschreibung aller Multi-Splits eines Hypersimplexes. Diese korrespondieren mit Nested-Matroiden. Über die tropische Stiefelabbildung erhalten wir eine Beschreibung aller Multi-Splits für Produkte von Simplexen.
  • A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems

    A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems

    ' : .v ' : V. • ' '^!V'> r" '%': ' W ' ::r'' NISTIR 4900 Computing and Applied Mathematics Laboratory A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems P.T. Boggs, J.W. Tolle, A.J. Kearsley August 1992 Technology Administration U.S. DEPARTMENT OF COMMERCE National Institute of Standards and Technology Gaithersburg, MD 20899 “QC— 100 .U56 4900 1992 Jc. NISTIR 4900 A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems P. T. Boggs J. W. Tone A. J. Kearsley U.S. DEPARTMENT OF COMMERCE Technology Administration National Institute of Standards and Technology Computing and Applied Mathematics Laboratory Applied and Computational Mathematics Division Gaithersburg, MD 20899 August 1992 U.S. DEPARTMENT OF COMMERCE Barbara Hackman Franklin, Secretary TECHNOLOGY ADMINISTRATION Robert M. White, Under Secretary for Technology NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY John W. Lyons, Director si.- MT-- ’•,•• /'k /-.<• -Vj* #' ^ ( "> M !f>' J ' • ''f,i sgsHv.w,^. ^ , .!n'><^.'". tr 'V 10 i^ailCin'i.-'J/ > ' it i>1l • •»' W " %'. ' ' -fft ?" . , - '>! .-' .S A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems * Paul T. Boggs ^ Jon W. ToUe ^ Anthony J. Kearsley § August 4, 1992 Abstract We consider the inequality constrained nonlinear programming problem and an SQP algorithm for its solution. We are primarily concerned with two aspects of the general procedure, namely, the approximate solution of the quadratic program, and the need for an appropriate merit function. We first describe an (iterative) interior-point method for the quadratic programming subproblem that, no matter when it its terminated, yields a descent direction for a suggested new merit function. An algorithm based on ideas from trust-region and truncated Newton methods, is suggested and some of our preliminary numerical results are discussed.
  • A Bound Strengthening Method for Optimal Transmission Switching in Power Systems

    A Bound Strengthening Method for Optimal Transmission Switching in Power Systems

    1 A Bound Strengthening Method for Optimal Transmission Switching in Power Systems Salar Fattahi∗, Javad Lavaei∗;+, and Alper Atamturk¨ ∗ ∗ Industrial Engineering and Operations Research, University of California, Berkeley + Tsinghua-Berkeley Shenzhen Institute, University of California, Berkeley. Abstract—This paper studies the optimal transmission switch- transmission switches) in the system. Furthermore, The Energy ing (OTS) problem for power systems, where certain lines are Policy Act of 2005 explicitly addresses the “difficulties of fixed (uncontrollable) and the remaining ones are controllable siting major new transmission facilities” and calls for the via on/off switches. The goal is to identify a topology of the power grid that minimizes the cost of the system operation while utilization of better transmission technologies [2]. satisfying the physical and operational constraints. Most of the Unlike in the classical network flows, removing a line from existing methods for the problem are based on first converting a power network may improve the efficiency of the network the OTS into a mixed-integer linear program (MILP) or mixed- due to physical laws. This phenomenon has been observed integer quadratic program (MIQP), and then iteratively solving and harnessed to improve the power system performance by a series of its convex relaxations. The performance of these methods depends heavily on the strength of the MILP or MIQP many authors. The notion of optimally switching the lines of formulations. In this paper, it is shown that finding the strongest a transmission network was introduced by O’Neill et al. [3]. variable upper and lower bounds to be used in an MILP or Later on, it has been shown in a series of papers that the MIQP formulation of the OTS based on the big-M or McCormick incorporation of controllable transmission switches in a grid inequalities is NP-hard.
  • A Scenario-Based Branch-And-Bound Approach for MES Scheduling in Urban Buildings Mainak Dan, Student Member, Seshadhri Srinivasan, Sr

    A Scenario-Based Branch-And-Bound Approach for MES Scheduling in Urban Buildings Mainak Dan, Student Member, Seshadhri Srinivasan, Sr

    1 A Scenario-based Branch-and-Bound Approach for MES Scheduling in Urban Buildings Mainak Dan, Student Member, Seshadhri Srinivasan, Sr. Member, Suresh Sundaram, Sr. Member, Arvind Easwaran, Sr. Member and Luigi Glielmo, Sr. Member Abstract—This paper presents a novel solution technique for Storage Units scheduling multi-energy system (MES) in a commercial urban PESS Power input to the electrical storage [kW]; building to perform price-based demand response and reduce SoCESS State of charge of the electrical storage [kW h]; energy costs. The MES scheduling problem is formulated as a δ mixed integer nonlinear program (MINLP), a non-convex NP- ESS charging/discharging status of the electrical stor- hard problem with uncertainties due to renewable generation age; and demand. A model predictive control approach is used PTES Cooling energy input to the thermal storage [kW]; to handle the uncertainties and price variations. This in-turn SoCTES State of charge of the thermal storage [kW h]; requires solving a time-coupled multi-time step MINLP dur- δTES charging/discharging status of the thermal storage; ing each time-epoch which is computationally intensive. This T ◦C investigation proposes an approach called the Scenario-Based TES Temperature inside the TES [ ]; Branch-and-Bound (SB3), a light-weight solver to reduce the Chiller Bank computational complexity. It combines the simplicity of convex −1 programs with the ability of meta-heuristic techniques to handle m_ C;j Cool water mass-flow rate of chiller j [kg h ]; complex nonlinear problems. The performance of the SB3 solver γC;j Binary ON-OFF status of chiller j; is validated in the Cleantech building, Singapore and the results PC Power consumed in the chiller bank [kW]; demonstrate that the proposed algorithm reduces energy cost by QC;j Thermal energy supplied by chiller j [kW]; about 17.26% and 22.46% as against solving a multi-time step heuristic optimization model.
  • The Big-M Method with the Numerical Infinite M

    The Big-M Method with the Numerical Infinite M

    Optimization Letters https://doi.org/10.1007/s11590-020-01644-6 ORIGINAL PAPER The Big-M method with the numerical infinite M Marco Cococcioni1 · Lorenzo Fiaschi1 Received: 30 March 2020 / Accepted: 8 September 2020 © The Author(s) 2020 Abstract Linear programming is a very well known and deeply applied field of optimization theory. One of its most famous and used algorithms is the so called Simplex algorithm, independently proposed by Kantoroviˇc and Dantzig, between the end of the 30s and the end of the 40s. Even if extremely powerful, the Simplex algorithm suffers of one initialization issue: its starting point must be a feasible basic solution of the problem to solve. To overcome it, two approaches may be used: the two-phases method and the Big-M method, both presenting positive and negative aspects. In this work we aim to propose a non-Archimedean and non-parametric variant of the Big-M method, able to overcome the drawbacks of its classical counterpart (mainly, the difficulty in setting the right value for the constant M). We realized such extension by means of the novel computational methodology proposed by Sergeyev, known as Grossone Methodol- ogy. We have validated the new algorithm by testing it on three linear programming problems. Keywords Big-M method · Grossone methodology · Infinity computer · Linear programming · Non-Archimedean numerical computing 1 Introduction Linear Programming (LP) is a branch of optimization theory which studies the min- imization (or maximization) of a linear objective function, subject to linear equality and/or linear inequality constraints. LP has found a lot of successful applications both in theoretical and real world contexts, especially in countless engineering applications.
  • Two Dimensional Search Algorithms for Linear Programming

    Two Dimensional Search Algorithms for Linear Programming

    University of Nebraska at Omaha DigitalCommons@UNO Mathematics Faculty Publications Department of Mathematics 8-2019 Two dimensional search algorithms for linear programming Fabio Torres Vitor Follow this and additional works at: https://digitalcommons.unomaha.edu/mathfacpub Part of the Mathematics Commons Two dimensional search algorithms for linear programming by Fabio Torres Vitor B.S., Maua Institute of Technology, Brazil, 2013 M.S., Kansas State University, 2015 AN ABSTRACT OF A DISSERTATION submitted in partial fulfillment of the requirements for the degree DOCTOR OF PHILOSOPHY Department of Industrial and Manufacturing Systems Engineering Carl R. Ice College of Engineering KANSAS STATE UNIVERSITY Manhattan, Kansas 2019 Abstract Linear programming is one of the most important classes of optimization problems. These mathematical models have been used by academics and practitioners to solve numerous real world applications. Quickly solving linear programs impacts decision makers from both the public and private sectors. Substantial research has been performed to solve this class of problems faster, and the vast majority of the solution techniques can be categorized as one dimensional search algorithms. That is, these methods successively move from one solution to another solution by solving a one dimensional subspace linear program at each iteration. This dissertation proposes novel algorithms that move between solutions by repeatedly solving a two dimensional subspace linear program. Computational experiments demonstrate the potential of these newly developed algorithms and show an average improvement of nearly 25% in solution time when compared to the corresponding one dimensional search version. This dissertation's research creates the core concept of these two dimensional search algorithms, which is a fast technique to determine an optimal basis and an optimal solution to linear programs with only two variables.
  • G. Gutin, Computational Optimisation, Royal Holloway 2008

    G. Gutin, Computational Optimisation, Royal Holloway 2008

    Computational Optimisation Gregory Gutin April 4, 2008 Contents 1 Introduction to Computational Optimisation 1 1.1 Introduction.................................... 1 1.2 Algorithm efficiency and problem complexity . ...... 3 1.3 Optimality and practicality . .... 4 2 Introduction to Linear Programming 6 2.1 Linearprogramming(LP)model . 6 2.2 FormulatingproblemsasLPproblems . .... 6 2.3 GraphicalsolutionofLPproblems . .... 9 2.4 Questions ..................................... 13 3 Simplex Method 15 3.1 StandardForm .................................. 15 3.2 SolutionsofLinearSystems . 17 3.3 TheSimplexMethod............................... 18 3.4 Questions ..................................... 22 4 Linear Programming Approaches 25 4.1 Artificial variables and Big-M Method . ..... 25 4.2 Two-PhaseMethod................................ 26 4.3 Shadowprices................................... 28 4.4 Dualproblem................................... 29 4.5 DecompositionofLPproblems . 32 1 CONTENTS 2 4.6 LPsoftware.................................... 34 4.7 Questions ..................................... 34 5 Integer Programming Modeling 36 5.1 Integer Programming vs. Linear Programming . ...... 36 5.2 IPproblems.................................... 37 5.2.1 Travelling salesman problem . 37 5.2.2 KnapsackProblem ............................ 38 5.2.3 Binpackingproblem.. .. .. .. .. .. .. .. 38 5.2.4 Set partitioning/covering/packing problems . ........ 39 5.2.5 Assignment problem and generalized assignment problem ...... 40 5.3 Questions ....................................
  • A One-Phase Interior Point Method for Nonconvex Optimization

    A One-Phase Interior Point Method for Nonconvex Optimization

    Stanford University A one-phase interior point method for nonconvex optimization Oliver Hinder, Yinyu Ye January 12, 2018 Abstract The work of W¨achter and Biegler [40] suggests that infeasible-start interior point methods (IPMs) developed for linear programming cannot be adapted to nonlinear optimization without significant mod- ification, i.e., using a two-phase or penalty method. We propose an IPM that, by careful initialization and updates of the slack variables, is guaranteed to find a first-order certificate of local infeasibility, local optimality or unboundedness of the (shifted) feasible region. Our proposed algorithm differs from other IPM methods for nonconvex programming because we reduce primal feasibility at the same rate as the barrier parameter. This gives an algorithm with more robust convergence properties and closely resem- bles successful algorithms from linear programming. We implement the algorithm and compare with IPOPT on a subset of CUTEst problems. Our algorithm requires a similar median number of iterations, but fails on only 9% of the problems compared with 16% for IPOPT. Experiments on infeasible variants of the CUTEst problems indicate superior performance for detecting infeasibility. The code for our implementation can be found at https://github.com/ohinder/OnePhase. 1 Introduction Consider the problem min f(x) (1a) n x2R a(x) ≤ 0; (1b) where the functions a : Rn ! Rm and f : Rn ! R are twice differentiable and might be nonconvex. Examples of real-world problems in this framework include truss design, robot control, aircraft control, and aircraft design, e.g., the problems TRO11X3, ROBOT, AIRCRAFTA, AVION2 in the CUTEst test set [16].
  • Deterministic Optimization and Design Jay R

    Deterministic Optimization and Design Jay R

    Deterministic Optimization and Design Jay R. Lund UC Davis Fall 2017 Deterministic Optimization and Design Class Notes for Civil Engineering 153 Department of Civil and Environmental Engineering University of California, Davis Jay R. Lund February 2016 © 2017 Jay R. Lund "... engineers who can do only the best of what has already been done will be replaced by a computer system." Daniel C. Drucker Engineering Education, Vol. 81, No. 5, July/August 1991, p. 480. "Good management is the art of making problems so interesting and their solutions so constructive that everyone wants to get to work and deal with them." Paul Hawken Acknowledgments: These notes have improved steadily over the years from corrections and suggestions by numerous students, TAs, and substitute instructors. Particularly useful improvements have come from Ken Kirby, Orit Kalman, Min Yip, Stacy Tanaka, David Watkins, and Rui Hui, with many others contributing as well. 1 Deterministic Optimization and Design Jay R. Lund UC Davis Fall 2017 Table of Contents Some Thoughts on Optimization ................................................................................................ 3 Introduction/Overview ................................................................................................................ 5 Design of A Bridge Over A Gorge ............................................................................................. 7 Systems Analysis .....................................................................................................................
  • Affine-Scaling Method, 202–204, 206, 210 Poor Performance Of

    Affine-Scaling Method, 202–204, 206, 210 Poor Performance Of

    Index affine-scaling method, 202–204, 206, 210 blocking variable, 48 poor performance of, 203 breakpoint, 163 steplength choice, 203 approximation problems, 218–227 canonical form, 8, 16, 45, 117, 120, 123, 1-norm, 221–224 129, 130, 134, 138, 139, 150, 2-norm. See least-squares problems 151, 156, 195, 197 ∞-norm. See Chebyshev approximation dual of, 109 for linear equalities, 218–223 for problems with bound constraints, with hard constraints, 223–224, 227 130 arc, 12–14, 144 centering parameter, 206, 214 central path, 205 back substitution. See triangular substitution Chebyshev approximation, 219–221, 223 basic feasible solution, 118 Cholesky factorization, 209, 212 as iterates of revised simplex method, classification, 11–12, 230–235 123 labeled points, 230 association with basis matrix, 120–121 testing set, 235 association with vertex, 121–123 training set, 235 degenerate, 120 tuning set, 235 existence, 119–120 classifier, 230 initial, 129, 134–139 linear, 230 basic solution, 118 nonlinear, 233, 234 basis, 117, 126, 152 complementarity, 101–102, 178, 237 for problems with bound constraints, almost-, 178, 179 130 existence of strictly complementary initial, 125, 134–137 primal-dual solution, 114–115 optimal, 129, 152–156 strict, 101 basis matrix, 52, 118, 120, 123, 139, 140, complementary slackness. 154 See complementarity for network linear program, 149 concave function, 161, 244 LU factorization of, 139–142 constraints, 1 big M method, 110–112 active, 14 behavior on infeasible problems, 112 bounds, 74–75 motivation, 110–111 equality, 72–87 proof of effectiveness, 111 inactive, 14 specification, 111–112 inequality, 72–87 bimatrix game, 185 convex combination, 239, 241 Bland’s rule.
  • Linear Programming

    Linear Programming

    Chapter 1: Introduction to Operations Research The Modelling Process Mathematical decision-making model - Variables → decisions - Parameters → constants - Measure of performance - Constraints → restrictions Step 1: Formulation of the model and data collection - Defining the problem - Developing a model - Acquiring input data Step 2: Solution development and validation of the model - Developing a solution - Testing and validating the model Step 3: Interpretation and what-if analysis - Analyzing the results and sensitivity analysis - Implementing the results Chapter 2: Linear Programming Introduction to modelling - The Graphical Solution Method Introduction 1) Define the decision variables 2) Formulate the objective function → minimize or maximize 3) Formulate the functional constraints 4) Formulate the sign restrictions → xi ≥ 0 or xi urs Terminology - Feasible solution Solution that satisfies all the problem’s constraints. - Optimal solution Feasible solution that results in the largest possible objective function value when maximizing (or smallest when minimizing). Linear Programming Formulation Three categories of constraints: - Limited resources: “at most” - Minimum performance: “at least” - Conservation: “exactly” Assumptions and Limitations of LP - Certainty ➔ All parameters of the model are known constants. - Linearity ➔ The objective function and constraints are expressed as linear functions. 1 - Proportionality ➔ The contribution of each activity to the value of the objective function Z is proportional to the level of the activity xj(cj). ➔ The contribution of each activity to the left-hand side of each functional constraint is proportional to the level of the activity xj(aij). - Additivity ➔ Every function (in LP model) is the sum of the contributions of all individual decision variables. ➔ Can be violated due: complementary or competivity - Divisibility ➔ Decision variables can have non-integer or fractional values (<-> integer programming) The Graphical Solution Method For linear programs with two or three variables.
  • Optimal Signal Sets for Non-Gaussian Detectors

    Optimal Signal Sets for Non-Gaussian Detectors

    OPTIMAL SIGNAL SETS FOR NONGAUSSIAN DETECTORS y z MARK S GOCKENBACH AND ANTHONY J KEARSLEY Abstract Identifying a maximallyseparated set of signals is imp ortant in the design of mo dems The notion of optimality is dep endent on the mo del chosen to describ e noise in the measurements while some analytic results can b e derived under the assumption of Gaussian noise no suchtechniques are known for choosing signal sets in the nonGaussian case To obtain numerical solutions for non Gaussian detectors minimax problems are transformed into nonlinear programs resulting in a novel formulation yielding problems with relatively few variables and many inequality constraints Using sequential quadratic programming optimal signal sets are obtained for a variety of noise distributions Key words Optimal Design Inequality Constraints Sequential Quadratic Programming of the National Institute of Standards and Technology and not sub ject to copyright Contribution in the United States y Department of Mathematics Universityof Michigan Ann Arb or MI z Mathematical and Computational Sciences Division National Institute of Standards and Tech nology Gaithersburg MD Introduction The transmission of digital information requires signals nite time series that can b e distinguished from one another in the presence of noise These signals may b e constrained by b ounds on their energy or amplitude the degree to which they can b e distinguished dep ends on the distribution of noise We study the design of optimal signal sets under amplitude constraints and in the