t 2 t 1 Discrete order of arrival: deciding the order Now, every time you see an absolute value Tranformation of an «or» into an «and»

Size: px
Start display at page:

Download "t 2 t 1 Discrete order of arrival: deciding the order Now, every time you see an absolute value Tranformation of an «or» into an «and»"

Transcription

1 1 Lecture 7: Using MILP to solve decision problems Graphical interpretation of decision problems Some variables are on a grid, some are not: Decision problems Absolute values ransfmation of a logical into a logical and A fmal definition of MILP Example: holding Posing the number of holding as a MILP A real example from Air raffic Control Order of arrival of 2 Order of arrival of 1 he solution f these two variables has to be on the grid. t 1 It does not matter where the solution f these two variables is Discrete der of arrival: deciding the der First kind of decision variables: der of arrival Now, every you see an absolute value Absolute value: not linear, not affine difficult t 1 OR t 1 Absolute value can be expressed as a logical disjunction (this is just a fancy way to say ). OR Another way to express this: «and» is easy, is difficult ranfmation of an into an «and» Reminder: you have already used «and» many s Let us pick a very large number Let us pick a decision variable he two following statements are equivalent: All these are logical and and

2 2

3 3 Summary Summary Depending on the value of d: ranfmation of an into an «and» Let us pick a very large number Let us pick a decision variable he two following statements are equivalent: and In other wds ranfmation of an into an «and» Why is it useful? Now you can pose the problem of earliest arrival of the last with decision enabled f der of arrival: you can deal with continuous and discrete variables. and t1 if d=1, t2 if d=0 OR t 1 t 1

4 4 Why is it useful? Now you can pose the problem of earliest arrival of the last with decision enabled f der of arrival: you can deal with continuous and discrete variables. Why is it useful? Now you can pose the problem of earliest arrival of the last with decision enabled f der of arrival: you can deal with continuous and discrete variables. Aircraft 1 and 2 are separated by me than (previous slides) Aircraft 1 arrives between a1 and b1 Aircraf arrives between a2 and b2 A fmal definition of a MILP A Mixed Integer Linear Program is a Linear Program in which some of the variables are continuous, and some are integer. Holding : how many should an fly? A holding delays an by a fixed amount of, usually =3 min. Question f AC: how many holding should one do befe it is allowed to land? CAS tracks courtesy of NASA Ames

5 5 hree holding hree holding hree holding his is the set in which we want to schedule. We seek one arrival f each in each of the coled sets. he number of holding is a decision variable (the decision is actually made by the human Air raffic Controller)

6 6 he number of holding is a decision variable (the decision is actually made by the human Air raffic Controller). continuous Actually, the human air traffic controller has the possibility to schedule 2 anywhere in the fourth interval ( with three holding ). continuous integer his is can be expressed in terms of two linear constraints involving integer and continuous variables his is can be expressed in terms of two linear constraints involving integer and continuous variables, me generally, f any admissible interval f 2: F n holding Problem: separating by : how to schedule the so the last comes as early as possible. Problem: separating by : how to schedule the so the last comes as early as possible

7 7 Problem: separating by : how to schedule the so the last comes as early as possible. Problem: separating by : how to schedule the so the last comes as early as possible t 1 t 1 t 3 Problem: separating by : how to schedule the so the last comes as early as possible. his is a Mixed Integer Linear Program (MILP): - Some variables are integer (the der of arrival): 3, 1, 2, 4 - Some variables are continuous (the s of arrival) - he problem can be posed as a linear program involving both integer and continuous variables. = at least 3 min = at least 3 min t 1 t 3 t 4 t 1 t 3 t 4

CHAPTER 3: INTEGER PROGRAMMING

CHAPTER 3: INTEGER PROGRAMMING CHAPTER 3: INTEGER PROGRAMMING Overview To this point, we have considered optimization problems with continuous design variables. That is, the design variables can take any value within a continuous feasible

More information

Section 2.4: The Precise Definition of a Limit

