Polyhedral Optimization Lecture 1 – Part 1 M. Pawan Kumar Slides available online

Slides:



Advertisements
Similar presentations
Advanced Algebra/Pre-calculus Advanced Functions and Modeling Math Analysis AP Statistics Statistics and Probability/Discrete Math.
Advertisements

Practice Problems: The Composition of Functions Work problems on your own first. Then check with answers in the following slides. If the answers don’t.
MS&E 211 Quadratic Programming Ashish Goel. A simple quadratic program Minimize (x 1 ) 2 Subject to: -x 1 + x 2 ≥ 3 -x 1 – x 2 ≥ -2.
What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,
Discrete Optimization for Vision and Learning. Who? How? M. Pawan Kumar Associate Professor Ecole Centrale Paris Nikos Komodakis Associate Professor Ecole.
Math Xa Introduction to Functions and Calculus Fall 2008 Introductory Meeting John Hall.
CSE332: Data Abstractions Lecture 27: A Few Words on NP Dan Grossman Spring 2010.
Linear Programming – Max Flow – Min Cut Orgad Keller.
Polyhedral Optimization Lecture 3 – Part 3 M. Pawan Kumar Slides available online
Nsm.uh.edu Math Courses Available After College Algebra.
University of Colorado - Dept of Aerospace Engineering Sciences - Introduction to FEM This is ASEN 5007: Introduction to Finite Element Methods.
THE IMPACT OF DELTAMATH: A STUDY EXAMINES THE EFFECTIVENESS OF ONLINE HOMEWORK VERSUS PAPER- BASED HOMEWORK ON ALGEBRA 2 STUDENTS’ TEST GRADES BY: AMY.
Polyhedral Optimization Lecture 3 – Part 2
Jeff Edmonds room: 3044 Many Topics in Theory & Mathematics Scheduling Algorithms –scheduling some shared resource –to a steady stream.
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
An innovative learning model for computation in first year mathematics Birgit Loch Department of Mathematics and Computing, USQ Elliot Tonkes CS Energy,
Polyhedral Optimization Lecture 1 – Part 2 M. Pawan Kumar Slides available online
1 ESI 6417 Linear Programming and Network Optimization Fall 2003 Ravindra K. Ahuja 370 Weil Hall, Dept. of ISE
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
CSE543T: Algorithms for Nonlinear Optimization Yixin Chen Department of Computer Science & Engineering Washington University in St Louis Spring, 2011.
NOTE Data preparation and consideration will take some time here.
MIT and James Orlin1 NP-completeness in 2005.
Dijkstra’s Algorithm. Announcements Assignment #2 Due Tonight Exams Graded Assignment #3 Posted.
Télécom 2A – Algo Complexity (1) Time Complexity and the divide and conquer strategy Or : how to measure algorithm run-time And : design efficient algorithms.
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.
CSE332: Data Abstractions Lecture 24.5: Interlude on Intractability Dan Grossman Spring 2012.
Models in I.E. Lectures Introduction to Optimization Models: Shortest Paths.
1 Announcements: The deadline for grad lecture notes was extended to Friday Nov. 9 at 3:30pm. Assignment #4 is posted: Due Thurs. Nov. 15. Nov is.
Polyhedral Optimization Lecture 4 – Part 2 M. Pawan Kumar Slides available online
Discrete Optimization Lecture 4 – Part 1 M. Pawan Kumar Slides available online
Polyhedral Optimization Lecture 5 – Part 2 M. Pawan Kumar Slides available online
Optimization - Lecture 4, Part 1 M. Pawan Kumar Slides available online
COMP1927 Course Introduction 16x1
The Hashemite University Computer Engineering Department
Discrete Optimization Lecture 4 – Part 1 M. Pawan Kumar
CES 592 Theory of Software Systems B. Ravikumar (Ravi) Office: 124 Darwin Hall.
Welcome to Open House Algebra 2 Ms. Iglesias Please sign in!
What else is there? CMPT 454: Database Systems II. – Transaction Management. – Query Planning. – Optional topics, e.g. data mining, information retrieval,
Prerequisite Skills VOCABULARY CHECK Copy and complete the statement. 2. The graph of a linear inequality in two variables is the set of all points in.
Discrete Mathematics Course syllabus. Course No.: Course Classification: Department Compulsory (CS,CIS,SE) Course Name: Discrete Mathematics Time.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Introduction to NP Instructor: Neelima Gupta 1.
Polyhedral Optimization Lecture 5 – Part 3 M. Pawan Kumar Slides available online
Discrete Optimization Lecture 3 – Part 1 M. Pawan Kumar Slides available online
Notes Over 3.1 Solving a System Graphically Graph the linear system and estimate the solution. Then check the solution algebraically.
EXAMPLE 1 Solve a system graphically Graph the linear system and estimate the solution. Then check the solution algebraically. 4x + y = 8 2x – 3y = 18.
The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Final Exam Information These slides and more detailed information will be posted on the webpage later…
Honors Pre- Calculus Mrs. Medeiros. Honors Pre-Calculus  This course will cover many topics, including functions and graphs, polynomials, exponential.
Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar
Polyhedral Optimization Lecture 2 – Part 2 M. Pawan Kumar Slides available online
Lecture 5.4: Paths and Connectivity
The NP class. NP-completeness
More NP-Complete and NP-hard Problems
CS6501 Advanced Topics in Information Retrieval Course Policy
Algebra II Explorations Review ( )
Algebra II 1.7: Solve Absolute Value Equations and Inequalities.
Approximation Algorithms
Definition In simple terms, an algorithm is a series of instructions to solve a problem (complete a task) We focus on Deterministic Algorithms Under the.
MATH 1830 Applications of Calculus
1.3 Vector Equations.
NP-Complete Problems.
Pima Medical Institute Online Education
I.4 Polyhedral Theory (NW)
I.4 Polyhedral Theory.
Richard Anderson Lecture 27 Survey of NP Complete Problems
Background and Contact Information Pat Agard Mathematics teacher at Highlands High School (13th year) Teach: AP Stats, Pre-Calculus Adv., Algebra II Reg.
Warm- Up: Solve by Substitution
Presentation transcript:

