DOCSLIB.ORG

Developing Large-Scale Optimization Models with the MPL Modeling System

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Developing Large-Scale Optimization Models with the MPL Modeling System Developing Large-scale Optimization Models with the MPL Modeling System A White Paper Maximal Software, Inc. 2111 Wilson Boulevard, Suite 700 Arlington, VA 22201, USA (703) 522-7900 www.maximalsoftware.com Developing Large-Scale Optimization Models With the MPL Modeling System I. Introduction Optimization is today one of the most important tools in implementing and planning efficient operations and increasing competitive advantage. Organizations need to make intelligent decisions to obtain optimal use of their available resources, such as manpower, equipment, raw materials and capital. The discipline of optimization, through the use of advanced mathematics and computer science techniques, can be used to assist organizations with solving their complex business problems in areas such as manufacturing, distribution, finance, and scheduling. Typically, these optimization problems contain hundreds, thousands, or even millions of interconnected variables and require an advanced set of software tools to solve. Today, the field of optimization entails highly advanced software applications that integrate sophisticated mathematical algorithms and modeling techniques with intelligent software programming and data processing capabilities. There are a variety of business problems where optimization is applicable. For instance, organizations have been implementing, with enormous effort and expense, ERP (Enterprise Resource Planning) and SCM (Supply Chain Management) systems in order to access corporate data to make important decisions that can improve productivity and increase their competitive edge. Optimization can now be used to perform in-depth analysis on this data in order to identify the implications of different options before making key decisions. Optimization projects begin with the development of a mathematical model that defines the business problem. Individual business decisions are represented as “variables,” and the connections between them are represented by a series of mathematical equations termed “constraints”. The “objective” represents the goal of the business problem, for example, to maximize profitability or lower costs. Identifying the variables, the constraints and the objective is known as the “modeling” process and is an essential task for every optimization project. After the model has been formulated, it is then solved, using an optimization solver, which, at its core, has highly sophisticated algorithms adept at intelligently sorting through huge amounts of data and analyzing possible approaches to come up with an optimal solution. MPL Modeling System Maximal Software Inc. is the developer of MPL (Mathematical Programming Language) an advanced modeling system that allows the model developer to formulate complicated optimization models in a clear, concise, and efficient way. Models developed in MPL can then be solved with any of the multiple commercial optimizers available on the market today. MPL includes an algebraic modeling language that allows the model developer to create optimization models using algebraic equations. The model is used as a basis to generate a mathematical matrix that can be relayed directly into the optimization solver. This is all done in the background so that the model developer only needs to focus on formulating the model. Algebraic modeling languages, such as MPL, have proven themselves over the years to be the most efficient method of developing and maintaining optimization models because they are easier to learn, quicker to formulate and require less programming. MPL offers a feature-rich model development environment that takes full advantage of the graphical user interface in Microsoft Windows, making MPL a valuable tool for developing optimization models. MPL can import data directly from databases or spreadsheets. Once the model has been solved, MPL also has the ability to export the solution back into the database. MPL models can be embedded into other Windows applications, such as databases or spreadsheets, which makes MPL ideal for creating end-user applications. 1 The main purpose of a modeling language is to retrieve data from a structured data source, such as a database, and generate a matrix that the optimization solver can handle. For large optimization models, this matrix generation requires a modeling language with highly advanced capabilities, such as sparse indexing and database management, as well as high scalability and speed. Many details need to be taken into account when choosing a modeling language for optimization projects: ♦ Model Development Environment ♦ Robustness and Flexibility of the Modeling Language ♦ Indexing and Data Management ♦ Scalability and Speed ♦ Database Connections ♦ Connection to Solvers ♦ Deployment into Applications This white paper will explore each of these areas and demonstrate how the MPL Modeling System implements them. II. MPL Integrated Model Development Environment The MPL Modeling System is a state-of-the-art optimization modeling software. MPL, through the use of advanced graphical user interface features, creates a flexible working environment that enables the model developer to be more efficient and productive. MPL provides in a single system all the essential components needed to formulate the model, gather and maintain the data, optimize the model, and then analyze the results. The model developer uses the built-in model editor to formulate the MPL model statements and then selects the optimizer directly from the menus to solve the model. The solution results are automatically retrieved from the solver and displayed, providing the user with instant feedback. Each item defined in the model is also displayed in a tree window allowing the model developer to browse through them easily. When using MPL to work on multiple models, the user can manage them effectively by utilizing project files. Project files store information about items such as, open model files and windows, the default working directory, and current option settings for both the modeling system and the solver. The MPL Modeling System links to solvers dynamically through memory at run-time. This gives MPL the capability to integrate the solver completely into the modeling environment, resulting in the matrix being transferred between the modeling system and the solver directly through memory. As no files are involved, this seamless connection is both considerably faster and more robust than the traditional use of files in other modeling systems. In the event it is necessary to change any algorithmic options, MPL provides easy-to-use option dialog boxes for each solver. MPL fully supports context-sensitive help for option dialog boxes. A complete, printable on-line version of the manual, covering both the modeling environment and the language, is also available in the on-line help system for easy access. MPL was designed to be portable and to be run on multiple platforms. MPL for Windows is the most popular platform but an OSF Motif version is also available for various UNIX flavors including: HP 9000, IBM RS-6000, Sun SPARC, and Silicon Graphics. MPL models are portable so a model created for one platform can always be read on any other supported platform. 2 III. MPL Modeling Language The MPL modeling language offers a natural algebraic notation that enables the model developer to formulate complex optimization models in a concise, easy-to-read manner. Among modeling languages, MPL is unrivaled in its expressive power, readability, and user-friendliness. The MPL modeling language was designed to be very easy to use with a clear syntax making the process of formulating models in MPL efficient and productive. MPL is a very flexible language and can be used to formulate models in many different areas of optimization ranging from production planning, scheduling, finance, and distribution, to full-scale supply-chain optimization. MPL is a very robust and stable software whose core modules have been through extensive use and testing over more than a decade. This assures that the MPL software is both reliable and dependable and can be used in mission-critical projects. Some of the more notable features of the MPL language include: ♦ Separation of the data from the model formulation. ♦ Import data from different data sources. ♦ Independence from specific solvers. ♦ Use of macros for repetitive parts of the model. ♦ Include files to make handling of large problems easier. ♦ Exclusion of parts of the model using conditional directives. ♦ Special Ordered Sets and Semi-continuous variables ♦ WHERE/IF conditions to handle special cases. ♦ Readable and helpful error messages. Sparse Index and Data Handling One of the most important features of any modeling language is how it handles large amounts of data. What makes MPL so powerful is its ability to effectively handle very large sparse index and data sets. In addition, MPL has extensive flexibility when working with subsets of indexes, functions of indexes, and compound or multi-dimensional index sets. This allows the model formulator, for example, to index only over products that are made by each machine in a specific plant instead of having to go through all the products for all the machines and all the plants, which would be considerable slower. Scalability and Speed MPL can easily handle very large matrices with millions of variables and constraints. This is especially important when dealing with large supply-chain optimization models over multiple time periods that can grow very quickly. MPL has its own memory manager
Load more