Section 2.4: The Precise Definition of a Limit Section 2.4: The Precise Definition of a Limit In the previous sections, we examined the idea of a it. However, the definitions we gave were me intuitive as opposed to precise. In mathematics, in der to

More information

Integer Programming and Branch and Bound

Integer Programming and Branch and Bound Courtesy of Sommer Gentry. Used with permission. Integer Programming and Branch and Bound Sommer Gentry November 4 th, 003 Adapted from slides by Eric Feron and Brian Williams, 6.40, 00. Integer Programming

More information

Greedy Algorithms. CSE 101: Design and Analysis of Algorithms Lecture 9

Greedy Algorithms. CSE 101: Design and Analysis of Algorithms Lecture 9 Greedy Algorithms CSE 101: Design and Analysis of Algorithms Lecture 9 CSE 101: Design and analysis of algorithms Greedy algorithms Reading: Kleinberg and Tardos, sections 4.1, 4.2, and 4.3 Homework 4

More information

Integer Linear Programming Modeling

Integer Linear Programming Modeling DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem

More information

Computational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs

Computational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational

More information

CS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring / 1

CS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring / 1 CS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring 2017 1 / 1 Part I Greedy Algorithms: Tools and Techniques Chandra

More information

Michael Kupfer. San Jose State University Research Foundation NASA Ames, Moffett Field, CA. 8 th USA Europe ATM Seminar June 29 th July 2 nd Napa, CA

Michael Kupfer. San Jose State University Research Foundation NASA Ames, Moffett Field, CA. 8 th USA Europe ATM Seminar June 29 th July 2 nd Napa, CA Michael Kupfer San Jose State University Research Foundation NS mes, Moffett Field, C 8 th US Europe TM Seminar June 29 th July 2 nd Napa, C 0 SFO Motivation: Dependent Simultaneous runways Offset Instrument

More information

Chapter 3: Discrete Optimization Integer Programming

Chapter 3: Discrete Optimization Integer Programming Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo

More information

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 27 Flow Shop Scheduling - Heuristics - Palmer, Campbell Dudek

More information

Optimal Scheduling Algorithm in Point Merge System Including Holding Pattern Based on MILP

Optimal Scheduling Algorithm in Point Merge System Including Holding Pattern Based on MILP 7 TH EUROPEAN CONFERENCE FOR AERONAUTICS AND AEROSPACE SCIENCES (EUCASS) Optimal Scheduling Algorithm in Point Merge System Including Holding Pattern Based on MILP Somang Lee, Youkyung Hong, and Youdan

More information

Lecture 11: Adders. Slides courtesy of Deming Chen. Slides based on the initial set from David Harris. 4th Ed.

Lecture 11: Adders. Slides courtesy of Deming Chen. Slides based on the initial set from David Harris. 4th Ed. Lecture : dders Slides courtesy of Deming hen Slides based on the initial set from David Harris MOS VLSI Design Outline Single-bit ddition arry-ripple dder arry-skip dder arry-lookahead dder arry-select

More information

CSE241 VLSI Digital Circuits Winter Lecture 07: Timing II

CSE241 VLSI Digital Circuits Winter Lecture 07: Timing II CSE241 VLSI Digital Circuits Winter 2003 Lecture 07: Timing II CSE241 L3 ASICs.1 Delay Calculation Cell Fall Cap\Tr 0.05 0.2 0.5 0.01 0.02 0.16 0.30 0.5 2.0 0.04 0.32 0.178 0.08 0.64 0.60 1.20 0.1ns 0.147ns

More information

Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem

Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 20 Travelling Salesman Problem Today we are going to discuss the travelling salesman problem.

More information

Chapter 3: Discrete Optimization Integer Programming

Chapter 3: Discrete Optimization Integer Programming Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17

More information

Urban Transportation Planning Prof. Dr.V.Thamizh Arasan Department of Civil Engineering Indian Institute of Technology Madras

