EMIS 8373: Integer Programming Mathematical Programming Example 5: Reallocating Students to Achieve Racial Balance updated 18 January 2005.

Slides:

Advertisements

Similar presentations

Convex Programming Brookes Vision Reading Group. Huh? What is convex ??? What is programming ??? What is convex programming ???

Advertisements

Power Functions Lesson 9.1.

Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Copyright © 2015, 2011, 2008 Pearson Education, Inc. Chapter 9, Unit A, Slide 1 Modeling Our World 9.

LPX-1. Linear Programming Models in Services Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.

Charles Delort Markus Hartikainen Dorothy Miller Jouni Pousi

Operations Management

Math443/543 Mathematical Modeling and Optimization

Linear Programming General Form of an LP Model. Linear Programming General Form of an LP Model where the c’s, a’s and b’s are constants determined from.

Environmentally Conscious Design & Manufacturing (ME592) Date: May 3, 2000 Slide:1 Environmentally Conscious Design & Manufacturing Class 24: Optimization.

Linear Programming Applications

Operations Management - 5 th Edition Chapter 13 Supplement Roberta Russell & Bernard W. Taylor, III Linear Programming.

Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.

Linear Programming Models in Services

Computer Science School of Computing Clemson University Mathematical Modeling Murali Sitaraman Clemson University.

Modeling Traffic in St. Louis By Julia Greenberger.

Two Discrete Optimization Problems Problem: The Transportation Problem.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.

D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.

Problem Excel QM and Solver BY: Matthew Held These slides will walk you through solving this problem step by step Summarize problem information 3.

EMIS 8373: Integer Programming “Easy” Integer Programming Problems: Network Flow Problems updated 11 February 2007.

EMIS 8373: Integer Programming NP-Complete Problems updated 21 April 2009.

Reference points for comparison and measurement. Brute Force.

FCAT Update Grades FCAT Reading by Achievement Level Grades 3-10.

Nurse scheduling problem 25 nurses （ Team A:13, B:12 ） Experienced nurses and new nurses 3 shifts （ day, evening, night ）, meetings, days off Time span.

EMIS 8374 Network Flow Models updated 29 January 2008.

Let us consider one producer P and four customers, which are supplied each day with one item of product each. Customers can be supplied only by trucks.

CSE4334/5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai.

Mathematical Proportions in Rhythm

1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.

1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.

Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.

Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.

Review Algebra 1 Chapter

1 Linear Programming: Assumptions and Implications of the LP Model updated 18 January 2006 SMU EMIS 8374 Network Flows.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

Example 1: The Absolute Value Function

INTRO TO ALGEBRA INTEGERS AND ABSOLUTE VALUE Farris 2015.

6.7 Inverse Relations and Functions p405. Ex) Find the inverse.

Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,

EMIS 8373: Integer Programming Combinatorial Optimization Problems updated 27 January 2005.

Chapter 1 Connections to Algebra Review

Systems of Equations and Inequalities

Solver & Optimization Problems

Warm Up 1/14 Balanced or not? = =

continued on next slide

Traveling Salesman Problem

continued on next slide

continued on next slide

Domain & Range from Graphs

EMIS 8374 Node Splitting updated 27 January 2004

EMIS 8373: Integer Programming

Transportation, Assignment and Network Models

פחת ורווח הון סוגיות מיוחדות תהילה ששון עו"ד (רו"ח) ספטמבר 2015

Objective 1A f(x) = 2x + 3 What is the Range of the function

EMIS 8374 Arc-Path Formulation Updated 2 April 2008

Linear Programming Example: Maximize x + y x and y are called

Linear Programming Introduction.

More Normal Distribution Practice!

Relations, Domain and Range

№96 сонли умумий ўрта мактабининг ўқитувчиси Эшанкулова феруза

Unit 30 Functions Presentation 1 Functions, Mappings and Domains 1

Linear Programming Introduction.

continued on next slide

Operations Research.

continued on next slide

Presentation transcript:

EMIS 8373: Integer Programming Mathematical Programming Example 5: Reallocating Students to Achieve Racial Balance updated 18 January 2005

slide 1 Decision Variables Let x ij be the number white students reassigned from school i to school j. Let y ij be the number nonwhite students reassigned from school i to school j. Let w i be the number white students in school i after reassignment. Let n i be the number nonwhite students in school i after reassignment. Let t i be the total number students in school i after reassignment.

slide 2 Constraints The following constraints ensure that all the students are reassigned to a school:

slide 3 Constraints Continued The following constraints the total number of white and nonwhite students in each school after reassignment:

slide 4 t 1 = w 1 + n 1 ( 21 ) t 2 = w 2 + n 2 ( 22 ) t 3 = w 3 + n 3 ( 23 ) t 4 = w 4 + n 4 ( 24 ) t 5 = w 5 + n 5 ( 25 ) 850 · t 1 · 1050 ( 26 ) 680 · t 2 · 840 ( 27 ) 425 · t 3 · 525 ( 28 ) 1020 · t 4 · 1260 ( 29 ) 425 · t 5 · 525 ( 30 ) Constraints Continued The following constraints determine the total number of students in each school after reassignment: The following constraints enforce requirement (2):

slide 5 w 1 ¸ ( 0 : 45 ) t 1 ( 31 ) w 2 ¸ ( 0 : 45 ) t 2 ( 32 ) w 3 ¸ ( 0 : 45 ) t 3 ( 33 ) w 4 ¸ ( 0 : 45 ) t 4 ( 34 ) w 5 ¸ ( 0 : 45 ) t 5 ( 35 ) w 1 · ( 0 : 65 ) t 1 ( 36 ) w 2 · ( 0 : 65 ) t 2 ( 37 ) w 3 · ( 0 : 65 ) t 3 ( 38 ) w 4 · ( 0 : 65 ) t 4 ( 39 ) w 5 · ( 0 : 65 ) t 5 ( 40 ) Requirement (1) The proportion of white students must fall in the range of 45% to 65%.

slide 6 Variable Domains

slide 7 Objective Function: Total Distance Traveled by Bussed Students Minimize (46) subject to (1)-(45).