Recommended publications
  • How to Use Your Favorite MIP Solver: Modeling, Solving, Cannibalizing
    How to use your favorite MIP Solver: modeling, solving, cannibalizing Andrea Lodi University of Bologna, Italy [email protected] January-February, 2012 @ Universit¨atWien A. Lodi, How to use your favorite MIP Solver Setting • We consider a general Mixed Integer Program in the form: T maxfc x : Ax ≤ b; x ≥ 0; xj 2 Z; 8j 2 Ig (1) where matrix A does not have a special structure. A. Lodi, How to use your favorite MIP Solver 1 Setting • We consider a general Mixed Integer Program in the form: T maxfc x : Ax ≤ b; x ≥ 0; xj 2 Z; 8j 2 Ig (1) where matrix A does not have a special structure. • Thus, the problem is solved through branch-and-bound and the bounds are computed by iteratively solving the LP relaxations through a general-purpose LP solver. A. Lodi, How to use your favorite MIP Solver 1 Setting • We consider a general Mixed Integer Program in the form: T maxfc x : Ax ≤ b; x ≥ 0; xj 2 Z; 8j 2 Ig (1) where matrix A does not have a special structure. • Thus, the problem is solved through branch-and-bound and the bounds are computed by iteratively solving the LP relaxations through a general-purpose LP solver. • The course basically covers the MIP but we will try to discuss when possible how crucial is the LP component (the engine), and how much the whole framework is built on top the capability of effectively solving LPs. • Roughly speaking, using the LP computation as a tool, MIP solvers integrate the branch-and-bound and the cutting plane algorithms through variations of the general branch-and-cut scheme [Padberg & Rinaldi 1987] developed in the context of the Traveling Salesman Problem (TSP).
    [Show full text]
  • Process Optimization
    Process Optimization Mathematical Programming and Optimization of Multi-Plant Operations and Process Design Ralph W. Pike Director, Minerals Processing Research Institute Horton Professor of Chemical Engineering Louisiana State University Department of Chemical Engineering, Lamar University, April, 10, 2007 Process Optimization • Typical Industrial Problems • Mathematical Programming Software • Mathematical Basis for Optimization • Lagrange Multipliers and the Simplex Algorithm • Generalized Reduced Gradient Algorithm • On-Line Optimization • Mixed Integer Programming and the Branch and Bound Algorithm • Chemical Production Complex Optimization New Results • Using one computer language to write and run a program in another language • Cumulative probability distribution instead of an optimal point using Monte Carlo simulation for a multi-criteria, mixed integer nonlinear programming problem • Global optimization Design vs. Operations • Optimal Design −Uses flowsheet simulators and SQP – Heuristics for a design, a superstructure, an optimal design • Optimal Operations – On-line optimization – Plant optimal scheduling – Corporate supply chain optimization Plant Problem Size Contact Alkylation Ethylene 3,200 TPD 15,000 BPD 200 million lb/yr Units 14 76 ~200 Streams 35 110 ~4,000 Constraints Equality 761 1,579 ~400,000 Inequality 28 50 ~10,000 Variables Measured 43 125 ~300 Unmeasured 732 1,509 ~10,000 Parameters 11 64 ~100 Optimization Programming Languages • GAMS - General Algebraic Modeling System • LINDO - Widely used in business applications
    [Show full text]
  • Notes 1: Introduction to Optimization Models
    Notes 1: Introduction to Optimization Models IND E 599 September 29, 2010 IND E 599 Notes 1 Slide 1 Course Objectives I Survey of optimization models and formulations, with focus on modeling, not on algorithms I Include a variety of applications, such as, industrial, mechanical, civil and electrical engineering, financial optimization models, health care systems, environmental ecology, and forestry I Include many types of optimization models, such as, linear programming, integer programming, quadratic assignment problem, nonlinear convex problems and black-box models I Include many common formulations, such as, facility location, vehicle routing, job shop scheduling, flow shop scheduling, production scheduling (min make span, min max lateness), knapsack/multi-knapsack, traveling salesman, capacitated assignment problem, set covering/packing, network flow, shortest path, and max flow. IND E 599 Notes 1 Slide 2 Tentative Topics Each topic is an introduction to what could be a complete course: 1. basic linear models (LP) with sensitivity analysis 2. integer models (IP), such as the assignment problem, knapsack problem and the traveling salesman problem 3. mixed integer formulations 4. quadratic assignment problems 5. include uncertainty with chance-constraints, stochastic programming scenario-based formulations, and robust optimization 6. multi-objective formulations 7. nonlinear formulations, as often found in engineering design 8. brief introduction to constraint logic programming 9. brief introduction to dynamic programming IND E 599 Notes 1 Slide 3 Computer Software I Catalyst Tools (https://catalyst.uw.edu/) I AIMMS - optimization software (http://www.aimms.com/) Ming Fang - AIMMS software consultant IND E 599 Notes 1 Slide 4 What is Mathematical Programming? Mathematical programming refers to \programming" as a \planning" activity: as in I linear programming (LP) I integer programming (IP) I mixed integer linear programming (MILP) I non-linear programming (NLP) \Optimization" is becoming more common, e.g.
    [Show full text]
  • Co-Optimization of Transmission and Other Supply Resources
    Co-optimization of Transmission and Other Supply Resources September, 2013 Illinois Institute of Technology Iowa State University Johns Hopkins University Purdue University West Virginia University For EISPC and NARUC Funded by the U.S Department of Energy Co-optimization of Transmission and Other Supply Resources prepared for Eastern Interconnection States’ Planning Council and National Association of Regulatory Utility Commissioners prepared by Dr. Andrew (Lu) Liu, Purdue University Dr. Benjamin H. Hobbs and Jonathan Ho, Johns Hopkins University Dr. James D. McCalley and Venkat Krishnan, Iowa State University Dr. Mohammad Shahidehpour, Illinois Institute of Technology Dr. Qipeng P. Zheng, University of Central Florida Acknowledgement: This material is based upon work supported by the Department of Energy, National Energy Technology Laboratory, under Award Number DE-OE0000316. The project team would like to thank Bob Pauley, Doug Gotham and Stan Hadley as well as the EISPC and NARUC organizations, for their support throughout this project. Patrick Sullivan of NREL provided crucial perspectives, advice, and resources during the project. We would also like to acknowledge inputs on earlier versions of our work by members of NARUC’s Studies and Whitepaper Workgroup. The earlier versions as well benefited from the editorial assistance provided by Jingjie Xiao, a former PhD student with the School of Industrial Engineering at Purdue University, and her generous efforts are greatly appreciated. In addition, the team gratefully acknowledge the generous and timely assistance of several organizations that have provided important background information on transmission planning, including but not limited to: Parveen Baig, Iowa Utilities Board Jaeseok Choi, Gyeongsang National University, South Korea Bruce Fardanesh, New York Power Authority Flora Flydt, ATC Ian Grant, TVA Bruce Hamilton, Smart Grid Network Ben Harrison, Duke Energy Michael Henderson, ISO New England Len Januzik, Quanta Technology David Kelley, SPP Raymond Kershaw, ITC Holdings Corp.
    [Show full text]
  • MODELING LANGUAGES in MATHEMATICAL OPTIMIZATION Applied Optimization Volume 88
    MODELING LANGUAGES IN MATHEMATICAL OPTIMIZATION Applied Optimization Volume 88 Series Editors: Panos M. Pardalos University o/Florida, U.S.A. Donald W. Hearn University o/Florida, U.S.A. MODELING LANGUAGES IN MATHEMATICAL OPTIMIZATION Edited by JOSEF KALLRATH BASF AG, GVC/S (Scientific Computing), 0-67056 Ludwigshafen, Germany Dept. of Astronomy, Univ. of Florida, Gainesville, FL 32611 Kluwer Academic Publishers Boston/DordrechtiLondon Distributors for North, Central and South America: Kluwer Academic Publishers 101 Philip Drive Assinippi Park Norwell, Massachusetts 02061 USA Telephone (781) 871-6600 Fax (781) 871-6528 E-Mail <[email protected]> Distributors for all other countries: Kluwer Academic Publishers Group Post Office Box 322 3300 AlI Dordrecht, THE NETHERLANDS Telephone 31 78 6576 000 Fax 31 786576474 E-Mail <[email protected]> .t Electronic Services <http://www.wkap.nl> Library of Congress Cataloging-in-Publication Kallrath, Josef Modeling Languages in Mathematical Optimization ISBN-13: 978-1-4613-7945-4 e-ISBN-13:978-1-4613 -0215 - 5 DOl: 10.1007/978-1-4613-0215-5 Copyright © 2004 by Kluwer Academic Publishers Softcover reprint of the hardcover 1st edition 2004 All rights reserved. No part ofthis pUblication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photo-copying, microfilming, recording, or otherwise, without the prior written permission ofthe publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Permissions for books published in the USA: P"§.;r.m.i.§J?i..QD.§.@:w.k~p" ..,.g.Qm Permissions for books published in Europe: [email protected] Printed on acid-free paper.
    [Show full text]
  • Download Classic LINDO User's Manual
    LINDO User’s Manual LINDO Systems, Inc. 1415 North Dayton Street, Chicago, Illinois 60622 Phone: (312)988-7422 Fax: (312)988-9065 E-mail: [email protected] WWW: http://www.lindo.com COPYRIGHT LINDO software and its related documentation are copyrighted. You may not copy the LINDO software or related documentation except in the manner authorized in the related documentation or with the written permission of LINDO systems, Inc. TRADEMARKS LINGO is a trademark, and LINDO and What’sBest! are registered trademarks, of LINDO Systems, Inc. Other product and company names mentioned herein are the property of their respective owners. DISCLAIMER LINDO Systems, Inc. warrants that on the date of receipt of your payment, the disk enclosed in the disk envelope contains an accurate reproduction of the LINDO software and that the copy of the related documentation is accurately reproduced. Due to the inherent complexity of computer programs and computer models, the LINDO software may not be completely free of errors. You are advised to verify your answers before basing decisions on them. NEITHER LINDO SYSTEMS, INC. NOR ANYONE ELSE ASSOCIATED IN THE CREATION, PRODUCTION, OR DISTRIBUTION OF THE LINDO SOFTWARE MAKES ANY OTHER EXPRESSED WARRANTIES REGARDING THE DISKS OR DOCUMENTATION AND MAKES NO WARRANTIES AT ALL, EITHER EXPRESSED OR IMPLIED, REGARDING THE LINDO SOFTWARE, INCLUDING THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR OTHERWISE. Further, LINDO Systems, Inc. reserves the right to revise this software and related documentation and make changes to the content hereof without obligation to notify any person of such revisions or changes.
    [Show full text]
  • Open Source and Free Software
    WP. 24 ENGLISH ONLY UNITED NATIONS STATISTICAL COMMISSION and EUROPEAN COMMISSION ECONOMIC COMMISSION FOR EUROPE STATISTICAL OFFICE OF THE CONFERENCE OF EUROPEAN STATISTICIANS EUROPEAN COMMUNITIES (EUROSTAT) Joint UNECE/Eurostat work session on statistical data confidentiality (Bilbao, Spain, 2-4 December 2009) Topic (iv): Tools and software improvements ON OPEN SOURCE SOFTWARE FOR STATISTICAL DISCLOSURE LIMITATION Invited Paper Prepared by Juan José Salazar González, University of La Laguna, Spain On open source software for Statistical Disclosure Limitation Juan José Salazar González * * Department of Statistics, Operations Research and Computer Science, University of La Laguna, 38271 Tenerife, Spain, e-mail: [email protected] Abstract: Much effort has been done in the last years to design, analyze, implement and compare different methodologies to ensure confidentiality during data publication. The knowledge of these methods is public, but the practical implementations are subject to different license constraints. This paper summarizes some concepts on free and open source software, and gives some light on the convenience of using these schemes when building automatic tools in Statistical Disclosure Limitation. Our results are based on some computational experiments comparing different mathematical programming solvers when applying controlled rounding to tabular data. 1 Introduction Statistical agencies must guarantee confidentiality of data respondent by using the best of modern technology. Today data snoopers may have powerful computers, thus statistical agencies need sophisticated computer programs to ensure that released information is protected against attackers. Recent research has designed different optimization techniques that ensure protection. Unfortunately the number of users of these techniques is quite small (mainly national and regional statistical agencies), thus there is not enough market to stimulate the development of several implementations, all competing for being the best.
    [Show full text]
  • Chipps Framework Applications Results and Conclusions
    Introduction The CHiPPS Framework Applications Results and Conclusions The COIN-OR High-Performance Parallel Search Framework (CHiPPS) TED RALPHS LEHIGH UNIVERSITY YAN XU SAS INSTITUTE CPAIOR, June 15, 2010 Thanks: Work supported in part by the National Science Foundation and IBM Ralphs& Xu CHiPPS Introduction The CHiPPS Framework Applications Results and Conclusions Outline 1 Introduction Tree Search Algorithms Parallel Computing Previous Work 2 The CHiPPS Framework Introduction ALPS: Abstract Library For Parallel Search BiCePS: Branch, Constrain, and Price Software BLIS: BiCePS Linear Integer Solver 3 Applications Knapsack Problem Vehicle Routing 4 Results and Conclusions Ralphs& Xu CHiPPS Introduction Tree Search Algorithms The CHiPPS Framework Parallel Computing Applications Previous Work Results and Conclusions Tree Search Algorithms Tree search algorithms systematically search the nodes of an acyclic graph for certain goal nodes. Root Initial State Goal State Tree search algorithms have been applied in many areas such as Constraint satisfaction, Game search, Constraint Programming, and Mathematical programming. Ralphs& Xu CHiPPS Introduction Tree Search Algorithms The CHiPPS Framework Parallel Computing Applications Previous Work Results and Conclusions Elements of Tree Search Algorithms A generic tree search algorithm consists of the following elements: Generic Tree Search Algorithm Processing method: Is this a goal node? Fathoming rule: Can node can be fathomed? Branching method: What are the successors of this node? Search strategy: What should we work on next? The algorithm consists of choosing a candidate node, processing it, and either fathoming or branching. During the course of the search, various information (knowledge) is generated and can be used to guide the search. Ralphs& Xu CHiPPS Introduction Tree Search Algorithms The CHiPPS Framework Parallel Computing Applications Previous Work Results and Conclusions Parallelizing Tree Search Algorithms In general, the search tree can be very large.
    [Show full text]
  • CME 338 Large-Scale Numerical Optimization Notes 2
    Stanford University, ICME CME 338 Large-Scale Numerical Optimization Instructor: Michael Saunders Spring 2019 Notes 2: Overview of Optimization Software 1 Optimization problems We study optimization problems involving linear and nonlinear constraints: NP minimize φ(x) n x2R 0 x 1 subject to ` ≤ @ Ax A ≤ u; c(x) where φ(x) is a linear or nonlinear objective function, A is a sparse matrix, c(x) is a vector of nonlinear constraint functions ci(x), and ` and u are vectors of lower and upper bounds. We assume the functions φ(x) and ci(x) are smooth: they are continuous and have continuous first derivatives (gradients). Sometimes gradients are not available (or too expensive) and we use finite difference approximations. Sometimes we need second derivatives. We study algorithms that find a local optimum for problem NP. Some examples follow. If there are many local optima, the starting point is important. x LP Linear Programming min cTx subject to ` ≤ ≤ u Ax MINOS, SNOPT, SQOPT LSSOL, QPOPT, NPSOL (dense) CPLEX, Gurobi, LOQO, HOPDM, MOSEK, XPRESS CLP, lp solve, SoPlex (open source solvers [7, 34, 57]) x QP Quadratic Programming min cTx + 1 xTHx subject to ` ≤ ≤ u 2 Ax MINOS, SQOPT, SNOPT, QPBLUR LSSOL (H = BTB, least squares), QPOPT (H indefinite) CLP, CPLEX, Gurobi, LANCELOT, LOQO, MOSEK BC Bound Constraints min φ(x) subject to ` ≤ x ≤ u MINOS, SNOPT LANCELOT, L-BFGS-B x LC Linear Constraints min φ(x) subject to ` ≤ ≤ u Ax MINOS, SNOPT, NPSOL 0 x 1 NC Nonlinear Constraints min φ(x) subject to ` ≤ @ Ax A ≤ u MINOS, SNOPT, NPSOL c(x) CONOPT, LANCELOT Filter, KNITRO, LOQO (second derivatives) IPOPT (open source solver [30]) Algorithms for finding local optima are used to construct algorithms for more complex optimization problems: stochastic, nonsmooth, global, mixed integer.
    [Show full text]
  • Financial Analysts
    Operations Research Analysts Financial Analysts TORQ Analysis of Operations Research Analysts to Financial Analysts INPUT SECTION: Transfer Title O*NET Filters Operations Research Importance LeveL: Weight: From Title: 15-2031.00 Abilities: Analysts 50 1 Importance LeveL: Weight: To Title: Financial Analysts 13-2051.00 Skills: 69 1 Labor Market Weight: Maine Statewide Knowledge: Importance Level: 69 Area: 1 OUTPUT SECTION: Grand TORQ: 83 Ability TORQ Skills TORQ Knowledge TORQ Level Level Level 96 81 71 Gaps To Narrow if Possible Upgrade These Skills Knowledge to Add Ability Level Gap Impt Skill Level Gap Impt Knowledge Level Gap Impt Near Vision 59 6 65 Management Economics Speech of Financial 74 20 77 and 79 31 89 46 4 62 Recognition Resources Accounting Time English 70 11 87 70 17 83 Management Language Monitoring 70 7 70 LEVEL and IMPT (IMPORTANCE) refer to the Target Financial Analysts. GAP refers to level difference between Operations Research Analysts and Financial Analysts. ASK ANALYSIS Ability Level Comparison - Abilities with importance scores over 50 Operations Research Description Analysts Financial Analysts Importance Written Comprehension 64 62 78 Oral Comprehension 64 59 75 Oral Expression 64 60 75 Written Expression 62 59 75 Deductive Reasoning 62 62 72 Inductive Reasoning 60 51 68 Near Vision 53 59 65 TORQ Analysis Page 1 of 13. Copyright 2009. Workforce Associates, Inc. Operations Research Analysts Financial Analysts Speech Clarity 46 46 65 Problem Sensitivity 57 55 62 Number Facility 66 55 62 Speech Recognition 42 46
    [Show full text]
  • INTERIOR-POINT LINEAR PROGRAMMING SOLVERS We Present an Overview of Available Software for Solving Linear Programming Problems U
    INTERIOR-POINT LINEAR PROGRAMMING SOLVERS HANDE Y. BENSON Abstract. We present an overview of available software for solving linear pro- gramming problems using interior-point methods. Some of the codes discussed include primal and dual simplex solvers as well, but we focus the discussion on the implementation of the interior-point solver. For each solver, we present types of problems solved, available distribution modes, input formats and mod- eling languages, as well as algorithmic details, including problem formulation, use of higher corrections, presolve techniques, ordering heuristics for symbolic Cholesky factorization, and the specifics of numerical factorization. We present an overview of available software for solving linear programming problems using interior-point methods. We consider both open-source and pro- prietary commercial codes, including BPMPD ([37], [36]), CLP [16], FortMP [15], GIPALS32 [45], GLPK [34], HOPDM ([24], [28]), IBM ILOG CPLEX [30], LINDO [31], LIPSOL [49], LOQO [48], Microsoft Solver Foundation [38], MOSEK [2], PCx [13], SAS/OR [44], and Xpress Optimizer [43]. Some of the codes discussed include primal and dual simplex solvers as well, but we focus the discussion on the implementation of the interior-point solver. For each solver, we present types of problems solved, available distribution modes, input formats and modeling languages, as well as algorithmic details, including problem formulation, use of higher corrections, presolve techniques, ordering heuristics for symbolic Cholesky factorization, and the specifics of numerical factorization. Many of the solvers allow user-control over some algorithmic details such as the type of presolve techniques applied to the problem and the choice of ordering heuristic. As the following discussion will show, the solvers tend to all have similar charac- teristics, and performance differences are generally due to subtle changes in the presolve phase, the implementation of the linear algebra routines, and other special considerations, such as scaling, to promote numerical stability.
    [Show full text]
  • The TOMLAB Optimization Environment in Matlab1
    AMO - Advanced Modeling and Optimization Volume 1, Number 1, 1999 The TOMLAB Optimization Environment in Matlab Kenneth Holmstrom Center for Mathematical Mo deling Department of Mathematics and Physics Malardalen University PO Box SE Vasteras Sweden Abstract TOMLAB is a general purp ose op en and integrated Matlab development environment for research and teaching in optimization on Unix and PC systems One motivation for TOMLAB is to simplify research on practical optimization problems giving easy access to all types of solvers at the same time having full access to the p ower of Matlab The design principle is dene your problem once optimize using any suitable solver In this pap er we discuss the design and contents of TOMLAB as well as some applications where TOMLAB has b een successfully applied TOMLAB is based on NLPLIB TB a Matlab to olb ox for nonlinear programming and pa rameter estimation and OPERA TB a Matlab to olb ox for linear and discrete optimization More than dierent algorithms and graphical utilities are implemented It is p ossible to call solvers in the Matlab Optimization Toolb ox and generalpurp ose solvers implemented in For tran or C using a MEXle interface Currently MEXle interfaces have b een developed for MINOS NPSOL NPOPT NLSSOL LPOPT QPOPT and LSSOL A problem is solved by a direct call to a solver or by a general multisolver driver routine or interactively using a graphical user interface GUI or a menu system If analytical derivatives are not available automatic dierentiation is easy using an interface
    [Show full text]