Urban Transportation Planning Prof. Dr.V.Thamizh Arasan Department of Civil Engineering Indian Institute of Technology Madras Urban Transportation Planning Prof. Dr.V.Thamizh Arasan Department of Civil Engineering Indian Institute of Technology Madras Module #03 Lecture #12 Trip Generation Analysis Contd. This is lecture 12 on

More information

Numerical Optimization. Review: Unconstrained Optimization

Numerical Optimization. Review: Unconstrained Optimization Numerical Optimization Finding the best feasible solution Edward P. Gatzke Department of Chemical Engineering University of South Carolina Ed Gatzke (USC CHE ) Numerical Optimization ECHE 589, Spring 2011

More information

AMTH140 Lecture 8. Symbolic Logic

AMTH140 Lecture 8. Symbolic Logic AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning

More information

Optimization in Process Systems Engineering

Optimization in Process Systems Engineering Optimization in Process Systems Engineering M.Sc. Jan Kronqvist Process Design & Systems Engineering Laboratory Faculty of Science and Engineering Åbo Akademi University Most optimization problems in production

More information

CS 6901 (Applied Algorithms) Lecture 3

CS 6901 (Applied Algorithms) Lecture 3 CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar

More information

Introduction to Complexity Theory

Introduction to Complexity Theory Introduction to Complexity Theory Read K & S Chapter 6. Most computational problems you will face your life are solvable (decidable). We have yet to address whether a problem is easy or hard. Complexity

More information

P1.1 THE NATIONAL AVIATION WEATHER PROGRAM: AN UPDATE ON IMPLEMENTATION

P1.1 THE NATIONAL AVIATION WEATHER PROGRAM: AN UPDATE ON IMPLEMENTATION P1.1 THE NATIONAL AVIATION WEATHER PROGRAM: AN UPDATE ON IMPLEMENTATION Thomas S. Fraim* 1, Mary M. Cairns 1, and Anthony R. Ramirez 2 1 NOAA/OFCM, Silver Spring, MD 2 Science and Technology Corporation,

More information

SAT, NP, NP-Completeness

SAT, NP, NP-Completeness CS 473: Algorithms, Spring 2018 SAT, NP, NP-Completeness Lecture 22 April 13, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Part I Reductions Continued Ruta (UIUC)

More information

19. Logic constraints, integer variables

19. Logic constraints, integer variables CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 19. Logic constraints, integer variables If-then constraints Generalized assignment problems Logic constraints Modeling a restricted set of values

More information

CS 6783 (Applied Algorithms) Lecture 3

CS 6783 (Applied Algorithms) Lecture 3 CS 6783 (Applied Algorithms) Lecture 3 Antonina Kolokolova January 14, 2013 1 Representative problems: brief overview of the course In this lecture we will look at several problems which, although look

More information

Ch 3.2: Direct proofs

Ch 3.2: Direct proofs Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations

More information

Design and Optimization of Energy Systems Prof. C. Balaji Department of Mechanical Engineering Indian Institute of Technology, Madras

Design and Optimization of Energy Systems Prof. C. Balaji Department of Mechanical Engineering Indian Institute of Technology, Madras Design and Optimization of Energy Systems Prof. C. Balaji Department of Mechanical Engineering Indian Institute of Technology, Madras Lecture No. # 10 Convergence Characteristics of Newton-Raphson Method

More information

Greedy Algorithms. CSE 101: Design and Analysis of Algorithms Lecture 10

Greedy Algorithms. CSE 101: Design and Analysis of Algorithms Lecture 10 Greedy Algorithms CSE 101: Design and Analysis of Algorithms Lecture 10 CSE 101: Design and analysis of algorithms Greedy algorithms Reading: Kleinberg and Tardos, sections 4.1, 4.2, and 4.3 Homework 4

More information

Water Resources Systems: Modeling Techniques and Analysis

Water Resources Systems: Modeling Techniques and Analysis INDIAN INSTITUTE OF SCIENCE Water Resources Systems: Modeling Techniques and Analysis Lecture - 9 Course Instructor : Prof. P. P. MUJUMDAR Department of Civil Engg., IISc. Summary of the previous lecture

More information

PLC Papers Created For:

