1 Discrete Optimization. 2 The relationship between counting techniques/graph theory and discrete optimization Adding a goal (objective function) to a.

Slides:



Advertisements
Similar presentations
Thursday, March 14 Introduction to Network Flows
Advertisements

1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Shortest Paths Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 9.6 Based on slides from Chuck Allison, Michael T.
Great Theoretical Ideas in Computer Science for Some.
The minimum cost flow problem
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
Computational Methods for Management and Economics Carla Gomes Module 9a Network Models Terminology (Slides adapted from J.Orlin’s)
Math443/543 Mathematical Modeling and Optimization
The Theory of NP-Completeness
Chapter 7 Network Flow Models.
Travelling Salesman Problem an unfinished story...
Facilities Planning Objectives and Agenda: 1. Different types of Facilities Planning Problems 2. Intro to Graphs as a tool for deterministic optimization.
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.
Transportation, Assignment, Network Models
Princeton University COS 423 Theory of Algorithms Spring 2002 Kevin Wayne Greed: Shortest Path s 3 t

Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Graph Theory Chapter 6 from Johnsonbaugh Article(6.1, 6.2)
Maximum Flow Chapter 26.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
IT 60101: Lecture #201 Foundation of Computing Systems Lecture 20 Classic Optimization Problems.
Discrete Structures for Computer Science Muad M. Abu-Ata Summer 2013.
Introduction to problem solving. Introductory Discussion? What problems are you faced with daily? Do you think a computer can be designed to solve those.
Week12 Technology in the e-Factory The roles that technology is playing in the e-Factory: Sensors Connections Actuation Control Systems Integration Industry.
Graph Theory Hamilton Paths and Hamilton Circuits.
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
Discrete Structures for Computing
COMPSCI 102 Introduction to Discrete Mathematics.
Graphs Discrete Structure CS203. Adjacency Matrix We already saw a way of representing relations on a set with a Boolean matrix: R digraph(R) M R1234.
Traveling Salesman Problem (TSP)
Overview of Graph Theory. Some applications of Graph Theory Models for communications and electrical networks Models for computer architectures Network.
Integer Programming (정수계획법)
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
“One ring to rule them all” Analogy (sort of) Lord of The Rings Computational Complexity “One problem to solve them all” “my preciousss…”
Shortest Path Algorithm 2 Prof. Sin-Min Lee Department of Computer Science.
1 Chapter 9 Mixed-Integer Programming. 2 Chapter 9 Enumeration approach for 20 objects (0,1): 2 20 possibilities, evaluate each case for satisfying constraint.
ENGM 631 Minimum Spanning Tree. Prototype Example Seervada Park Trams route smallest total distance Phone lines minimum spanning tree Tram limitations.
CSCE 3110 Data Structures & Algorithm Analysis Graphs (I) Reading: Chap.9, Weiss.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
By: Christophe Dufour Chrishon Adams Mischael Joseph.
I can describe the differences between Hamilton and Euler circuits and find efficient Hamilton circuits in graphs. Hamilton Circuits I can compare and.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Tabu Search Applications Outlines: 1.Application of Tabu Search 2.Our Project with Tabu Search: EACIIT analytics.
Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.
Exhaustive search Exhaustive search is simply a brute- force approach to combinatorial problems. It suggests generating each and every element of the problem.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Introduction to Graph & Network Theory Thinking About Networks: From Metabolism to the Genome to Social Conflict Summer Workshop for Teachers June 27 th.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Maximum Flow Chapter 26.
Routing Through Networks - 1
ME 521 Computer Aided Design 15-Optimization
Discrete Mathematics and Its Applications
Basic Network Analysis
Route Optimization Problems and Google Maps
Integer Programming (정수계획법)
Network Models 7-1.
Integer Programming (정수계획법)
Approximation Algorithms
Discrete Mathematics and Its Applications
Presentation transcript:

1 Discrete Optimization

2 The relationship between counting techniques/graph theory and discrete optimization Adding a goal (objective function) to a counting situation or a graph model makes it a discrete optimization problem.

3 Example: making the scheduling model an optimization problem  There are 4 jobs that should be processed on the same machine. (Can’t be processed simultaneously). Here is an example of a possible schedule:  Original (counting) question: What is the number of all possible schedules?  New (optimization) question: Find a schedule that minimizes the average completion time of the four jobs. Job 3Job 1Job 4Job 2

4 Example: making a graph model an optimization problem  There are n cities. The salesman  starts his tour from City 1,  visits each of the cities exactly once,  and returns to City 1. Original (counting) question : How many different tours are possible? New (optimization) question : Find a minimum- cost tour.

5 Graphs and discrete optimization Adding a goal (objective function) about the amount of some entity in a network makes the network model a discrete (network) optimization problem. Goal: Build a network satisfying certain requirements with minimal cost Move some entity (electricity, a consumer product, people, information) from one point to another in underlying network as efficiently as possible: –Provide good service to the network users –Use the network facilities efficiently

6 Ingredients of some common physical networks ApplicationPhysical analog of nodes Physical analog of arcs Flow Transportation systems Cities, intersections, facilities Highways, airline routes Vehicles, passengers Communication systems Phones, computers Cables, fiber optic links Voice messages, data Hydraulic systems Pumping stations, reservoirs PipelinesWater, gas, oil

7 How to solve discrete optimization problems? Design algorithms! The word algorithm refers to a step-by-step method for performing some action. Some examples of algorithms in everyday life: Food preparation recipes Driving directions Directions for assembling equipment Instructions for filling out income tax forms We will study algorithms for solving discrete optimization problems

8 Solution Process for discrete optimization problems The role of Discrete Mathematics : –Show that the algorithm is correct –Show that the algorithm is efficient –Do careful mathematical analysis to design better algorithms Optimiz. models Real life situation Solution to the model Abstraction, simplifications Design algorithms