# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

16 Pages

### Chapter_07_assgnt

Course: WEEK 910, Fall 2009
School: UPenn
Rating:

Word Count: 685

#### Document Preview

Problems Chapter Assignment 7, p. 393-400. Example: Machineco has four jobs to be completed. Each machine must be assigned to complete one job. The time required to setup each machine for completing each job is shown in the table below. Machinco wants to minimize the total setup time needed to complete the four jobs. 1 Setup times (Also called the cost matrix) Time (Hours) Job1 Machine 1 Machine 2 Machine 3...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> WEEK 910

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Problems Chapter Assignment 7, p. 393-400. Example: Machineco has four jobs to be completed. Each machine must be assigned to complete one job. The time required to setup each machine for completing each job is shown in the table below. Machinco wants to minimize the total setup time needed to complete the four jobs. 1 Setup times (Also called the cost matrix) Time (Hours) Job1 Machine 1 Machine 2 Machine 3 Machine 4 14 2 7 2 Job2 5 12 8 4 Job3 8 6 3 6 Job4 7 5 9 10 2 The Model According to the setup table Machinco's problem can be formulated as follows (for i,j=1,2,3,4): min Z = 14 X 11 + 5 X 12 + 8 X 13 + 7 X 14 + 2 X 21 + 12 X 22 + 6 X 23 + 5 X 24 +7 X 31 + 8 X 32 + 3 X 33 + 9 X 34 + 2 X 41 + X 42 + 6 X 43 + 10 X 44 s.t. X 11 + X 12 + X 13 + X 14 = 1 X 21 + X 22 + X 23 + X 24 = 1 X 31 + X 32 + X 33 + X 34 = 1 X 41 + X 42 + X 43 + X 44 = 1 X 11 + X 21 + X 31 + X 41 = 1 X 12 + X 22 + X 32 + X 42 = 1 X 13 + X 23 + X 33 + X 43 = 1 X 14 + X 24 + X 34 + X 44 = 1 3 Xij = 0 or Xij = 1 For the model on the previous page note that: Xij=1 if machine i is assigned to meet the demands of job j Xij=0 if machine i is assigned to meet the demands of job j In general an assignment problem is a balanced transportation problem in which all supplies and demands are equal to 1. 4 Solution Method Although the transportation simplex appears to be very efficient, there is a certain class of transportation problems, called assignment problems, for which the transportation simplex is often very inefficient. For that reason there is an other method called The Hungarian Method. 5 Basic Ideas Suppose we ranked all feasible assignments in increasing order of cost. The ranking does not change if one subtracts the same amount, say, D, from all costs in the same row, since all assignment costs are reduced by D. The ranking does not change if one subtracts the same amount, say, D, from all costs in the same column, since all assignment costs are reduced by D. 6 Basic Ideas (cont'd) An assignment selects one entry in each row and one in each column. As long as all costs are kept nonnegative, if the reduced cost matrix allows a zero cost assignment, that assignment is optimal. If there is zero a cost in each row and a zero cost in each column of the reduced cost matrix, this assignment is optimal. 7 The steps of The Hungarian Method are as listed below: Step1. Find the minimum element in each row of the mxm cost matrix. Construct a new matrix by subtracting from each cost the minimum cost in its row. For this new matrix, find the minimum cost in each column. Construct a new matrix (reduced cost matrix) by subtracting from each cost the minimum cost in its column. 8 Step2. Draw the minimum number of lines (horizontal and/or vertical) that are needed to cover all zeros in the reduced cost matrix. If m lines are required , an optimal solution is available among the covered zeros in the matrix. If fewer than m lines are required, proceed to step 3. Step3. Find the smallest nonzero element (call its value k) in the reduced cost matrix that is uncovered by the lines drawn in step 2. Now subtract k from each uncovered element of the reduced cost matrix and add k to each element that is covered by two lines. Return to step2. 9 Setup times (Also called the cost matrix) Time (Hours) Job1 Machine 1 Machine 2 Machine 3 Machine 4 14-5 2-2 7-3 2-2 Job2 5-5 12-2 8-3 4-2 Job3 8-5 6-2 3-3 6-2 Job4 7-5 5-2 9-3 10-2 10 Setup times (Also called the cost matrix) Time (Hours) Job1 Machine 1 Machine 2 Mac...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UPenn - WEEK - 910
CHAPTER 9: INTEGER PROGRAMMINGto accompany Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam VenkataramananPresentation by H. Sarper1Copyright 2003 Brooks/Cole, a division
UPenn - WEEK - 910
a58dab0a4bc93c11b56954b41d8a672e8a6bc6ed.xlsOptimal Portfolio Selection (Data from 15.401 Finance Theory I) optimal yearly returnAvg returnamzn 2.12% aol 1.68%Monthly (8/96-8/01)bos 0.66% bpt 0.45% ca 1.30% ed 0.39% emn 0.76% f 0.88% fbf 1.07%
UPenn - WEEK - 910
GOMORY CUTSConsider the LP relaxation of an investment problem (integer data) maximize 16x1 + 22x2 + 12x3 + 8x4 +11x5 + 19x6 subject to 5x1 + 7x2 + 4x3 + 3x4 +4x5 + 6x6 14 end sub x1 1 sub x2 1 sub x3 1 sub x4 1 sub x5 1 sub x6 1 The optimal soluti
East Los Angeles College - OPEN - 8717
66th Annual Meteoritical Society Meeting (2003)5160.pdfBIOLOGICALLY-INDUCED ELEMENTAL VARIATIONS IN ANTARCTIC SANDSTONES: A POTENTIAL TEST FOR MARTIAN MICROORGANISMS. R. L. Blackhurst1, K. Jarvis1 and M. M. Grady2, 1Dept. of Geological Sciences,
Stanford - CS - 110
CS110 - Handout #6Agenda for Today Structuring Systems with Clients and ServicesCS110 Mendel Rosenblum Why we need better modularity that procedures give us Enforced modularity Client and services Only communication using messages Example o
East Los Angeles College - OPEN - 119
GEOPHYSICAL RESEARCH LETTERS, VOL. ?, NO. , PAGES 111,On the interpretation of gravity variations in the presence of active hydrothermal systems: Insights from the Nisyros Caldera, GreeceJ. Gottsmann Institute of Earth Sciences Jaume Almera, CSIC,
East Los Angeles College - OPEN - 5936
TOWARDS A GLOBAL MODEL OF THE MARTIAN ATMOSPHEREM. Angelats i Coll, F. Forget, F. Hourdin, Y. Wanherdrick , Laboratoire de Mtorologie Dynamique, Paris, France, (malmd@lmd.jussieu.fr), M.A. Lpez-Valverde, F. Gonzlez-Galindo, Instituto de Astrofsica d
East Los Angeles College - OPEN - 15307
Author's Accepted ManuscriptIn situ radiometric dating on mars: Investigation of the feasibility of K-Ar dating using flight-type mass and X-ray spectrometers D.L. Talboys, S. Barber, J.C. Bridges, S.P. Kelley, D. Pullan, A.B Verchovsky, G. Butcher
East Los Angeles College - OPEN - 7686
The effects of brief and elaborate mood induction procedures on young children's drawingsDr. E. Burkitt Department of Psychology University of Portsmouth *N. Barnett Department of Psychology University of SussexAddress for correspondence: Dr. Est
East Los Angeles College - OPEN - 6335
European Cells and Materials Vol. 11. Suppl. 3, 2006 (page 38)ISSN 1473-2262Development and validation of a 3D lymph node-adipocyte co-culture systemS.Daya , A. Loughlin &amp; H. MacQueen Dept of Biological Sciences, The Open University, Milton Keyn
UPenn - WEEK - 910
MAX 5100 C + 5000 R SUBJECT TO 2) C + R &lt;= 100 3) 200 C + 100 R &lt;= 12000 4) 50 C + 120 R &lt;= 13000 END
UPenn - OPIM - 910
Group 8 - Investment Management Jian's project Nothing to say.My comments A very similar project was done (very well) last year. You should do something a bit different. You might want to target a specific investment type, like a retirement fund. Y
UPenn - OPIM - 910
Investment ManagementHelen Kim Jiaqi Tang Monish Wadiwala Xiao ZhangProblem Statement In finance, a portfolio is an appropriate mix of or collection of investments held by an institution or a private individual. By owning several assets, certain t
UPenn - OPIM - 910
Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner's dilemma)1MIT and James Orlin 20032-person 0-sum game theoryPerson R chooses a row: either 1, 2, or 3 Person C chooses a column: either 1, 2, or
Stanford - CME - 358
The Finite Element Method for Fluid Mechanics Spring 2009 - CME 358 - Stanford UniversityJean-Frdric Gerbeau e e INRIA Paris-Rocquencourt &amp; Stanford University Charbel Farhat Stanford University April 7, 20092Chapter 1Finite Elements for Coerc
CSU Northridge - M - 24771
Math 310 j Spring 2007 j Test #2 j 100 pts j NAME&lt; (9) 1-3. True-False: Write in the blank T for each true statement, F for false. 1. a. b. c. 2. a. b. c. 3. a. i. k. Every square is a rectangle. Every rectangle is a trapezoid. A rhombus is a square.
S.F. State - MKTG - 649
MKTG 649-_, _, 200*, Group Project: Preliminary Proposal (Sample) Group # _, Page # 1MKTG 649 (Section #_), _ 200* Group Project: Preliminary Proposal Prepared by Group #_ Group Members: Name One, Name Two, Name Three, Name Four, Name Five IDEA #1
S.F. State - MATH - 165
MATH !\$Homework3/1216Reminder: We'll have a midterm on March 23. (1) Compute the following products. Sketch a picture that helps you get the answer. (a) 423 265 (b) ! (2) Find the missing digits for the multiplication problems below. Explain
UPenn - OPIM - 910
Group 9 - Resource Leveling Jian's comments I don't think their second solution should be called an alternative solution, since it is the result of some relaxed constraints. Thus, they'd better divide their problem into two parts. First, strictly fol
University of Texas - COLA - 092
The Center for Russian, East European and Eurasian Studies and the Social Science Research Council (SSRC) present:Current Trends and Future OptionsEurasia Program Coordinator, SSRCMs. Kirchoff will address career paths and jobs available to gradu
UPenn - CHAPTER - 910
Introduction to Optimization1MIT and James Orlin 2003What is Operations Research? What is Management Science?World War II : British military leaders asked scientists and engineers to analyze several military problems Deployment of radar Man
UPenn - OPIM - 910
Heuristic SearchMIT and James Orlin 20031Two types of Complexity.x1. Problems with complex and conflicting objectives subject to numerous restrictions. mostproblems in practicex2. Problems that may be easily understood but for which
S.F. State - MATH - 335
Math 335: Midterm 1, SFSU, March 18, 2009 Instructor: Joseph Gubeladze Problem 1. Let G1 and G2 be groups. Show that the group G1 G2 is commutative if and only if both G1 and G2 are commutative. Solution. For any x1 , x2 G1 and y1 , y2 G2 we have x
S.F. State - MATH - 335
UPenn - OPIM - 910
Group 4 - Flag Football League Season Scheduler Jian's comments This project sounds reasonable, it only considers 10 teams and a single cycle. They can denote Xij as the day that team i plays with team j. By doing this, they can simply use 45 variabl
UPenn - OPIM - 910
Capital Budgeting Spreadsheetbudget NPV 1 5 16 2 7 22 3 4 12 Items considered 2 0 0 0 0 0 16 16 22 22 22 22 22 38 38 38 4 3 8 5 4 11 Value Table Budget Used 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 16 16 16 16 1
UPenn - OPIM - 910
Group 11 Optimization modeling for an NBA franchise Jian's comments They got reasonable assumption, objective function and constraints. I think they will do fine. Ps. If an NBA franchise can be formed after such kind of calculation, there will be mu
Maryland - LING - 499
Child language processing Child language processing Memory constraints Memory constraints Subj vs obj gap asymmetrya. The reporter [ that t attacked the senator ] . b. The reporter [that the senator attacked t ] .Seidl, Hollich and Jusczyk (200
Maryland - LING - 499
De Villiers and Roeper: Relative clauses are barriers to whwhmovement for young childrenSherrod WrightBackgroundSubjacency Principle: Movement may not cross more than one bounding node node. Bounding nodes are IP(S), CP(S'), and NP Languages dif
Maryland - LING - 499
Lab 3 writeup Lab 4 instructionLing499a Spring 2009Plan Midterm grades: This weekend! Mid term grades: This weekend! Next Thursday: Class cancelled (I'll be in france) Paper Presentations: Shannon, Erica, faisal and michael d i h l Lab 3 wri
UPenn - OPIM - 910
ESE 504: Fall 2008 Professor Monique Guignard October 16, 2008 Introduction to Optimization Big Project Proposal Group Name: Go Green Members: Kellie Bucha, Satyajit Reddy, Lemuel Rogers, Keith SchellhornTransportation for StudentsA group of stud
UPenn - OPIM - 910
Group 3 Transportation for students Jian's comments: I think they'd better solve for one student's optimal schedule, then go forward to a group of students'. They mentioned an idea of total value, which is quite interesting. By defining this, they m
UPenn - OPIM - 910
This describes a game At each stage you can try to win 2, 3 or 6 If you can get to 20 in 10 moves, you win Value Probability of winning 2 5/ 6 3 1/ 2 6 1/ 6Rounds Remainingscore 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 1
UPenn - OPIM - 910
Non Linear Programming 1Nonlinear Programming (NLP) Modeling Examples1MIT and James Orlin 2003Linear Programming ModelMaximize c1 x1 + c2 x2 + . + cn xn subject to a11x1 + a12 x 2 + . +a1n xn a 21 x1 + a 22 x 2 + . +a 2n xn M M x1 , x2 , .
UPenn - OPIM - 910
Non Linear Programming 1 Nonlinear Programming (NLP) Modeling Examples1MIT and James Orlin 2003Linear Programming ModelMaximize c1 x1 + c2 x2 + . + cn xn subject to a11x1 + a12 x 2 + . +a1n xn a 21 x1 + a 22 x 2 + . +a 2n xn M M x1 , x2 , ..
UPenn - OPIM - 910
ESE 540 Final Project Proposal Yu Tazawa Aditya Mehrotra Hongzhi Ma Jian Luo The Gym Workout Project Different gym equipment work out different muscles. Most of the machines work out more than one muscle in different ratios. (for example, a bench pre
Long Island U. - LIS - 650
LIS650 lecture 3 Web site designThomas Krichel 2004-12-04Web site design This is supposed to be a big topic in the LIS community. There are a lot of articles about using individual web sites, but there is little scientific material out there rel
UPenn - OPIM - 910
GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of th
UPenn - OPIM - 910
# \$Id: MAINTAINERS 13762 2005-12-15 15:51:59Z zorglub \$## VLC MAINTAINERS## This file lists all modules of VLC, and presents who's responsible for# what. &quot;Responsible&quot; doesn't mean this person will be alone to improve
UPenn - OPIM - 910
\$Id: README 13082 2005-11-01 20:50:07Z dionoea \$README for the VLC media player=The VideoLAN web site . . . http:/www.videolan.org/Documentation . . . . . . . http:/www.videolan.org/doc/Support . . . . . . . . . . http:/www.videolan.org/suppor
UPenn - OPIM - 910
\$Id: THANKS 18225 2006-12-03 15:53:10Z xtophe \$VLC makes extensive use of the following persons' code:Aaron Holtzman &lt;aholtzma at ess.engr.uvic.ca&gt; - AC3 decoder, MPEG video decoderMichel Lespinasse &lt;walken at zoy.org&gt; - AC3 decoder, MPEG audio
UPenn - OPIM - 910
Nonlinear Programming Theory1MIT and James Orlin 2003Difficulties of NLP ModelsLinear Program:Nonlinear Programs:2MIT and James Orlin 2003Graphical Analysis of Non-linear programs in two dimensions: An exampleMinimize subject to( x
Long Island U. - MYWEB - 512
January 22, 2008LIS 512: Introduction to Knowledge OrganisationMargaret Kipp margaret.kipp@gmail.com http:/myweb.liu.edu/~mkipp/Course ResourcesCourse Time:Westchester Campus, Spring 2008, Tuesday 4:45 - 6:45 http:/myweb.liu.edu/~mkipp/51
UPenn - OPIM - 910
Group 12 Emergency evacuation plan Jian's comments There might be two problems for them: 1. For different incidents, there should be different evacuation plan, i.e. they need different plans for earthquake and fire. They'd better specify which kind
University of Texas - BUENOF - 30805
Copyright by Fernanda Vitor Bueno 2007The Dissertation Committee for Fernanda Vitor Bueno Certifies that this is the approved version of the following dissertation:The Myth of Camila O'Gorman in the Works of Juana Manuela Gorriti, Mara Luisa Bemb
S.F. State - ECON - 612
Project Assignment, Part 1 (10%) Case Study: The Asian Financial Crisis In-Class Discussion: April 20th, 2006Overview Although the Asian financial crisis is often dated from July 1997 to the fall of 1998, in this case we see that the crisis goes f
CSU Northridge - COMP - 450
Chapter #3 NetworkingMain Issue Standalone computer limited in utility (word processing, spreadsheets, play games, etc.) Networked computer allow exchange of email, files, distribution of tasks (eg. multi-user gaming) Conditions for increased ut
UPenn - OPIM - 910
Project Proposal for ESE 504 Final ProjectDavid Pietrocola Farhat Fatma Suhan Lu Yueting ShenLeads Maximization from Tradeshow ParticipationXYZ Distributors (business name withheld) is a small business enterprise that imports and distributes orna
UPenn - OPIM - 910
Group 2 NBA Scheduling Um., this problem might be too complicated to be finished in about one month by a group of four people. I just asked a friend, who is an NBA fan, about the schedule of NBA. He told me that it is almost completely random. So I
UPenn - OPIM - 910
Group 1 Proposal - Yahoo! MailPage 1 of 1Group 1 ProposalFrom: &quot;Buckle, Matthew&quot; &lt;matthew.buckle@lmco.com&gt; To: opim910@yahoo.comThursday, October 16, 2008 2:22 PMCc: &quot;Buckle, Matthew&quot; &lt;matthew.buckle@lmco.com&gt;, &quot;Chowdhury, Dipnil&quot; &lt;dipnil.ch
UPenn - OPIM - 910
Group 1. Jian's comments: I am not familiar with the online wagering games actually, so I can not say much about this. But I think maybe there is one point that this group should take care of, which the possibility of winning the guaranteed prize poo
CSU Northridge - BUS - 497
12Managing Innovation and Fostering Corporate EntrepreneurshipCopyright 2008 The McGrawHill Companies, Inc. All rights reserved.McGrawHill/Irwin Strategic Management: Text and Cases, 4e12 - 2Innovation - Terminology Creativity- Original an
Stanford - PUBS - 22377
University of Texas - OLD - 305
EXAM 1 REVIEW GRG-305, This Human World Prof. Adams Note: this is a partial list, intended as a resource not a study guide; topics not on this list may appear on the exam and not all topics on this list will appear on the exam. Vocabulary human geogr
Stanford - ME - 221
Toastmaster Chopster Barrett Heyneman, Linus ParkInventory Analysis: 1) Copper had the greatest impact. This is most likely due to the severe environmental effects of mining and producing copper material 2) Plastics have the next largest impact, con
Allan Hancock College - CMS - 3010
Module 2b Economic discourse1Module 2b Economic discourseOverviewLearning resourcesSelected readingsSelected reading 3: Beder, S &amp; Shortland, M 1992, `Siting a hazardous waste facility: the tangled web of risk communication', Public Unders
Allan Hancock College - CMS - 3010
S.F. State - ITEC - 894
STEP 3: DECIDEI. DIRECTIONS Locate your completed Discover Worksheet and completed Explore Worksheet. Next, write down the name of the first major you want to evaluate in the Preferences/Major Comparison Chart located below. Review the resul
University of Texas - MAJOR - 0204
THIS PLAN IS AN UNOFFICIAL ASSESSMENT TOOL.*PLEASE REFER TO A DEGREE AUDIT FOR YOUR SPECIFIC REQUIREMENTS TOWARD A BBA DEGREE*2002 2004(Expires August 2010)INTERNATIONAL BUSINESSThe University of Texas at Austin McCombs School of Business htt
University of Texas - MAJOR - 0204
*PLEASE REFER TO A DEGREE AUDIT FOR YOUR SPECIFIC REQUIREMENTS TOWARD A BBA DEGREE*THIS PLAN IS AN UNOFFICIAL ASSESSMENT TOOL.2002 2004(Expires August 2010)MARKETINGThe University of Texas at Austin http:/www.mccombs.utexas.edu/udean/ McComb
Allan Hancock College - CMS - 3010
Module 3b Global economy1Module 3b Global economyOverviewLearning resourcesSelected readingsSelected reading 9: Beder, S 1998, `Challenging the corporate agenda', in B Gleeson &amp; P Hanley (eds), Renewing Australian planning new challenges,