DOCSLIB.ORG

Algorithms and Environments for Complementarity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algorithms and Environments for Complementarity Algorithms and Environments for Complementarity By Todd S. Munson A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN – MADISON 2000 i Abstract Complementarity problems arise in a wide variety of disciplines. Prototypical examples include the Wardropian and Walrasian equilibrium models encountered in the engineering and economic disciplines and the first order optimality conditions for nonlinear programs from the optimization community. The main focus of this thesis is algorithms and envi- ronments for solving complementarity problems. Environments, such as AMPL and GAMS, are used by practitioners to easily write large, complex models. Support for these packages is provided by PATH 4.x and SEMI through the customizable solver interface specified in this thesis. The main design feature is the abstraction of core components from the code with implementations tailored to a particular environment supplied either at compile or run time. This solver interface is then used to develop new links to the MATLAB and NEOS tools. Preprocessing techniques are an integral part of linear and mixed integer programming codes and are primarily used to reduce the size and complexity of a model prior to solving it. For example, wasted computation is avoided when an infeasible model is detected. This thesis documents the new techniques for preprocessing complementarity problems contained in the PATH 4.x and SEMI algorithms. PATH 4.x is more reliable than prior versions of the code and has been able to find solutions to previously unsolvable models. The reasons for the improvement are discussed in this thesis and include new theoretical developments for a globalization scheme based on the Fischer-Burmeister merit function, and enhancements made to the linear complementarity solver, nonmonotone linesearch, and restart strategy. SEMI is an alternative to PATH 4.x based on the semismooth algorithm. The main ii computation in PATH 4.x is to solve linear complementarity problems, which can be quite expensive. The new SEMI code described in this thesis only solves linear systems of equations and uses iterative methods to process very large models. The theme of this thesis is “enabling” technologies in complementarity: environments enable practitioners to easily specify models; sophisticated codes enable them to solve the models; and theory assures them that the algorithm is well-defined and efficiently processes models. iii Acknowledgements I would like to thank my family and educators throughout the years who have taught me many important lessons. Without them, I would not have attended university, let alone pursue an advanced degree. Several people have influenced the work in this thesis. The most important are my advisor, Michael Ferris, who first introduced me to complementarity, and Steven Dirkse and Danny Ralph who paved the way for the current version of PATH. Others include Stephen Billups, Arne Drud, Francisco Facchinei, Andreas Fischer, David Gay, Christian Kanzow, Alex Meeraus, Jorge Mor´e, and Steve Wright. I have also benefitted immensely from interaction with other graduate students including Paul Bradley, Qun Chen, William Donaldson, Glenn Fung, Yuh-Jye Lee, Jinho Lim, David Musicant, Krung Sinapiromsaran, and Meta Voelker. Many individuals have tested the software developed in this thesis and have provided feedback. Special thanks to Sherman Robinson, Thomas Rutherford, and Francis Tin-loi who continue to challenge the solvers. The members of my committee, Thomas Cox, Miron Livny, Olvi Mangasarian, and Stephen Robinson, have made many useful suggestions to improve the presentation of this thesis. Finally, I want to give many thanks to the secretarial and support staff for the Com- puter Sciences Department at the University of Wisconsin - Madison. They have kept me on track and provided encouragement throughout my graduate studies. I am especially grateful to Laura Cuccia as she has constantly gone above and beyond the call of duty. When I needed something done on short notice, she always came through. iv The work in this thesis was supported by NSF grants CCR-9972372 and CCR- 9619765, AFOSR grant F49620-98-1-0417, GAMS Development Corporation, and a fel- lowship from Cisco Systems. v Contents Abstract i Acknowledgements iii 1 Introduction 1 1.1 Complementarity ............................... 2 1.2 NonsmoothReformulations . 6 1.2.1 NormalMap.............................. 6 1.2.2 SemismoothFormulation. 7 1.3 ExistenceofSolutions ............................ 10 1.3.1 LinearProblems ........................... 10 1.3.2 NonlinearProblems. .. .. 12 1.4 AlgorithmsandRegularity . 15 1.5 Summary ................................... 17 2 Environments 21 2.1 ExampleApplications ............................ 21 2.1.1 TransportationModel . 22 2.1.2 WalrasianEquilibrium . 26 2.2 AMPL..................................... 31 2.2.1 GeneralizedDeclaration . 40 2.2.2 SideConstraints ........................... 41 2.2.3 Presolve ................................ 42 vi 2.3 GAMS..................................... 43 2.3.1 ListingFile .............................. 50 2.3.2 RedefinedEquations . .. .. 53 2.3.3 Pitfalls................................. 54 2.4 MATLAB ................................... 56 2.4.1 Linear Complementarity Problems . 56 2.4.2 Nonlinear Complementarity Problems . .. 61 2.4.3 MexFunctions ............................ 64 2.4.4 Pitfalls................................. 65 2.5 NEOS ..................................... 66 2.5.1 Pitfalls................................. 70 2.6 Summary ................................... 71 3 Interfaces 73 3.1 Subroutines .................................. 74 3.2 ProblemStructures .............................. 78 3.2.1 MCP Interface ............................ 82 3.2.2 Preprocessing Interface........................ 85 3.3 SolverStructures ............................... 87 3.3.1 Options ................................ 87 3.3.2 WorkspaceAllocation. 89 3.4 ControlStructures .............................. 90 3.4.1 Error.................................. 90 3.4.2 Interrupts ............................... 92 3.4.3 Memory ................................ 92 vii 3.4.4 Output................................. 95 3.4.5 Timer ................................. 96 3.5 Driver ..................................... 97 3.6 Summary ................................... 100 4 Preprocessing 101 4.1 PolyhedralConstraints . 105 4.1.1 Presolve ................................ 105 4.1.2 Postsolve ............................... 112 4.2 StructuralImplications . 113 4.2.1 Intervals................................ 114 4.2.2 Duplicates............................... 114 4.2.3 SpecialStructure . .. .. 115 4.3 ComputationalResults . 118 4.4 Summary ................................... 123 5 Diagnostic Information 124 5.1 MeritFunctions................................ 125 5.2 Ill-DefinedModels............................... 127 5.2.1 FunctionUndefined. 127 5.2.2 JacobianUndefined. 131 5.3 PoorlyScaledModels............................. 132 5.4 SingularModels................................ 134 5.5 Summary ................................... 135 6 PATH 4.x 136 viii 6.1 AlgorithmandTheory ............................ 138 6.1.1 EquationProperties . 140 6.1.2 MeritFunctionProperties . 146 6.1.3 AlgorithmicFramework . 153 6.2 ImplementationFeatures . 161 6.2.1 CrashingMethod ........................... 162 6.2.2 NonmonotoneSearches . 162 6.2.3 Linear Complementarity Subproblems . 164 6.2.4 OtherFeatures ............................ 167 6.3 ComputationalResults . 167 6.4 UserDocumentation ............................. 178 6.4.1 AnatomyoftheLogFile . 179 6.4.2 OptionsSummary. .. .. 186 6.5 Summary ................................... 190 7 SEMI 192 7.1 MathematicalFoundation . 193 7.2 TheLinearSystem .............................. 198 7.2.1 IterativeTechniques . 199 7.2.2 DirectMethods ............................ 204 7.2.3 Summary ............................... 210 7.3 TheNonlinearModel............................. 210 k 7.3.1 Φ(x ) and Hk ............................. 211 7.3.2 Crashing................................ 213 7.3.3 StationaryPoints . .. .. 214 ix 7.4 ComputationalResults . 217 7.5 Summary ................................... 224 8 Conclusion 225 Bibliography 227 x List of Tables 1 AMPLSpecificOptions ........................... 35 2 AMPLReturnCodes............................. 36 3 AMPLReturnCodeMeanings........................ 36 4 SolutionStatusCodesforGAMS . .. .. 52 5 ModelStatusCodesforGAMS ....................... 52 6 ReturnmessagesforNEOS.......................... 69 7 Keywords for NEOS e-mail submissions . 70 8 StatuscodesforSubroutineInterfaces. .... 75 9 Initializationroutines. .. .. 80 10 Jacobianinformationroutines . .. 81 11 Accessfunctions................................ 81 12 Basisinformationcodes ........................... 81 13 Interfacefunctions .............................. 82 14 Required functions for MCP Interface ................... 84 15 Optional functions for MCP Interface .................... 85 16 MCP Termination codes ........................... 87 17 Key fields in Information structure..................... 88 18 Functionsfordealingwithoptions. ... 89 19 ErrorObjectFunctions............................ 91 20 InterruptObjectFunctions. 92 21 MemoryObjectFunctions .......................... 93 22 OutputObjectFunctions........................... 95 xi 23 TimerObjectFunctions ........................... 96 24 RedundantRowsCases...........................
Load more

