lecture mb 1

Upload: alex-ch

Post on 05-Nov-2015

223 views

Category:

Documents


0 download

DESCRIPTION

discrete optimizatino 1

TRANSCRIPT

  • Discrete OptimizationMail Bag - Week 1

  • Goals of the LectureWeekly update on your progress

    (in aggregate)" something unique to this session"

    "

    This time" overview of the student body" progress on the assignments" common questions" hints for the next few weeks

    2

  • Overview of the Student Body8,000 students active"

    4,000 intend to do all of the homework" 5,000 intend to watch all of the videos"

    "

    4,500 to 2,300 views on introductory videos""

    2,000 students registered in the last week" would love to see 2,000 more (tell your friends!)"

    "

    We have a lot of auditors" common in MOOCs

    3

  • Overview of the Student Body

    4

  • Overview of the Student Body

    5

  • Overview of the Student Body

    6

    Carletons Home State

  • Overview of the Student Body

    7

  • Overview of the Student Body

    8

  • Overview of the Student Body

    9

    Tasmania

  • Overview of the Assignments1,500 students active in assignments"

    submitted any part of an assignment""

    12,900 submissions made" AWESOME work!"

    "

    Knapsack assignment" 700 students active"

    "

    Graph Coloring assignment" 80 students active

    10

  • Cumulative Grade Distribution

    11

    On Track

    You Win!

  • Common Questions

    12

    The grader feedback says capacity constraint violated! Check that the order of your variables

    matches the input order.""

    Why is Branch and Bound still exponential?

  • Exponential Branch and Bound ExampleExaggerate"

    Assume that we have many items, all with essentially the same ratios"

    We will explore many of these alternatives because the lower bound will not differentiate then"

    Consider" capacity 701" item weights: 2, 2, 2, 2, 2, 2, 2,...., 2, 1" item value: 2.00001,...., 2.00001, 1"

    Of course, there are ways around it" some are in the lecture slides (but later)

    13

  • Some SuggestionsPeer discussion is essential in this class,

    i.e. we need you!" Share your experience on the assignments in the

    forums (especially if what you tried worked!)""

    The forums are the core discussion venue, but" Facebook Group (connect with alumni)" Twitter, @DiscreteOptimiz, #dopt002" IRC Chat, #coursera-optimization, on freenode.net" All details in the Socialize course page

    14

  • Whats Next?

    15

    The Knapsack warmup round is over..." time for serious optimization"

    Graph coloring is hard" you have 2 weeks, start EARLY" dont expect to find an optimal solution to

    every instance" remember, 7 on every part is like an A grade" 10 on every part is like an A+++"

    Good News!" graph coloring is discussed all over the

    lectures

  • Whats Next?

    16

  • Have Fun!

    17

    Thanks for all the positive feedback" we worked hard to prepare this" you show us, it was worth the extra effort"

    "

    Tell your friends to join the course, it is all about the community"

    "

    Keep up the awesome optimization!

  • Have Fun!

    18