Polyhedral Optimization Lecture 1 – Part 1 M. Pawan Kumar Slides available online

What is it about? What are the prerequisites? What type of material will be provided? How will the students be evaluated? Tips and tricks Course Description

Problem 1 Given a set of ‘n’ real numbers S Is there a non-empty subset X ⊆ S such that ∑ x ∈ X x ≤ C

Problem 1 Given a set of ‘n’ real numbers S Is there a non-empty subset X ⊆ S such that ∑ x ∈ X x ≤ C {-28, 53, -58, -99, 13, 27, -55, -31, -91, 12, -87, -68}

Problem 1 Given a set of ‘n’ real numbers S Is there a non-empty subset X ⊆ S such that ∑ x ∈ X x ≤ -250 Solution? {-28, 53, -58, -99, 13, 27, -55, -31, -91, 12, -87, -68}

Solution Add up all the negative numbers Check if the number is less than or equal to C If there are negative numbers in S Else Pick smallest number

n Easy problem (run-time is polynomial in ‘n’) Running time

Problem 2 Given a sequence of ‘n’ real numbers S Is there a non-empty subsequence X such that ∑ x ∈ X x ≤ C

Problem 2 Given a sequence of ‘n’ real numbers S Is there a non-empty subsequence X such that ∑ x ∈ X x ≤ C

Problem 2 Given a sequence of ‘n’ real numbers S Is there a non-empty subsequence X such that ∑ x ∈ X x ≤ Solution?

Solution For every i, j such that 1 ≤ i ≤ j ≤ n Compute the sum of subsequence from i to j Check if the sum is less than or equal to C

n Easy problem (run-time is polynomial in ‘n’) Running time

Problem 3 Given a set of ‘n’ real numbers S Is there a non-empty subset X ⊆ S such that ∑ x ∈ X x = 0

Problem 3 Given a set of ‘n’ real numbers S Is there a non-empty subset X ⊆ S such that ∑ x ∈ X x = 0 {-28, 53, -58, -99, 13, 27, -55, -31, -91, 12, -87, -68} Solution?

Solution For every non-empty subset X ⊆ S Compute ∑ x ∈ X x Check if the sum is equal to 0

Running time n Hard problem (run-time is exponential in ‘n’)

Problems Some problems are easy (formal definition soon) Some problems are hard (formal definition soon) Many natural questions arise Which ones will be answered in this course?

Is The Given Problem Easy? ✗

Why Is The Given Problem Easy? Part I

How Easy is an Easy Problem? ✗ Part II of the “Optimization” course

How Hard is a Hard Problem? Part II

What is it about? What are the prerequisites? What type of material will be provided? How will the students be evaluated? Tips and tricks Course Description

Discrete Mathematics What is a directed graph? What is an undirected graph? Walks, paths, and other basic definitions Some definitions will be provided as needed

Linear Algebra What is a vector? What is a matrix? Rank, base, span and other basic definitions Some definitions will be provided as needed

Optimization What is a convex set? What is a convex function? Linear function? Polyhedron? Linear programming? Basics will be covered in lecture 1

Programming Theory course, no programming assignments But some basic programming skills required Enough to understand pseudo-code And estimate its run-time

What is it about? What are the prerequisites? What type of material will be provided? How will the students be evaluated? Tips and tricks Course Description

Course Website Detailed syllabus Slides for all the lectures Links to scribes of related courses No lecture “notes” Example exam questions

What is it about? What are the prerequisites? What type of material will be provided? How will the students be evaluated? Tips and tricks Course Description

Evaluation Final exam worth 20 marks “Easy” questions worth 10 marks “Hard” questions worth 10 marks Grading on a curve

What is it about? What are the prerequisites? What type of material will be provided? How will the students be evaluated? Tips and tricks Course Description

Elie Wiesel

Attendance No minimum attendance requirement There will be no “roll call” All the information is available online But not in an easy-to-follow form Tip 1: Attend all lectures from start to end

During the Class … Tip 2: Clarify your doubts

Reasons No such thing as a “silly question” Flynn effect It’s part of my job It helps me improve the course material

Evaluation Final exam worth 20-x marks x is a student-dependent variable Increases with an interesting answer Increases with an interesting question Tip 3: Maximize ‘x’ to minimize stress

Questions?