Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Similar presentations


Presentation on theme: "Polyhedral Optimization Lecture 1 – Part 1 M. Pawan Kumar Slides available online"— Presentation transcript:

1 Polyhedral Optimization Lecture 1 – Part 1 M. Pawan Kumar pawan.kumar@ecp.fr Slides available online http://cvn.ecp.fr/personnel/pawan/

2 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

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

4 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}

5 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}

6 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

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

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

9 Problem 2 Given a sequence of ‘n’ real numbers S Is there a non-empty subsequence X such that ∑ x ∈ X x ≤ C -2853-58-991327-55-31-9112-87-68

10 Problem 2 Given a sequence of ‘n’ real numbers S Is there a non-empty subsequence X such that ∑ x ∈ X x ≤ -175 -2853-58-991327-55-31-9112-87-68 Solution?

11 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

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

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

14 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?

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

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

17 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?

18 Is The Given Problem Easy? ✗

19 Why Is The Given Problem Easy? Part I

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

21 How Hard is a Hard Problem? Part II

22 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

23 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

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

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

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

27 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

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

29 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

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

31 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

32 Elie Wiesel

33 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

34 During the Class … Tip 2: Clarify your doubts

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

36 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

37 Questions?


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

Similar presentations


Ads by Google