PLC Papers Created For: PLC Papers Created For: Daniel Inequalities Inequalities on number lines 1 Grade 4 Objective: Represent the solution of a linear inequality on a number line. Question 1 Draw diagrams to represent these

More information

NP-complete problems. CSE 101: Design and Analysis of Algorithms Lecture 20

NP-complete problems. CSE 101: Design and Analysis of Algorithms Lecture 20 NP-complete problems CSE 101: Design and Analysis of Algorithms Lecture 20 CSE 101: Design and analysis of algorithms NP-complete problems Reading: Chapter 8 Homework 7 is due today, 11:59 PM Tomorrow

More information

A heuristic algorithm for the Aircraft Landing Problem

A heuristic algorithm for the Aircraft Landing Problem 22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 A heuristic algorithm for the Aircraft Landing Problem Amir Salehipour

More information

CEE Computer Applications. Mathematical Programming (LP) and Excel Solver

CEE Computer Applications. Mathematical Programming (LP) and Excel Solver CEE 3804 - Computer Applications Mathematical Programming (LP) and Excel Solver Dr. Antonio A. Trani Professor of Civil and Environmental Engineering Virginia Polytechnic Institute and State University

More information

An improved method for solving micro-ferry scheduling problems

An improved method for solving micro-ferry scheduling problems Delft University of Technology Delft Center for Systems and Control Technical report 12-028 An improved method for solving micro-ferry scheduling problems M. Burger, B. De Schutter, and H. Hellendoorn

More information

Verification and performance measures of Meteorological Services to Air Traffic Management (MSTA)

Verification and performance measures of Meteorological Services to Air Traffic Management (MSTA) Verification and performance measures of Meteorological Services to Air Traffic Management (MSTA) Background Information on the accuracy, reliability and relevance of products is provided in terms of verification

More information

Constructing and solving linear equations

Constructing and solving linear equations Key Stage 3 National Strategy Guidance Curriculum and Standards Interacting with mathematics in Key Stage 3 Constructing and solving linear equations Teachers of mathematics Status: Recommended Date of

More information

OPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano

OPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano OPTIMIZATION joint course with Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-15-16.shtml

More information

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should

More information

ECE380 Digital Logic. Positional representation

ECE380 Digital Logic. Positional representation ECE380 Digital Logic Number Representation and Arithmetic Circuits: Number Representation and Unsigned Addition Dr. D. J. Jackson Lecture 16-1 Positional representation First consider integers Begin with

More information

UGRC 120 Numeracy Skills

UGRC 120 Numeracy Skills UGRC 120 Numeracy Skills Session 1 REVIEWS OF BASIC ALGEBRAIC MATHEMATICS II Lecturer: Dr. Ezekiel N. N. Nortey/Mr. Enoch Nii Boi Quaye, Statistics Contact Information: ennortey@ug.edu.gh/enbquaye@ug.edu.gh

More information

Task Type Grouping Strategy. Scaffolding Task Individual/Partner Task. Practice Task Individual/Partner Task. Scaffolding Task Individual/Partner Task

Task Type Grouping Strategy. Scaffolding Task Individual/Partner Task. Practice Task Individual/Partner Task. Scaffolding Task Individual/Partner Task SELECTED TASKS The following tasks represent the level of depth, rigor, and complexity expected of all Coordinate Algebra students. These tasks, or tasks of similar depth and rigor, should be used to demonstrate

More information

Solutions to Homework I (1.1)

Solutions to Homework I (1.1) Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p

More information

Mathematical Induction. Defining Functions. Overview. Notation for recursive functions. Base case Sn(0) = 0 S(n) = S(n 1) + n for n > 0

Mathematical Induction. Defining Functions. Overview. Notation for recursive functions. Base case Sn(0) = 0 S(n) = S(n 1) + n for n > 0 Readings on induction. Mathematical Induction (a) Weiss, Sec. 7.2, page 233 (b) Course slides f lecture and notes recitation. Every criticism from a good man is of value to me. What you hint at generally

More information

