Study of the Paper Efficient AC Optimal Power Flow and Global Optimizer Solutions. Yuyang Chen
|
|
- Annabelle Whitehead
- 5 years ago
- Views:
Transcription
1 Study of the Paper Efficient AC Optimal Power Flow and Global Optimizer Solutions Yuyang Chen
2 Presentation Agenda Theoretical background Study 0. Background Introduction 1. SDP relaxation 2. D&C method ( angular cut + voltage magnitude cut) 3. Result comparison with MATPOWER Code package study 0. Parallel &distributed computing with openmp, case study. Suggestions On further work 0. Stop exploring a branch base on the distance between parent variable bisect points and parent SDP solution points. Instead of base on SDP solution on child nodes, ( potentially save 4 SDP calculation cycle at each generation that is about to branch in this study)
3 0. Background Introduction OPF as a historical Non-Conex QCQP. (introduced by Carpenter in 1962) Currently, many approaches has been tried: 1) Bai propose Semidefinite Programming(SDP) relaxation for ACOPF. X. Bai, H. Wei, K. Fujisawa, and Y. Wang. Semidefinite programming for optimal power flow problems. Int J Elect Power Energy Syst, vol. 30, no. 6 7, pp , Avoidance of NLP OPF s Jacobian matrices and Hessian matrices computing and convergence problem. - the method Itself does not guarantee rank-1 global solution. It s been studied that If the result does not satisfied a low rank requirement, then it is physically meaningless in where the optimal global solution is. - several studies followed, the only thing has been proven for SDP-OPF is that SDP s relaxed Convex feasible region always cover the non convex feasible region of the original OPF.
4 0. Background Introduction (continued) 2) Gopalakrishnan proposed Branched and Bound method combining with SDP A. Gopalakrishnan, et. al., Global optimization of optimal power flow using a branch and bound algorithm, in Communication, Control, and Computing, Allerton, pp , Bisecting Voltage Magnitude, p,q in a nonconvex quadratic constraint problem may not be the best way.
5 0. Background Introduction (continued) 3) In this Paper Efficient AC Optimal Power Flow and Global Optimizer Solutions Zhe Hu, Gokturk Poyrazoglu, Student Member, IEEE, and HyungSeon Oh, Member, IEEE - Provided a solver that guarantee to find Global Optimum in OPF, if exists. - Utilization of D&C method that includes angular cuts and Voltage magnitude cuts from the solution of SDP. - It avoids including parent node solution in the child node to save time. - It avoids further exploring unworthy nodes to improved efficiency. - Recommended parallelism for algorithm implementation.
6 1. SDP relaxation (general form)
7 1. SDP relaxation (OPF)
8 1. SDP relaxation (OPF)
9 1. SDP relaxation (OPF) effect
10 1. SDP relaxation (OPF) adds voltage angle constrain
11 2.D&C method ( angular cut + voltage magnitude cut)
12 2.D&C method ( angular cut + voltage magnitude cut) effect
13 Summary & Programming Flow
14 Result comparison with MATPOWER From IEEE case 14 study, this algorithm yields lower cost than MATPOWER s $ /h
15 Code package study 0. Parrallel &distributed computing with open-mpi, case study. } Solve
16 Ideas On further work 0.relative difference D contains information about the sub region. The closer SDP point to Bisect point, the more balance this region is relative to bisect point. The Further away SDP point to Bisect point, the less balance this region is relative to bisect point. At some D>=a, we can give up the feasible region to the right of Bisect point. Point of Bisection is an Arbitrary reference Is there a universal D that can be use to eliminate unworthy sub region?
ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 7, Issue 1, July 2017
Congestion Management in Deregulated Power System Using Market Splitting Based Approach Manish Harchand 1, KanwardeepSingh 2 M.Tech student 1, Associate professor 2 Department of Electrical Engineering,
More informationMulti-area Nonlinear State Estimation using Distributed Semidefinite Programming
October 15, 2012 Multi-area Nonlinear State Estimation using Distributed Semidefinite Programming Hao Zhu haozhu@illinois.edu Acknowledgements: Prof. G. B. Giannakis, U of MN Doctoral Dissertation Fellowship
More informationConstrained optimization
Constrained optimization Problem in standard form minimize f(x) subject to a i (x) = 0, for i =1, 2, p c j (x) 0 for j =1, 2,,q f : R n R a i : R n R c j : R n R f(x )=, if problem is infeasible f(x )=,
More informationOptimal Proxy-Limited Lines for Representing Voltage Constraints in a DC Optimal Powerflow
Optimal Proxy-Limited Lines for Representing Voltage Constraints in a DC Optimal Powerflow by Michael Schlindwein A thesis submitted in fulfillment of the requirements for the degree of Master of Science
More informationAn Approximated Linear Optimal Power Flow Framework for Power System Operation and Planning. WP 2.2: Markets
An Approximated Linear Optimal Power Flow Framework for Power System Operation and Planning WP 2.2: Markets Philipp Fortenbacher 2.11.2017 1 Outline Project Overview Linear/ Quadratic Programming Based
More informationJavad Lavaei. Department of Electrical Engineering Columbia University
Graph Theoretic Algorithm for Nonlinear Power Optimization Problems Javad Lavaei Department of Electrical Engineering Columbia University Joint work with: Ramtin Madani, Ghazal Fazelnia and Abdulrahman
More informationMixed-Integer SOCP in optimal contribution selection of tree breeding
Mixed-Integer SOCP in optimal contribution selection of tree breeding Makoto Yamashita (Tokyo Institute of Technology) Sena Safarina (Tokyo Institute of Technology) Tim J. Mullin (Forestry Research Institute
More informationJavad Lavaei. Graph-theoretic Algorithm for Nonlinear Power Optimization Problems. Department of Electrical Engineering Columbia University
Graph-theoretic Algorithm for Nonlinear Power Optimization Problems Javad Lavaei Department of Electrical Engineering Columbia University Joint work with Ramtin Madani, Somayeh Sojoudi, Ghazal Fazelnia
More informationLECTURE NOTES Non-Linear Programming
CEE 6110 David Rosenberg p. 1 Learning Objectives LECTURE NOTES Non-Linear Programming 1. Write out the non-linear model formulation 2. Describe the difficulties of solving a non-linear programming model
More informationB553 Lecture 12: Global Optimization
B553 Lecture 12: Global Optimization Kris Hauser February 20, 2012 Most of the techniques we have examined in prior lectures only deal with local optimization, so that we can only guarantee convergence
More informationLocal and Global Minimum
Local and Global Minimum Stationary Point. From elementary calculus, a single variable function has a stationary point at if the derivative vanishes at, i.e., 0. Graphically, the slope of the function
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing
More informationThe AIMMS Outer Approximation Algorithm for MINLP
The AIMMS Outer Approximation Algorithm for MINLP (using GMP functionality) By Marcel Hunting marcel.hunting@aimms.com November 2011 This document describes how to use the GMP variant of the AIMMS Outer
More informationA NEW SEQUENTIAL CUTTING PLANE ALGORITHM FOR SOLVING MIXED INTEGER NONLINEAR PROGRAMMING PROBLEMS
EVOLUTIONARY METHODS FOR DESIGN, OPTIMIZATION AND CONTROL P. Neittaanmäki, J. Périaux and T. Tuovinen (Eds.) c CIMNE, Barcelona, Spain 2007 A NEW SEQUENTIAL CUTTING PLANE ALGORITHM FOR SOLVING MIXED INTEGER
More informationStochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition
Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition Xiang Li Process Systems Engineering Laboratory Department of Chemical Engineering Massachusetts
More informationLogic Synthesis for Energy-Efficient Photonic Integrated Circuits
リレーションシップ ID rid4 のイメージパーツがファイルにありませんでした Logic Synthesis for Energy-Efficient Photonic Integrated Circuits Zheng Zhao, Zheng Wang, Zhoufeng Ying, Shounak Dhar, Ray T. Chen, and David Z. Pan Dept. of Electrical
More informationThe AIMMS Outer Approximation Algorithm for MINLP
The AIMMS Outer Approximation Algorithm for MINLP (using GMP functionality) By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper November, 2011 Abstract This document describes how to
More informationAggregation of Buses for a Network Reduction HyungSeon Oh, Member, IEEE
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 27, NO. 2, MAY 2012 705 Aggregation of Buses a Network Reduction HyungSeon Oh, Member, IEEE Abstract A simple but precise model would improve the computation efficiency
More informationGraph-Theoretic Convexification of Polynomial Optimization Problems: Theory and Applications Javad Lavaei
Graph-Theoretic Convexification of Polynomial Optimization Problems: Theory and Applications Javad Lavaei Department of Electrical Engineering Columbia University 1 Polynomial Optimization Polynomial Optimization:
More informationA Spectral Bisection Partitioning Method for Electric Power Network Applications *
A Spectral Bisection Partitioning Method for Electric Power Network Applications * Supun Tiptipakorn Department of Electrical and Computer Engineering University of Wisconsin Madison 1415 Engineering Drive;
More informationThree-Dimensional Aircraft Path Planning based on Nonconvex Quadratic Optimization
Three-Dimensional Aircraft Path Planning based on Nonconvex Quadratic Optimization Ran Dai Abstract In this paper, we examine the three-dimensional aircraft path planning problems under field-of-view constraints
More informationResearch Interests Optimization:
Mitchell: Research interests 1 Research Interests Optimization: looking for the best solution from among a number of candidates. Prototypical optimization problem: min f(x) subject to g(x) 0 x X IR n Here,
More informationLec13p1, ORF363/COS323
Lec13 Page 1 Lec13p1, ORF363/COS323 This lecture: Semidefinite programming (SDP) Definition and basic properties Review of positive semidefinite matrices SDP duality SDP relaxations for nonconvex optimization
More informationSmart Grid Application of Optimal Transmission Switching
Smart Grid Application of Optimal Transmission Switching By, Kory W. Hedman, et al.* University of California, Berkeley INFORMS Annual Meeting Washington, DC October 15, 2008 *Dr. Richard P. O Neill (Chief
More informationOptimal Location and Size of Distributed Energy Resources Using Sensitivity Analysis-Based Approaches
Optimal Location and Size of Distributed Energy Resources Using Sensitivity Analysis-Based Approaches Mohammed Benidris Electrical & Biomedical Engineering University of Nevada, Reno Reno, NV 89557, USA
More informationContents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited.
page v Preface xiii I Basics 1 1 Optimization Models 3 1.1 Introduction... 3 1.2 Optimization: An Informal Introduction... 4 1.3 Linear Equations... 7 1.4 Linear Optimization... 10 Exercises... 12 1.5
More informationDiscrete Optimization with Decision Diagrams
Discrete Optimization with Decision Diagrams J. N. Hooker Joint work with David Bergman, André Ciré, Willem van Hoeve Carnegie Mellon University Australian OR Society, May 2014 Goal Find an alternative
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
More informationA Brief Look at Optimization
A Brief Look at Optimization CSC 412/2506 Tutorial David Madras January 18, 2018 Slides adapted from last year s version Overview Introduction Classes of optimization problems Linear programming Steepest
More informationTowards Efficient Higher-Order Semidefinite Relaxations for Max-Cut
Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Energy Institute Joint work with E. Adams (Poly Mtl), F. Rendl,
More informationEECS 571 Principles of Real-Time Embedded Systems. Lecture Note #8: Task Assignment and Scheduling on Multiprocessor Systems
EECS 571 Principles of Real-Time Embedded Systems Lecture Note #8: Task Assignment and Scheduling on Multiprocessor Systems Kang G. Shin EECS Department University of Michigan What Have We Done So Far?
More informationBilinear Programming
Bilinear Programming Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida 32611-6595 Email address: artyom@ufl.edu
More informationML Detection via SDP Relaxation
ML Detection via SDP Relaxation Junxiao Song and Daniel P. Palomar The Hong Kong University of Science and Technology (HKUST) ELEC 5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture
More informationCasADi tutorial Introduction
Lund, 6 December 2011 CasADi tutorial Introduction Joel Andersson Department of Electrical Engineering (ESAT-SCD) & Optimization in Engineering Center (OPTEC) Katholieke Universiteit Leuven OPTEC (ESAT
More informationCHAPTER 2 MULTI-OBJECTIVE REACTIVE POWER OPTIMIZATION
19 CHAPTER 2 MULTI-OBJECTIE REACTIE POWER OPTIMIZATION 2.1 INTRODUCTION In this chapter, a fundamental knowledge of the Multi-Objective Optimization (MOO) problem and the methods to solve are presented.
More informationA parallel interior point decomposition algorithm for block angular semidefinite programs
A parallel interior point decomposition algorithm for block angular semidefinite programs Kartik Krishnan Sivaramakrishnan 1 Department of Mathematics North Carolina State University Raleigh, NC 27695-8205
More informationJane Li. Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute
Jane Li Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute (3 pts) Compare the testing methods for testing path segment and finding first
More informationA Brief Overview of Optimization Problems. Steven G. Johnson MIT course , Fall 2008
A Brief Overview of Optimization Problems Steven G. Johnson MIT course 18.335, Fall 2008 Why optimization? In some sense, all engineering design is optimization: choosing design parameters to improve some
More informationLECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION. 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach
LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach Basic approaches I. Primal Approach - Feasible Direction
More informationReformulations in Mathematical Programming: A Computational Approach
Reformulations in Mathematical Programming: A Computational Approach Leo Liberti, Sonia Cafieri, and Fabien Tarissan LIX, École Polytechnique, Palaiseau, 91128 France {liberti,cafieri,tarissan}@lix.polytechnique.fr
More informationSimulated Annealing Method for Regional Analysis
Simulated Annealing Method for Regional Analysis JAN PANUS, STANISLAVA SIMONOVA Institute of System Engineering and Informatics University of Pardubice Studentská 84, 532 10 Pardubice CZECH REPUBLIC http://www.upce.cz
More informationFalse Analog Data Injection Attack Towards Topology Errors: Formulation and Feasibility Analysis
False Analog Data Injection Attack Towards Topology Errors: Formulation and Feasibility Analysis Yuqi Zhou, Jorge Cisneros-Saldana, Le Xie Department of Electrical and Computer Engineering Texas A&M University
More informationBilinear Modeling Solution Approach for Fixed Charged Network Flow Problems (Draft)
Bilinear Modeling Solution Approach for Fixed Charged Network Flow Problems (Draft) Steffen Rebennack 1, Artyom Nahapetyan 2, Panos M. Pardalos 1 1 Department of Industrial & Systems Engineering, Center
More informationCombinatorial meets Convex Leveraging combinatorial structure to obtain faster algorithms, provably
Combinatorial meets Convex Leveraging combinatorial structure to obtain faster algorithms, provably Lorenzo Orecchia Department of Computer Science 6/30/15 Challenges in Optimization for Data Science 1
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
CSC411 - Linear Programming and Combinatorial Optimization Lecture 1: Semidefinite Programming(SDP) Relaxation Notes taken by Xinwei Gui May 1, 007 Summary: This lecture introduces the semidefinite programming(sdp)
More informationCAD & Computational Geometry Course plan
Course plan Introduction Segment-Segment intersections Polygon Triangulation Intro to Voronoï Diagrams & Geometric Search Sweeping algorithm for Voronoï Diagrams 1 Voronoi Diagrams Voronoi Diagrams or
More information13. Cones and semidefinite constraints
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 13. Cones and semidefinite constraints ˆ Geometry of cones ˆ Second order cone programs ˆ Example: robust linear program ˆ Semidefinite constraints
More information1 Unweighted Set Cover
Comp 60: Advanced Algorithms Tufts University, Spring 018 Prof. Lenore Cowen Scribe: Yuelin Liu Lecture 7: Approximation Algorithms: Set Cover and Max Cut 1 Unweighted Set Cover 1.1 Formulations There
More informationSolving the Euclidean Steiner Tree Problem in n-space
Solving the Euclidean Steiner Tree Problem in n-space Marcia Fampa (UFRJ), Jon Lee (U. Michigan), and Wendel Melo (UFRJ) January 2015 Marcia Fampa, Jon Lee, Wendel Melo Solving the Euclidean Steiner Tree
More informationConvex Algebraic Geometry
, North Carolina State University What is convex algebraic geometry? Convex algebraic geometry is the study of convex semialgebraic objects, especially those arising in optimization and statistics. What
More informationA Novel Approach for the Optimal PMU Placement using Binary Integer Programming Technique
A Novel Approach for the Optimal PMU Placement using Binary Integer Programming Technique J. S. Bhonsle 1 & A. S. Junghare 2 1 Department of Electrical Engg., Priyadarshini Institute of Engineering & Technology,
More informationA Brief Overview of Optimization Problems. Steven G. Johnson MIT course , Fall 2008
A Brief Overview of Optimization Problems Steven G. Johnson MIT course 18.335, Fall 2008 Why optimization? In some sense, all engineering design is optimization: choosing design parameters to improve some
More informationIntroduction. Chapter 15. Optimization Modeling: Applications. Integer Programming. Manufacturing Example. Three Types of ILP Models
Chapter 5 Optimization Modeling: Applications Integer Programming Introduction When one or more variables in an LP problem must assume an integer value we have an Integer Linear Programming (ILP) problem.
More informationRe-Dispatching Generation to Increase Power System Security Margin and Support Low Voltage Bus
496 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 Re-Dispatching Generation to Increase Power System Security Margin and Support Low Voltage Bus Ronghai Wang, Student Member, IEEE, and Robert
More informationcontrol polytope. These points are manipulated by a descent method to compute a candidate global minimizer. The second method is described in Section
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex Ivo Nowak September 3, 1998 Keywords:global optimization, nonconvex quadratic programming, heuristics, Bezier methods,
More informationFast Low-Rank Semidefinite Programming for Embedding and Clustering
Fast Low-Rank Semidefinite Programming for Embedding and Clustering Brian Kulis Department of Computer Sciences University of Texas at Austin Austin, TX 78759 USA kulis@cs.utexas.edu Arun C. Surendran
More informationDistributed and Large-Scale Optimization. Abdulrahman Kalbat
Distributed and Large-Scale Optimization Abdulrahman Kalbat Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA
More informationOptimization on manifolds and semidefinite relaxations
Optimization on manifolds and semidefinite relaxations Nicolas Boumal Princeton University Based on work with Pierre-Antoine Absil, Afonso Bandeira, Coralia Cartis and Vladislav Voroninski 1 Max-Cut relaxation
More information2. Optimization problems 6
6 2.1 Examples... 7... 8 2.3 Convex sets and functions... 9 2.4 Convex optimization problems... 10 2.1 Examples 7-1 An (NP-) optimization problem P 0 is defined as follows Each instance I P 0 has a feasibility
More informationONLINE CLOSED-LOOP OPTIMIZATION OF DISTRIBUTION NETWORKS
ONLINE CLOSED-LOOP OPTIMIZATION OF DISTRIBUTION NETWORKS Werner FEILHAUER Michael HEINE Andreas SCHMIDT PSI AG, EE DE PSI AG, EE DE PSI AG, EE - DE wfeilhauer@psi.de mheine@psi.de aschmidt@psi.de ABSTRACT
More informationConvex Optimization. Lijun Zhang Modification of
Convex Optimization Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Modification of http://stanford.edu/~boyd/cvxbook/bv_cvxslides.pdf Outline Introduction Convex Sets & Functions Convex Optimization
More informationSurrogate Gradient Algorithm for Lagrangian Relaxation 1,2
Surrogate Gradient Algorithm for Lagrangian Relaxation 1,2 X. Zhao 3, P. B. Luh 4, and J. Wang 5 Communicated by W.B. Gong and D. D. Yao 1 This paper is dedicated to Professor Yu-Chi Ho for his 65th birthday.
More informationAn SDP Approach to Multi-level Crossing Minimization
An SDP Approach to Multi-level Crossing Minimization P. Hungerländer joint work with M. Chimani, M. Jünger, P. Mutzel University of Klagenfurt - Department of Mathematics 15th Combinatorial Optimization
More informationTriangulation: A new algorithm for Inverse Kinematics
Triangulation: A new algorithm for Inverse Kinematics R. Müller-Cajar 1, R. Mukundan 1, 1 University of Canterbury, Dept. Computer Science & Software Engineering. Email: rdc32@student.canterbury.ac.nz
More informationApproximation in Linear Stochastic Programming Using L-Shaped Method
Approximation in Linear Stochastic Programming Using L-Shaped Method Liza Setyaning Pertiwi 1, Rini Purwanti 2, Wilma Handayani 3, Prof. Dr. Herman Mawengkang 4 1,2,3,4 University of North Sumatra, Indonesia
More informationTHE Optimal Power Flow (OPF) problem was introduced
1690 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 22, NO. 4, NOVEMBER 2007 Contingency Filtering Techniques for Preventive Security-Constrained Optimal Power Flow Florin Capitanescu, Mevludin Glavic, Senior
More informationDavid G. Luenberger Yinyu Ye. Linear and Nonlinear. Programming. Fourth Edition. ö Springer
David G. Luenberger Yinyu Ye Linear and Nonlinear Programming Fourth Edition ö Springer Contents 1 Introduction 1 1.1 Optimization 1 1.2 Types of Problems 2 1.3 Size of Problems 5 1.4 Iterative Algorithms
More informationDiscriminative Clustering for Image Co-segmentation
Discriminative Clustering for Image Co-segmentation Armand Joulin 1,2 Francis Bach 1,2 Jean Ponce 2 1 INRIA 2 Ecole Normale Supérieure January 15, 2010 Introduction Introduction problem: dividing simultaneously
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationLP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008
LP-Modelling dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven January 30, 2008 1 Linear and Integer Programming After a brief check with the backgrounds of the participants it seems that the following
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More information3.6.2 Generating admissible heuristics from relaxed problems
3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The
More informationSelected Topics in Column Generation
Selected Topics in Column Generation February 1, 2007 Choosing a solver for the Master Solve in the dual space(kelly s method) by applying a cutting plane algorithm In the bundle method(lemarechal), a
More informationTopology Optimization and JuMP
Immense Potential and Challenges School of Engineering and Information Technology UNSW Canberra June 28, 2018 Introduction About Me First year PhD student at UNSW Canberra Multidisciplinary design optimization
More informationLaGO - A solver for mixed integer nonlinear programming
LaGO - A solver for mixed integer nonlinear programming Ivo Nowak June 1 2005 Problem formulation MINLP: min f(x, y) s.t. g(x, y) 0 h(x, y) = 0 x [x, x] y [y, y] integer MINLP: - n
More informationLinear Programming. them such that they
Linear Programming l Another "Sledgehammer" in our toolkit l Many problems fit into the Linear Programming approach l These are optimization tasks where both the constraints and the objective are linear
More informationIntroduction to optimization
Introduction to optimization G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Optimization Industrial
More informationIE598 Big Data Optimization Summary Nonconvex Optimization
IE598 Big Data Optimization Summary Nonconvex Optimization Instructor: Niao He April 16, 2018 1 This Course Big Data Optimization Explore modern optimization theories, algorithms, and big data applications
More informationCONLIN & MMA solvers. Pierre DUYSINX LTAS Automotive Engineering Academic year
CONLIN & MMA solvers Pierre DUYSINX LTAS Automotive Engineering Academic year 2018-2019 1 CONLIN METHOD 2 LAY-OUT CONLIN SUBPROBLEMS DUAL METHOD APPROACH FOR CONLIN SUBPROBLEMS SEQUENTIAL QUADRATIC PROGRAMMING
More informationSolving Traveling Salesman Problem on High Performance Computing using Message Passing Interface
Solving Traveling Salesman Problem on High Performance Computing using Message Passing Interface IZZATDIN A. AZIZ, NAZLEENI HARON, MAZLINA MEHAT, LOW TAN JUNG, AISYAH NABILAH Computer and Information Sciences
More informationResearch Subject. Dynamics Computation and Behavior Capture of Human Figures (Nakamura Group)
Research Subject Dynamics Computation and Behavior Capture of Human Figures (Nakamura Group) (1) Goal and summary Introduction Humanoid has less actuators than its movable degrees of freedom (DOF) which
More informationPowerWorld Tutorial. Yen-Yu Lee The University of Texas at Austin Jan 18, Updated December 26, 2012, by Ross Baldick
PowerWorld Tutorial Yen-Yu Lee The University of Texas at Austin Jan 18, 2010 Updated December 26, 2012, by Ross Baldick 1 Introduction PowerWorld is one of the most popular power system simulation tools.
More informationOutlier Pursuit: Robust PCA and Collaborative Filtering
Outlier Pursuit: Robust PCA and Collaborative Filtering Huan Xu Dept. of Mechanical Engineering & Dept. of Mathematics National University of Singapore Joint w/ Constantine Caramanis, Yudong Chen, Sujay
More information2.1. Fixture Verification
Chapter 2. Literature Review This chapter gives a review of literature related to this work. First the literature related to general fixture verification is reviewed, and then literature in each of the
More informationMINLPB4: A Fortran Subroutine for Mixed-Integer Nonlinear Optimization by Branch-and-Bound 1 - User s Guide -
MINLPB4: A Fortran Subroutine for Mixed-Integer Nonlinear Optimization by Branch-and-Bound 1 - User s Guide - Oliver Exler, Thomas Lehmann, Klaus Schittkowski Address: Department of omputer Science University
More informationXpress NonLinear. Manual. Release version FICO TM Xpress Optimization Suite. Last update 30 October,
FICO TM Xpress Optimization Suite Xpress NonLinear Manual Release version 27.01 Last update 30 October, 2014 www.fico.com Make every decision count TM This document is the confidential, proprietary, and
More informationA Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs Juan Pablo Vielma Shabbir Ahmed George L. Nemhauser H. Milton Stewart School of Industrial and Systems
More informationParallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece
Parallel Computation of Spherical Parameterizations for Mesh Analysis Th. Athanasiadis and I. Fudos, Greece Introduction Mesh parameterization is a powerful geometry processing tool Applications Remeshing
More informationUnconstrained Optimization Principles of Unconstrained Optimization Search Methods
1 Nonlinear Programming Types of Nonlinear Programs (NLP) Convexity and Convex Programs NLP Solutions Unconstrained Optimization Principles of Unconstrained Optimization Search Methods Constrained Optimization
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer
More informationAC : AN ANALOG POWER SYSTEM EMULATOR AS A LABORATORY TOOL FOR TEACHING ELECTRIC POWER SYSTEMS
AC 2009-1464: AN ANALOG POWER SYSTEM EMULATOR AS A LABORATORY TOOL FOR TEACHING ELECTRIC POWER SYSTEMS Aaron St. Leger, United States Military Academy Anthony Deese, Drexel University Chikaodinaka Nwankpa,
More informationVectorization Using Stochastic Local Search
Vectorization Using Stochastic Local Search Byron Knoll CPSC303, University of British Columbia March 29, 2009 Abstract: Stochastic local search can be used for the process of vectorization. In this project,
More informationRevisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization. Author: Martin Jaggi Presenter: Zhongxing Peng
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization Author: Martin Jaggi Presenter: Zhongxing Peng Outline 1. Theoretical Results 2. Applications Outline 1. Theoretical Results 2. Applications
More informationIndex. affine dependency, 133 minimal, 133 affine hull, 392 affinely independent, 393 α-bb, 230, 258, 297 approximate solutions, 9 approximation, 86
Index affine dependency, 133 minimal, 133 affine hull, 392 affinely independent, 393 α-bb, 230, 258, 297 approximate solutions, 9 approximation, 86 AP X, 10 aspiration level, 86, 110 atomic clusters, 372
More informationLaGO. Ivo Nowak and Stefan Vigerske. Humboldt-University Berlin, Department of Mathematics
LaGO a Branch and Cut framework for nonconvex MINLPs Ivo Nowak and Humboldt-University Berlin, Department of Mathematics EURO XXI, July 5, 2006 21st European Conference on Operational Research, Reykjavik
More informationAnalysis of Algorithms
Analysis of Algorithms Concept Exam Code: 16 All questions are weighted equally. Assume worst case behavior and sufficiently large input sizes unless otherwise specified. Strong induction Consider this
More informationOptimization. Industrial AI Lab.
Optimization Industrial AI Lab. Optimization An important tool in 1) Engineering problem solving and 2) Decision science People optimize Nature optimizes 2 Optimization People optimize (source: http://nautil.us/blog/to-save-drowning-people-ask-yourself-what-would-light-do)
More informationGeometry and Statistics in High-Dimensional Structured Optimization
Geometry and Statistics in High-Dimensional Structured Optimization Yuanming Shi ShanghaiTech University 1 Outline Motivations Issues on computation, storage, nonconvexity, Two Vignettes: Structured Sparse
More information