Recommended publications
  • Linear Complementarity Problems on Extended Second Order Cones (ESOCLCP)
    Linear complementarity problems on extended second order cones S. Z. N´emeth School of Mathematics, University of Birmingham Watson Building, Edgbaston Birmingham B15 2TT, United Kingdom email: [email protected] L. Xiao School of Mathematics, University of Birmingham Watson Building, Edgbaston Birmingham B15 2TT, United Kingdom email: [email protected] November 9, 2018 Abstract In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We state necessary and sufficient conditions for a point to be a solution of the converted problem. We also present solution strategies for this problem, such as the Newton method and Levenberg- Marquardt algorithm. Finally, we present some numerical examples. Keywords: Complementarity Problem, Extended Second Order Cone, Conic Opti- mization 2010 AMS Subject Classification: 90C33, 90C25 1 Introduction arXiv:1707.04268v5 [math.OC] 19 Jan 2018 Although research in cone complementarity problems (see the definition in the beginning of the Preliminaries) goes back a few decades only, the underlying concept of complementarity is much older, being firstly introduced by Karush in 1939 [1]. It seems that the concept of comple- mentarity problems was first considered by Dantzig and Cottle in a technical report [2], for the non-negative orthant. In 1968, Cottle and Dantzig [3] restated the linear programming prob- lem, the quadratic programming problem and the bimatrix game problem as a complementarity problem, which inspired the research in this field (see [4–8]). The complementarity problem is a cross-cutting area of research which has a wide range of applications in economics, finance and other fields.
    [Show full text]
  • Case Studies in Operations Research Ed
    International Series in Operations Research & Management Science ISOR 212 Murty International Series in Katta G. Murty Editor Operations Research & Management Science Case Studies in Operations Research Ed. Applications of Optimal Decision Making Th is textbook is comprised of detailed case studies covering challenging real world applications of OR techniques. Among the overall goals of the book is to provide readers with descriptions of the history and other background information on a variety of industries, service or other organizations in which decision making is an important component of their daily operations. Th e book considers all methods of optimum decision making in order to improve performances. It also compares possible solutions obtained by diff erent approaches, concluding with a recommendation of the best among Katta G. Murty Editor them for implementation. By exposing students to a variety of applications in a variety of areas and explaining how they can be modeled and solved, the book helps students develop the skills needed for modeling and solving problems that they may face in the workplace. Each chapter of " Case Studies in Operations Research: Applications of Optimal Decision Making" also includes additional data provided on the book’s website on Springer.com. 1 Th ese fi les contain a brief description of the area of application, the problem and the required outputs. Also provided are links to access all the data in the problem. Finally Case Studies there are project exercises for students to practice what they have learnt in the chapter, Research Studies in Operations Case which can also be used by instructors as project assignments in their courses.
    [Show full text]
  • An Introduction to Complementarity (Pdf)
    An Introduction to Complementarity Michael C. Ferris University of Wisconsin, Madison Nonsmooth Mechanics Meeting: June 14, 2010 Ferris (Univ. Wisconsi) EMP Aussois, June 2010 1 / 63 Outline Introduction to Complementarity Models Extension to Variational Inequalities Extended Mathematical Programming Heirarchical Optimization Introduction: Transportation Model Application: World Dairy Market Model Algorithms: Feasible Descent Framework Implementation: PATH Results Ferris (Univ. Wisconsi) EMP Aussois, June 2010 2 / 63 Sample Network D1 S1 D2 S2 D3 S3 D4 Ferris (Univ. Wisconsi) EMP Aussois, June 2010 3 / 63 Transportation Model Suppliers ship good from warehouses to customers I Satisfy demand for commodity I Minimize transportation cost Transportation network provided as set A of arcs Variables xi;j - amount shipped over (i; j) 2 A Parameters I si - supply at node i I di - demand at node i I ci;j - cost to ship good from nodes i to j Ferris (Univ. Wisconsi) EMP Aussois, June 2010 4 / 63 Linear Program P minx≥0 (i;j)2A ci;j xi;j P subject to j:(i;j)2A xi;j ≤ si 8 i P i:(i;j)2A xi;j ≥ dj 8 j Ferris (Univ. Wisconsi) EMP Aussois, June 2010 5 / 63 Multipliers Introduce multipliers (marginal prices) ps and pd P s j:(i;j)2A xi;j ≤ si pi ≥ 0 In a competitive marketplace P s j:(i;j)2A xi;j < si ) pi = 0 At solution P s j:(i;j)2A xi;j = si or pi = 0 Complementarity relationship P s j:(i;j)2A xi;j ≤ si ? pi ≥ 0 Ferris (Univ. Wisconsi) EMP Aussois, June 2010 6 / 63 Wardropian Equilibrium Delivery cost exceeds market price s d pi + ci;j ≥ pj Strict inequality implies no shipment xi;j = 0 Linear complementarity problem P s j:(i;j)2A xi;j ≤ si ? pi ≥ 0 8 i P d dj ≤ i:(i;j)2A xi;j ? pi ≥ 0 8 j d s pj ≤ pi + ci;j ? xi;j ≥ 0 8 (i; j) 2 A • First order conditions for linear program Ferris (Univ.
    [Show full text]
  • Using Simulation for Planning and Design of Robotic Systems with Intermittent Contact
    USING SIMULATION FOR PLANNING AND DESIGN OF ROBOTIC SYSTEMS WITH INTERMITTENT CONTACT By Stephen George Berard A Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: COMPUTER SCIENCE Approved by the Examining Committee: Jeffrey Trinkle, Thesis Adviser Kurt Anderson, Member John Mitchell, Member Barbara Cutler, Member Rensselaer Polytechnic Institute Troy, New York April 2009 (For Graduation May 2009) c Copyright 2009 by Stephen George Berard All Rights Reserved ii CONTENTS LIST OF TABLES . vii LIST OF FIGURES . viii ACKNOWLEDGMENT . xiii ABSTRACT . xiv 1. Introduction . 1 1.1 Contributions . 2 2. Background . 6 2.1 Rigid Body Kinematics . 6 2.1.1 Position and Orientation . 6 2.1.2 Rotation Group . 8 2.1.3 Euclidean Group . 9 2.1.4 Velocity of a Rigid Body . 11 2.1.4.1 Kinematic Update . 12 2.1.4.2 Velocity of a Point on a Rigid Body . 13 2.1.4.3 Twists . 14 2.2 Kinetics . 15 2.2.1 Wrenches . 16 2.2.2 Transforming Twists and Wrenches . 17 2.2.3 Equations of Motion . 17 2.3 Complementarity Problem . 18 2.3.1 Finding Solutions of Complementarity Problems . 19 2.4 Complementarity formulation of Dynamics . 21 2.4.1 Equality Constraints . 23 2.4.1.1 Bilaterally Constrained Dynamics Formulation . 24 2.4.2 Contact . 25 2.4.2.1 Rigid Contact . 25 2.4.3 Instantaneous Formulation of Constrained Dynamics . 32 2.4.3.1 Nonlinear DCP Formulation . 32 2.4.3.2 Linear DCP Formulation .
    [Show full text]
  • Linear Complementarity Problems on Extended Second Order Cones Nemeth, Sandor; Xiao, Lianghai
    University of Birmingham Linear complementarity problems on extended second order cones Nemeth, Sandor; Xiao, Lianghai DOI: 10.1007/s10957-018-1220-x License: Creative Commons: Attribution (CC BY) Document Version Publisher's PDF, also known as Version of record Citation for published version (Harvard): Nemeth, S & Xiao, L 2018, 'Linear complementarity problems on extended second order cones', Journal of Optimization Theory and Applications, vol. 176, no. 2, pp. 269-288. https://doi.org/10.1007/s10957-018-1220-x Link to publication on Research at Birmingham portal General rights Unless a licence is specified above, all rights (including copyright and moral rights) in this document are retained by the authors and/or the copyright holders. The express permission of the copyright holder must be obtained for any use of this material other than for purposes permitted by law. •Users may freely distribute the URL that is used to identify this publication. •Users may download and/or print one copy of the publication from the University of Birmingham research portal for the purpose of private study or non-commercial research. •User may use extracts from the document in line with the concept of ‘fair dealing’ under the Copyright, Designs and Patents Act 1988 (?) •Users may not further distribute the material nor use it for the purposes of commercial gain. Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document. When citing, please reference the published version. Take down policy While the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.
    [Show full text]
  • International Series in Operations Research & Management Science
    International Series in Operations Research & Management Science Volume 212 Series Editor Camille C. Price Stephen F. Austin State University, Texas, USA Associate Series Editor Joe Zhu Worcester Polytechnic Institute Worcester, Massachusetts, USA Founding Series Editor Frederick S. Hillier Stanford University, CA, USA For further volumes: http://www.springer.com/series/6161 The book series International Series in Operations Research and Management Sci- ence encompasses the various areas of operations research and management science. Both theoretical and applied books are included. It describes current advances any- where in the world that are at the cutting edge of the field. The series is aimed especially at researchers, doctoral students, and sophisticated practitioners. The series features three types of books: • Advanced expository books that extend and unify our understanding of particular areas. • Research monographs that make substantial contributions to knowledge. • Handbooks that define the new state of the art in particular areas. They will be entitled Recent Advances in (name of the area). Each handbook will be edited by a leading authority in the area who will organize a team of experts on various aspects of the topic to write individual chapters. A handbook may emphasize expository surveys or completely new advances (either research or applications) or a combination of both. The series emphasizes the following four areas: Mathematical Programming: Including linear programming, integer programming, nonlinear programming, interior point methods, game theory, network optimization models, combinatorics, equilibrium programming, complementarity theory, multi- objective optimization, dynamic programming, stochastic programming, complexity theory, etc. Applied Probability: Including queuing theory, simulation, renewal theory, Brownian motion and diffusion processes, decision analysis, Markov decision processes, reli- ability theory, forecasting, other stochastic processes motivated by applications, etc.
    [Show full text]
  • Todd Munson: Algorithms and Environments for Complementarity
    Algorithms and Environments for Complementarity By Todd S. Munson A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN – MADISON 2000 i Abstract Complementarity problems arise in a wide variety of disciplines. Prototypical examples include the Wardropian and Walrasian equilibrium models encountered in the engineering and economic disciplines and the first order optimality conditions for nonlinear programs from the optimization community. The main focus of this thesis is algorithms and envi- ronments for solving complementarity problems. Environments, such as AMPL and GAMS, are used by practitioners to easily write large, complex models. Support for these packages is provided by PATH 4.x and SEMI through the customizable solver interface specified in this thesis. The main design feature is the abstraction of core components from the code with implementations tailored to a particular environment supplied either at compile or run time. This solver interface is then used to develop new links to the MATLAB and NEOS tools. Preprocessing techniques are an integral part of linear and mixed integer programming codes and are primarily used to reduce the size and complexity of a model prior to solving it. For example, wasted computation is avoided when an infeasible model is detected. This thesis documents the new techniques for preprocessing complementarity problems contained in the PATH 4.x and SEMI algorithms. PATH 4.x is more reliable than prior versions of the code and has been able to find solutions to previously unsolvable models. The reasons for the improvement are discussed in this thesis and include new theoretical developments for a globalization scheme based on the Fischer-Burmeister merit function, and enhancements made to the linear complementarity solver, nonmonotone linesearch, and restart strategy.
    [Show full text]
  • Tra C Modeling and Variational Inequalities Using GAMS
    Trac Mo deling and Variational Inequalities using GAMS y z Steven P Dirkse Michael C Ferris April Abstract We describ e how several trac assignment and design problems can b e formulated within the GAMS mo deling language using newly developed mo deling and interface to ols The fundamental problem is user equilibrium where multiple drivers comp ete nonco op eratively for the resources of the trac network A description of how these mo dels can b e written as complementarity problems variational inequalities mathematical programs with equilibrium constraints or sto chastic lin ear programs is given At least one general purp ose solution technique for each mo del format is briey outlined Some observations relating to particular mo del solutions are drawn Introduction Mo dels that p ostulate ways to assign trac within a transp ortation network for a given demand have b een used in planning and analysis for many years see and references therein A p opular technique for such assignment is to use the shortest path b etween the origin and destination p oints of a given journey Of course such a path dep ends not only on the physical distance b etween these two p oints but also on the mo de of transp ort and the congestion exp erienced during the trip This material is based on research supp orted by National Science Foundation Grant CCR y GAMS Development Corp oration Potomac Street NW Washington DC stevegamscom z Computer Sciences Department University of Wisconsin Madison West Day ton Street Madison Wisconsin ferriscswiscedu To account
    [Show full text]
  • Some Generalizations of the Linear Complementarity Problem by Peng
    Some Generalizations of The Linear Complementarity Problem by Peng Yi A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Engineering - Industrial Engineering and Operations Research in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Ilan Adler, Chair Professor Shmuel S. Oren Professor Bernd Sturmfels Spring 2016 Some Generalizations of The Linear Complementarity Problem Copyright 2016 by Peng Yi 1 Abstract Some Generalizations of The Linear Complementarity Problem by Peng Yi Doctor of Philosophy in Engineering - Industrial Engineering and Operations Research University of California, Berkeley Professor Ilan Adler, Chair In this thesis, we study two generalizations of the classical linear complementarity prob- lem (LCP) - the weighted extended linear complementarity problem (wXLCP) and the com- plementarity problem (CP) over a general closed cone. Our goal is twofold: extend some fundamental results of the LCP to a more general setting and identify a class of nonmonotone problems which could be solved numerically. The thesis is organized as follows: • In Chapter 1, we formulate problems relevant to our study and introduce background material that will be needed in the rest of the thesis. • In Chapter 2, we formulate the weighted extended linear complementarity problem (XLCP), which naturally generalizes the LCP, the horizontal linear complementarity problem (HLCP) and the extended linear complementarity problem (XLCP). Moti- vated by important roles played by matrix theoretic properties in the LCP theory, we study the monotonicity, sufficiency, P -property and R0-property in the setting of the XLCP. Together with two optimization reformulations of the problem, we establish several fundamental results.
    [Show full text]
  • Linear Programming III
    Linear programming III 1. LP solvers 2. LP solver in Maple 3. GLPK - GNU linear programming kit 4. LP model representations 5. Branch and bound method for mixed Integer linear programming CP412 ADAII Introduction # 1 1. LP solvers LP algorithms have been implemented in many packages https://en.wikipedia.org/wiki/Linear_programming • Proprietary packages – Dedicated packages: CPLEX, free for academic use, LINDO – General math tool: Maple, MATLAB, Mathematica, – Plugin: Excel solver – Libraries for specific LP apps, or embedded applications • Open source packages – CLP -- a LP solver from COIN-OR – GLPK -- GNU Linear Programming Kit, CP412 ADAII Introduction # 2 2. LP solver in Maple • Use Optimization package • Features – LP solver, integer programming by branch and bound, missed LP program – None-linear programming – Support matrix format • Small scale, testing, education Example: with(Optimization): LPSolve( 13*A+23*B, {0 <= A, 0 <= B, 4*A+4*B <= 160, 5*A+15*B <= 480, 35*A+20*B <= 1190}) CP412 ADAII Introduction # 3 3. GLPK • GLPK is available free of charge under GLU license • Features – Simplex method, dual simplex method, mixed integer linear programming, implemented in C – Include Java wrapper, plus many third-party wrappers for other languages – Can be compiled as stand-alone solver, or used as embedded LP solver – Provide library and APIs for application development. – Support major LP input file format – Interfaces to database CP412 ADAII Introduction # 4 GLPK in Action • Download – https://sourceforge.net/projects/winglpk • Build glpk library • Build embedded solver • Build stand alone solver: glpsol.exe glpsol --help glpsol --lp cplextest.lp -o result.txt glpsol --lp beer.lp -o result.txt glpsol --mps beer.mps -o result.txt --max glpsol -m beer.mod -o result.txt Demo • GLPK/Solution information https://en.wikibooks.org/wiki/GLPK/Solution_information CP412 ADAII Introduction # 5 4.
    [Show full text]
  • Basics for Mathematical Economics
    Basics for Mathematical Economics Lagrange multipliers __________________________________________________ 2 Karush–Kuhn–Tucker conditions ________________________________________ 12 Envelope theorem ___________________________________________________ 16 Fixed Point Theorems _________________________________________________ 20 Complementarity theory ______________________________________________ 24 Mixed complementarity problem _______________________________________ 26 Nash equilibrium ____________________________________________________ 30 1 Lagrange multipliers Figure 1: Find x and y to maximize f(x,y)subject to a constraint (shown in red)g(x,y) = c. Figure 2: Contour map of Figure 1. The red line shows the constraint g(x,y) = c. The blue lines are contours of f(x,y). The intersection of red and blue lines is our solution. In mathematical optimization, the method of Lagrange multipliers (named after Joseph Louis Lagrange) is a method for finding the maximum/minimum of a function subject to constraints. For example (see Figure 1 on the right) if we want to solve: maximize subject to We introduce a new variable (λ) called a Lagrange multiplier to rewrite the problem as: maximize Solving this new equation for x, y, and λ will give us the solution (x, y) for our original equation. 2 Introduction Consider a two-dimensional case. Suppose we have a function f(x,y) we wish to maximize or minimize subject to the constraint where c is a constant. We can visualize contours of f given by for various values of dn, and the contour of g given by g(x,y) = c. Suppose we walk along the contour line with g = c. In general the contour lines of f and g may be distinct, so traversing the contour line for g = c could intersect with or cross the contour lines of f.
    [Show full text]
  • On the Nonlinear Complementarity Problem
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 123, 455460 (1987) On the Nonlinear Complementarity Problem MUHAMMAD ASLAM NOOR Department of Mathemutics, King Saud University, Riyadh, Saudi Arabia Submitted by George Leitmann Received October 15, 1985 We consider and study an algorithm for a new class of complementarity problems of finding u such that u 2 0. Tu+A(u)>O, (u, Tu+A(u))=O, where T is a continuous mapping and A is a diagonally nonlinear mapping from [w” into itself. Furthermore, it is proved that the approximate solution obtained by the iterative scheme converges to the exact solution. Special cases are also discussed. (’ 1987 Academic Press, Inc. 1. INTRODUCTION Variational inequality theory besides being elegant, exciting and rich, also provides us a unified and natural framework to study a large class of linear and nonlinear problems arising in mathematical and engineering sciences. Equally important is the area of operations research known as complementarity theory, which has received much attention during the last twenty years. It has been shown by Karamardian [ 11, that if the convex set involved in a variational inequality problem and complementarity problem is a convex cone, then both problems are equivalent. In fact, variational inequality problems are more general than the complementarity problems, and incluce them as special cases. Recently various extensions and generalizations of the variational inequality and complementarity problems have been introduced and analyzed. An important and useful generalization of the variational inequality problems is the mildly nonlinear variational inequality problem introduced and studied by Noor [2,3].
    [Show full text]