Combinatorial Structure of Single machine rescheduling problem

Combinatorial Structure of Single machine rescheduling problem Workshop on Combinatorics and Optimization Combinatorial Structure of Single machine rescheduling problem Yuan Jinjiang Department of mathematics, Zhengzhou University Zhengzhou, Henan 450052 Page 1 of

More information

6.837 LECTURE 8. Lecture 8 Outline Fall '01. Lecture Fall '01

6.837 LECTURE 8. Lecture 8 Outline Fall '01. Lecture Fall '01 6.837 LECTURE 8 1. 3D Transforms; Part I - Priciples 2. Geometric Data Types 3. Vector Spaces 4. Basis Vectors 5. Linear Transformations 6. Use of Matrix Operators 7. How to Read a Matrix Expression 8.

More information

IOE510/MATH561/OMS518: Linear Programming I

IOE510/MATH561/OMS518: Linear Programming I IOE510/MATH561/OMS518: Linear Programming I Lectures: Mondays and Wednesdays, 9:00-10:30 AM, IOE 1680 Instructor: Prof. Marina A. Epelman GSI: Katharina Ley Office hours: See CTools for most current info

More information

Distribution of sample means

Distribution of sample means Two types of statistics: and Distribution of sample means Mean Standard deviation Population Sample The relationship between Population and Samples is described in terms of Probability A jar with 100 marbles,

More information

03 Propositional Logic II

03 Propositional Logic II Martin Henz February 12, 2014 Generated on Wednesday 12 th February, 2014, 09:49 1 Review: Syntax and Semantics of Propositional Logic 2 3 Propositional Atoms and Propositions Semantics of Formulas Validity,

More information

Logistic Regression Introduction to Machine Learning. Matt Gormley Lecture 8 Feb. 12, 2018

Logistic Regression Introduction to Machine Learning. Matt Gormley Lecture 8 Feb. 12, 2018 10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Logistic Regression Matt Gormley Lecture 8 Feb. 12, 2018 1 10-601 Introduction

More information

arxiv: v1 [cs.ds] 30 Jun 2016

arxiv: v1 [cs.ds] 30 Jun 2016 Online Packet Scheduling with Bounded Delay and Lookahead Martin Böhm 1, Marek Chrobak 2, Lukasz Jeż 3, Fei Li 4, Jiří Sgall 1, and Pavel Veselý 1 1 Computer Science Institute of Charles University, Prague,

More information

Applications of Linear Programming - Minimization

Applications of Linear Programming - Minimization Applications of Linear Programming - Minimization Drs. Antonio A. Trani and H. Baik Professor of Civil Engineering Virginia Tech Analysis of Air Transportation Systems June 9-12, 2010 1 of 49 Recall the

More information

Scheduling and Optimization Course (MPRI)

Scheduling and Optimization Course (MPRI) MPRI Scheduling and optimization: lecture p. /6 Scheduling and Optimization Course (MPRI) Leo Liberti LIX, École Polytechnique, France MPRI Scheduling and optimization: lecture p. /6 Teachers Christoph

More information

21. Set cover and TSP

21. Set cover and TSP CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 21. Set cover and TSP ˆ Set covering ˆ Cutting problems and column generation ˆ Traveling salesman problem Laurent Lessard (www.laurentlessard.com)

More information

Today s class. Constrained optimization Linear programming. Prof. Jinbo Bi CSE, UConn. Numerical Methods, Fall 2011 Lecture 12

Today s class. Constrained optimization Linear programming. Prof. Jinbo Bi CSE, UConn. Numerical Methods, Fall 2011 Lecture 12 Today s class Constrained optimization Linear programming 1 Midterm Exam 1 Count: 26 Average: 73.2 Median: 72.5 Maximum: 100.0 Minimum: 45.0 Standard Deviation: 17.13 Numerical Methods Fall 2011 2 Optimization

More information

Chapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013

Chapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013 Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of

More information

Sample questions for COMP-424 final exam

Sample questions for COMP-424 final exam Sample questions for COMP-44 final exam Doina Precup These are examples of questions from past exams. They are provided without solutions. However, Doina and the TAs would be happy to answer questions

More information

Statements and Quantifiers

Statements and Quantifiers Statements and Quantifiers MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Summer 2018 Symbolic Logic Today we begin a study of logic. We will use letters to represent

More information

A new delay forecasting system for the Passenger Information Control system (PIC) of the Tokaido-Sanyo Shinkansen

A new delay forecasting system for the Passenger Information Control system (PIC) of the Tokaido-Sanyo Shinkansen Computers in Railways X 199 A new delay forecasting system for the Passenger Information Control system (PIC) of the Tokaido-Sanyo Shinkansen K. Fukami, H. Yamamoto, T. Hatanaka & T. Terada Central Japan

More information

CSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD

CSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD Course Overview Material that will be covered in the course: Basic graph algorithms Algorithm Design Techniques Greedy Algorithms Divide and Conquer Dynamic Programming Network Flows Computational intractability

More information

Introduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role

Introduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role Linear Programming RK Jana Lecture Outline Introduction to Linear Programming (LP) Historical Perspective Model Formulation Graphical Solution Method Simplex Method Introduction to LP Continued Today many

More information

Logic, Optimization and Data Analytics

Logic, Optimization and Data Analytics Logic, Optimization and Data Analytics John Hooker Carnegie Mellon University United Technologies Research Center, Cork, Ireland August 2015 Thesis Logic and optimization have an underlying unity. Ideas

More information

Logistic Regression Introduction to Machine Learning. Matt Gormley Lecture 9 Sep. 26, 2018

Logistic Regression Introduction to Machine Learning. Matt Gormley Lecture 9 Sep. 26, 2018 10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Logistic Regression Matt Gormley Lecture 9 Sep. 26, 2018 1 Reminders Homework 3:

More information

Autonomous Mobile Robot Design

Autonomous Mobile Robot Design Autonomous Mobile Robot Design Topic: Extended Kalman Filter Dr. Kostas Alexis (CSE) These slides relied on the lectures from C. Stachniss, J. Sturm and the book Probabilistic Robotics from Thurn et al.

More information

Simulation & Modeling Event-Oriented Simulations

Simulation & Modeling Event-Oriented Simulations Simulation & Modeling Event-Oriented Simulations Outline Simulation modeling characteristics Concept of Time A DES Simulation (Computation) DES System = model + simulation execution Data Structures Program

More information

Bicriterial Delay Management

Bicriterial Delay Management Universität Konstanz Bicriterial Delay Management Csaba Megyeri Konstanzer Schriften in Mathematik und Informatik Nr. 198, März 2004 ISSN 1430 3558 c Fachbereich Mathematik und Statistik c Fachbereich

More information

Project # Embedded System Engineering

Project # Embedded System Engineering Project #8 18-649 Embedded System Engineering Note: Course slides shamelessly stolen from lecture All course notes Copyright 2006-2013, Philip Koopman, All Rights Reserved Announcements and Administrative

More information

Linear programming I João Carlos Lourenço

Linear programming I João Carlos Lourenço Decision Support Models Linear programming I João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research, 9th

More information

More Approximation Algorithms

More Approximation Algorithms CS 473: Algorithms, Spring 2018 More Approximation Algorithms Lecture 25 April 26, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 28 Formal definition of approximation

More information

Undecibability. Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not.

Undecibability. Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not. Undecibability Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not. The problem was posed in 1900. In 1970 it was proved that there can

More information

Introduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs

Introduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch

More information

Lecture 02: 2D Geometry. August 24, 2017

Lecture 02: 2D Geometry. August 24, 2017 Lecture 02: 2D Geometry August 24, 207 This Came Up Tuesday Know what radiosity computation does. Do not expect to implement nor see underlying equations this semester. 8/24/7 CSU CS40 Fall 207, Ross Beveridge

More information

CS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018

CS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018 CS 301 Lecture 17 Church Turing thesis Stephen Checkoway March 19, 2018 1 / 17 An abridged modern history of formalizing algorithms An algorithm is a finite, unambiguous sequence of steps for solving a

More information

Machine learning: lecture 20. Tommi S. Jaakkola MIT CSAIL

Machine learning: lecture 20. Tommi S. Jaakkola MIT CSAIL Machine learning: lecture 20 ommi. Jaakkola MI AI tommi@csail.mit.edu Bayesian networks examples, specification graphs and independence associated distribution Outline ommi Jaakkola, MI AI 2 Bayesian networks

More information

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 13 Competitive Optimality of the Shannon Code So, far we have studied

More information

Clock-driven scheduling

Clock-driven scheduling Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017

More information

Reasoning Under Uncertainty: Introduction to Probability

Reasoning Under Uncertainty: Introduction to Probability Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1 Textbook 6.1 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 1 Lecture Overview 1

More information

Part 2: The 21 August 2017 Total Solar Eclipse The Great American Eclipse

Part 2: The 21 August 2017 Total Solar Eclipse The Great American Eclipse Feature Story: ALPO Eclipse Section Part 2: The 21 August 2017 Total Solar Eclipse The Great American Eclipse By Michael D. Reynolds, Coordinator, ALPO Eclipse Section Executive Director, the ALPO m.d.reynolds@fscj.edu

More information

Some practice questions for CIMC.

Some practice questions for CIMC. 1. Determine the value of {2008 Cayley #2} Some practice questions for CIMC. 25 16 25 16. 25 16 25 16 = 9 5 4 = 3 1 = 3 2. In the diagram, P T and QS are straight lines intersecting at R such that QP =

More information

CPSC 695. Future of GIS. Marina L. Gavrilova

CPSC 695. Future of GIS. Marina L. Gavrilova CPSC 695 Future of GIS Marina L. Gavrilova The future of GIS Overview What is GIS now How GIS was viewed before Current trends and developments Future directions of research What is GIS? Internet's definition

More information

Balancing Chemical Equations

Balancing Chemical Equations Unit: Chemical Reactions Skills: correctly balance a chemical equation Date: A chemical equation needs to describe the chemical formulas and relative number of molecules involved of each molecule that

More information

Econ 101A Problem Set 6 Solutions Due on Monday Dec. 9. No late Problem Sets accepted, sorry!

Econ 101A Problem Set 6 Solutions Due on Monday Dec. 9. No late Problem Sets accepted, sorry! Econ 0A Problem Set 6 Solutions Due on Monday Dec. 9. No late Problem Sets accepted, sry! This Problem set tests the knowledge that you accumulated mainly in lectures 2 to 26. The problem set is focused

More information

Lecture 27. DATA 8 Spring Sample Averages. Slides created by John DeNero and Ani Adhikari

Lecture 27. DATA 8 Spring Sample Averages. Slides created by John DeNero and Ani Adhikari DATA 8 Spring 2018 Lecture 27 Sample Averages Slides created by John DeNero (denero@berkeley.edu) and Ani Adhikari (adhikari@berkeley.edu) Announcements Questions for This Week How can we quantify natural

More information

Aviation Weather A NextGen Perspective. Mark Andrews Federal Chair Weather Working Group Joint Planning and Development Office July 21 st, 2010

Aviation Weather A NextGen Perspective. Mark Andrews Federal Chair Weather Working Group Joint Planning and Development Office July 21 st, 2010 Aviation Weather A NextGen Perspective Mark Andrews Federal Chair Weather Working Group Joint Planning and Development Office July 21 st, 2010 1 NextGen 101 Weather accounts for 70% of all air traffic

More information

On the Complexity of the Reflected Logic of Proofs

On the Complexity of the Reflected Logic of Proofs On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,

More information

CS 347 Parallel and Distributed Data Processing

CS 347 Parallel and Distributed Data Processing CS 347 Parallel and Distributed Data Processing Spring 2016 & Clocks, Clocks, and the Ordering of Events in a Distributed System. L. Lamport, Communications of the ACM, 1978 Notes 15: & Clocks CS 347 Notes

More information

MATH2070 Optimisation

MATH2070 Optimisation MATH2070 Optimisation Linear Programming Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The standard Linear Programming (LP) Problem Graphical method of solving LP problem

More information

Networked Embedded Systems WS 2016/17

Networked Embedded Systems WS 2016/17 Networked Embedded Systems WS 2016/17 Lecture 2: Real-time Scheduling Marco Zimmerling Goal of Today s Lecture Introduction to scheduling of compute tasks on a single processor Tasks need to finish before

More information

Lecture 13, Fall 04/05

Lecture 13, Fall 04/05 Lecture 13, Fall 04/05 Short review of last class NP hardness conp and conp completeness Additional reductions and NP complete problems Decision, search, and optimization problems Coping with NP completeness

More information

Land Navigation Table of Contents

Land Navigation Table of Contents Land Navigation Table of Contents Preparatory Notes to Instructor... 1 Session Notes... 5 Learning Activity: Grid Reference Four Figure... 7 Learning Activity: Grid Reference Six Figure... 8 Learning Activity:

More information

More sample questions for COMP-424 midterm exam

More sample questions for COMP-424 midterm exam More sample questions for COMP-424 midterm exam Doina Precup Note that the exam also has questions similar to those on the homeworks. 1. Search algorithms (a) Suppose you have an admissible heuristic h.

More information

Regular Languages and Finite Automata

Regular Languages and Finite Automata Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying

More information

PROBABILISTIC METHODS FOR AIR TRAFFIC DEMAND FORECASTING

PROBABILISTIC METHODS FOR AIR TRAFFIC DEMAND FORECASTING AIAA Guidance, Navigation, and Control Conference and Exhibit 5-8 August 2002, Monterey, California AIAA 2002-4766 PROBABILISTIC METHODS FOR AIR TRAFFIC DEMAND FORECASTING Larry A. Meyn * NASA Ames Research

More information

Introducing Proof 1. hsn.uk.net. Contents

Introducing Proof 1. hsn.uk.net. Contents Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction

More information

Dynamic Atomic Congestion Games with Seasonal Flows

Dynamic Atomic Congestion Games with Seasonal Flows Dynamic Atomic Congestion Games with Seasonal Flows Marc Schröder Marco Scarsini, Tristan Tomala Maastricht University Department of Quantitative Economics Scarsini, Schröder, Tomala Dynamic Atomic Congestion

More information

AM 121: Intro to Optimization Models and Methods

AM 121: Intro to Optimization Models and Methods AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 2: Intro to LP, Linear algebra review. Yiling Chen SEAS Lecture 2: Lesson Plan What is an LP? Graphical and algebraic correspondence Problems

More information

Lecture 13: Sequential Circuits, FSM

Lecture 13: Sequential Circuits, FSM Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines Reminder: midterm on Tue 2/28 will cover Chapters 1-3, App A, B if you understand all slides, assignments,

More information

Regular Expressions and Language Properties

Regular Expressions and Language Properties Regular Expressions and Language Properties Mridul Aanjaneya Stanford University July 3, 2012 Mridul Aanjaneya Automata Theory 1/ 47 Tentative Schedule HW #1: Out (07/03), Due (07/11) HW #2: Out (07/10),

More information

All-sky LIGO Search for Periodic Gravitational Waves in the Fourth Science Run (S4)

All-sky LIGO Search for Periodic Gravitational Waves in the Fourth Science Run (S4) All-sky LIGO Search for Periodic Gravitational Waves in the Fourth Science Run (S4) Keith Riles University of Michigan For the LIGO Scientific Collaboration APS Meeting, Jacksonville, Florida April 14-17,

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous

More information

Enhanced Descent Wind Forecast for Aircraft

Enhanced Descent Wind Forecast for Aircraft 9 th USA/Europe ATM R&D Seminar Enhanced Descent Wind Forecast for Aircraft Facilitation of Continuous Descent Arrivals with Improved Efficiency and Predictability by the use of Tailored Descent Wind Forecasts

More information