3 Pages

LEC8NOTES

Course: FM 360, Fall 2009
School: Washington
Rating:
 
 
 
 
 

Word Count: 559

Document Preview

Log I. Transportation. The manager of a small private company must decide how to supply his three mills with wood cut from three logging sites he will be operating next month. He would like to minimize the total daily travel cost from the logging sites to the mills. He has gathered the following information. It costs him $1.50 per mile to run his trucks. The one way travel distances are as tabulated: Logging Site...

Register Now

Unformatted Document Excerpt

Coursehero >> Washington >> Washington >> FM 360

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.
Log I. Transportation. The manager of a small private company must decide how to supply his three mills with wood cut from three logging sites he will be operating next month. He would like to minimize the total daily travel cost from the logging sites to the mills. He has gathered the following information. It costs him $1.50 per mile to run his trucks. The one way travel distances are as tabulated: Logging Site 1 2 3 Distance in miles between logging sites and mills Mill A Mill B Mill C 8 15 50 10 17 20 30 25 15 Each load requires a round-trip from mill to site and back. Each mill must have a continuous daily supply of wood to keep the various operations working efficiently. The minimum number of truckloads required daily for each mill is 25. Each logging site can produce, at a maximum, the following truckloads daily: site 1, 20 loads; site 2, 30 loads, and, site 3, 25 loads. Formulate the problem as a set of linear equations to determine how many loads should be shipped daily from each logging site to each mill. Let Xij be the number of loads per day shipped from site i to mill j. II. Mill Log Purchase. The management of a small mill has requested your assistance in addressing a log procurement problem. The issue involves the letting of contracts for the mill log supply during the next two quarters. In the first quarter the estimated log consumption is seven million board feet and in the second quarter the mill will need at least eight million board feet. Discussions with their three primary log suppliers and the mill accounting staff have produced the following tabulated information: Price per Mbf Gypo 1 $43.00 Quarter 1 Gypo 2 $45.00 Gypo 3 $48.00 Gypo 1 $34.00 Quarter Gypo 2 2 $35.00 Gypo 3 $33.00 The upper limit on the total supply of logs procurable in either quarter is determined also: Gypo 1 6MM Gypo 2 7MM Gypo 3 5MM Set up the linear program that will minimize the total purchase cost of logs while meeting mill raw material requirements. III. Mill Log Purchase 2. You are a small mill operator and you are buying your logs camp-run from several gypo loggers at $200 per Mbf. A grade scale on several truck loads from each gypo shows the following: UTILITY LOG 20 20 10 PERCENTAGE IN EACH GRADE NO 4 SAWLOG NO 3 SAWLOG 30 30 20 30 20 60 NO 2 SAWLOG 20 30 10 GYPO 1 2 3 The current market price on these grades is known to be: LOG GRADE PRICE/MBF UTILITY LOG $50 NO 4 SAWLOG $162 NO 3 SAWLOG $200 NO 2 SAWLOG $234 You need 150Mbf per day to feed your mill. Your after milling profit or loss on each of the grades is: LOG GRADE PROFIT OR LOSS/MBF UTILITY LOG -$150 NO 4 SAWLOG -$50 NO 3 SAWLOG +$50 NO 2 SAWLOG +$80 You have two allocation alternatives with the logs ...

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:

Washington - PBIO - 509
PBio 509/Neubeh 541 Clifton Assignments Reading Assignment 1. Basic neuroendocrinology and the anatomy of the hypothalamus. (Available on web site) 2. Moore CR and Price D. Gonad hormone functions, and the reciprocal influence between gonads and hypo
Washington - FM - 360
Harvest Scheduling A small landowner is currently growing 150 hectares of Monterey Pine. Because of rising taxes and other disincentives he wants to convert this land to another use. He plans to spread out this stand conversion over the next fifteen
Washington - BBUS - 490
Module 1 Futures, forwards, and swapsThe Nature of DerivativesA derivative is an instrument whose value depends on the values of other more basic underlying variablesExamples of Derivatives Swaps Options Forward Contracts Futures Contracts
Washington - ECON - 512
Volatility Signature Plots Observed log price (transaction price or mid-quote) for day i = 1, . . . , n is denoted pi ~ Divide each day into M subperiods and define = 1/M. This creates a regularly spaced time clock Align observed prices to tim
Washington - ECON - 512
Financial Econometrics Eric Zivot April 30, 2002 Revised: May 2, 20021Lecture Outline Characteristics of High Frequency Data Bid-Ask Bounce Nonsychronous Trading Empirical Analysis of Transactions Data2Characteristics of High Frequency Da
Washington - ECON - 424
Econ 424 Lab 1 Fall 2008Due: Wednesday, October 1Part I. Excel exercises Go to http:/finance.yahoo.com and download monthly data on Starbucks (ticker symbol sbux) over the period March 1993 to March 2008. See the Homework page on the class website
Washington - ECON - 583
The World Price of Covariance Risk Campbell R. Harvey The Journal of Finance, Vol. 46, No. 1. (Mar., 1991), pp. 111-157.Stable URL: http:/links.jstor.org/sici?sici=0022-1082%28199103%2946%3A1%3C111%3ATWPOCR%3E2.0.CO%3B2-B The Journal of Finance is c
University of Illinois, Urbana Champaign - CS - 04
Research Track PosterSPIN: Mining Maximal Frequent Subgraphs from Graph DatabasesJun Huan, Wei Wang, Jan PrinsDepartment of Computer Science, University of North Carolina at Chapel Hill Chapel Hill,NC 27599, USA{huan,Jiong YangDepartment of C
University of Illinois, Urbana Champaign - CS - 591
Research Track PosterSPIN: Mining Maximal Frequent Subgraphs from Graph DatabasesJun Huan, Wei Wang, Jan PrinsDepartment of Computer Science, University of North Carolina at Chapel Hill Chapel Hill,NC 27599, USA{huan,Jiong YangDepartment of C
University of Illinois, Urbana Champaign - CS - 04
T2: Graph Structures in Data Mining Soumen Chakrabarti, Indian Institute of Technology Bombay, India Christos Faloutsos, Carnegie Mellon University, USAIIT BombayCarnegie MellonIIT BombayCarnegie MellonThanksGraph structures in data minin
University of Illinois, Urbana Champaign - CS - 591
T2: Graph Structures in Data Mining Soumen Chakrabarti, Indian Institute of Technology Bombay, India Christos Faloutsos, Carnegie Mellon University, USAIIT BombayCarnegie MellonIIT BombayCarnegie MellonThanksGraph structures in data minin
University of Illinois, Urbana Champaign - CS - 257
Homework 4 CS 257 Assigned Date: 3/3/2005 Due Date: 3/15/2005 in classThis assignment has portions to be handed in electronically and portions to be submitted on paper. Electronic portions are marked [Electronic] and written portions are marked [Wr
University of Illinois, Urbana Champaign - HCHENG - 3
Research StatementHong ChengDepartment of Computer Science University of Illinois at Urbana-Champaign1Research Interests and VisionResearch Interests. My primary research interests are in the fields of data mining, machine learning and databa
University of Illinois, Urbana Champaign - XYIN - 1
Object Distinction: Distinguishing Objects with Identical NamesXiaoxin Yin UIUC xyin1@uiuc.edu Jiawei Han UIUC hanj@cs.uiuc.edu Philip S. Yu IBM T. J. Watson Res. Center psyu@us.ibm.comAbstractDifferent people or objects may share identical names
University of Illinois, Urbana Champaign - HCHENG - 3
Hong CHENGDepartment of Computer Science University of Illinois at Urbana-Champaign 201 N. Goodwin Urbana, IL, 61801 Tel: (217) 721-2339 Fax: (217) 265-6494 Email: hcheng3@uiuc.edu http:/www.ews.uiuc.edu/~hcheng3RESEARCH INTERESTSI have broad int
University of Illinois, Urbana Champaign - JINGGAO - 3
Knowledge Transfer via Multiple Model Local Structure MappingJing Gao , Wei Fan , Jing Jiang , and Jiawei Hanjinggao3@uiuc.edu, weifan@ibm.com, jiang4@uiuc.edu, hanj@cs.uiuc.edu ABSTRACTThe effectiveness of knowledge transfer using classificat
University of Illinois, Urbana Champaign - CI - 336
CONSTRUCTING A BAR GRAPHBEA WINTERS C&I 336 POWERPOINT PRESENTATION
University of Illinois, Urbana Champaign - CI - 336
FINAL PROJECT C&I 336 SUMMER SESSIONBeatrice WintersDATA COLLECTION AND ANALYSISSTATE GOAL 1010.A.1a Organize and display data using pictures, tallies, tables, charts or bar graphCollect organize and analyze data using statistical methods; pre
University of Illinois, Urbana Champaign - CI - 336
FINAL PROJECT C&I 336 SUMMER SESSIONBeatrice WintersDATA COLLECTION AND ANALYSISSTATE GOAL 10 Collect organize and analyze data using statistical methods; predict results; and interpret uncertainty using concepts of probability.10.A.1a Organize
University of Illinois, Urbana Champaign - ECE - 2002
The great interest in factor graphs and the sum-product algorithm wasinitiated by the ability to concisely formulate iterative decodingalgorithms that achieve superior performance. However, one should notmake the error of considering factor graph
University of Illinois, Urbana Champaign - ECE - 459
The great interest in factor graphs and the sum-product algorithm wasinitiated by the ability to concisely formulate iterative decodingalgorithms that achieve superior performance. However, one should notmake the error of considering factor graph
University of Illinois, Urbana Champaign - ECE - 361
Rayleigh and Rician Densities:We want to investigate the density of the real non-negative random variable r which is obtained as r = |ej a + n| where a assumes values 0 and A, is uniformly distributed in [0, 2) and n is a complex gaussian noise var
University of Illinois, Urbana Champaign - ECE - 567
Take-home Final Exam ECE567 Spring 2005 Each problem is worth 25 points. Due: March 12, 5:00 pm The completed exam should be turned in to my CSL mailbox. The final project report should be emailed to me by the exam deadline. Please do not give me har
University of Illinois, Urbana Champaign - ECE - 2002
On the Performance of Low-Density Parity Check CodesLow-density parity check codes are specied by matrix containing mostly 0s and only a small number of 1s. An (n,j,k) low-density code has length n a parity matrix where columns contains j 1s and row
University of Illinois, Urbana Champaign - ECE - 459
On the Performance of Low-Density Parity Check CodesLow-density parity check codes are specied by matrix containing mostly 0s and only a small number of 1s. An (n,j,k) low-density code has length n a parity matrix where columns contains j 1s and row
University of Illinois, Urbana Champaign - ECE - 2002
Some Iterative Decoding algorithms for Linear Block codesNiranjan Ratnakar December 14, 20021AbstractThis report talks about Iterative decoding. It primarily addresses 2 scenarios, when Hard decision is done and the other case when additional
University of Illinois, Urbana Champaign - ECE - 459
Some Iterative Decoding algorithms for Linear Block codesNiranjan Ratnakar December 14, 20021AbstractThis report talks about Iterative decoding. It primarily addresses 2 scenarios, when Hard decision is done and the other case when additional
University of Illinois, Urbana Champaign - ECE - 2002
Space-time Codes and Fixed Point Free GroupsNegar Kiyavash Dec 9, 2002Abstract Space-time code constellations with low encoding and decoding complexity rely on nding a set of unitary matrices for which each pairwise dierence matrix has a nonzero de
University of Illinois, Urbana Champaign - ECE - 459
Space-time Codes and Fixed Point Free GroupsNegar Kiyavash Dec 9, 2002Abstract Space-time code constellations with low encoding and decoding complexity rely on nding a set of unitary matrices for which each pairwise dierence matrix has a nonzero de
University of Illinois, Urbana Champaign - ECE - 2002
S OME I TERATIVE D ECODING A LGORITHMS FOR L INEAR B LOCK C ODESNiranjan RatnakarUniversity of Illinois, Urbana-ChampaignECE459RK Seminar1O UTLINEIterative Decoding algorithm for the Hard-Decision case Iterative Decoding algorithm when soft
University of Illinois, Urbana Champaign - ECE - 459
S OME I TERATIVE D ECODING A LGORITHMS FOR L INEAR B LOCK C ODESNiranjan RatnakarUniversity of Illinois, Urbana-ChampaignECE459RK Seminar1O UTLINEIterative Decoding algorithm for the Hard-Decision case Iterative Decoding algorithm when soft
University of Illinois, Urbana Champaign - ECE - 2002
On the Performance of Low Density Parity Check CodesXiangyu TangOutline Brief introduction of low density parity check codes Performance under optimal decoding Conclusion1Low Density Parity Check codes (LDPC codes) -Specified by matrix c
University of Illinois, Urbana Champaign - ECE - 459
On the Performance of Low Density Parity Check CodesXiangyu TangOutline Brief introduction of low density parity check codes Performance under optimal decoding Conclusion1Low Density Parity Check codes (LDPC codes) -Specified by matrix c
University of Illinois, Urbana Champaign - ECE - 461
University of Illinois, Urbana Champaign - ECE - 567
Problem Set 4 ECE567 Each problem is worth 10 points Spring 2005 Due: April 14 The objective of this homework is to test your knowledge of large deviations and congestion control. There will be office hours from 3:30-4:30 on Wednesday, April 13. 1
University of Illinois, Urbana Champaign - ECE - 567
Problem Set 5 ECE567 Each problem is worth 10 points Spring 2005 Due: May 3 The objective of this homework is to test your knowledge of scheduling algorithms. There will be office hours from 3:00-4:00 on Monday, May 2. 1. In class, we showed that
University of Illinois, Urbana Champaign - ECE - 567
Problem Set 3 ECE567 Each problem is worth 10 points Spring 2005 Due: March 17 The objective of this homework is to test your knowledge of reversibility and queueing networks, and basic large deviations techniques. Do all six problems. Note: There
University of Illinois, Urbana Champaign - ECE - 567
Take-home Exam 1 ECE567 Each problem is worth 25 points. Spring 2005 Due: March 311. Consider a mobile radio that is moving on the integer points of the real line according to a random walk. Let S(n) denote the position of the mobile at time instan
University of Illinois, Urbana Champaign - ECE - 567
Solutions to Problem Set 1 ECE567 Solution 1: Define(n)Spring 2005 P00 = P (S(n) = 0|S(0) = 0).(n)It is easy to see that P00 = 0 for n odd. For n = 2k, P00 Consider(2k)= P (making k jumps to the right and k jumps to the left) =2k (1/2)2k k
University of Illinois, Urbana Champaign - ECE - 461
University of Illinois, Urbana Champaign - ECE - 461
University of Illinois, Urbana Champaign - GE - 288
GE288Homework 6Fall 02Reading Assignment: Notes on duality, available on the course home page. Sections 5.1 and 5.2 of Taha.1. Problem 4, Problem set 4.1A, page 119 of Taha. 2. Problem 4, Problem set 5.2A, page 175 of Taha. Formulate (do not
University of Illinois, Urbana Champaign - GE - 288
Final Exam Topics Everything covered in class and all the homework assignments. These include: LPs: Formulation Interpreting Excel output and sensitivity analysis Graphical solution and sensitivity analysis Tableau method: standard form, identif
University of Illinois, Urbana Champaign - GE - 288
GE288Homework 11Fall 02Reading Assignment: Section 9.2.1 of Taha. 1. Problem 4, p. 379, problem set 9.2A of Taha. (Just graphically verify infeasibility, you dont have to use the B&B method.) 2. Problem 5, p. 379, problem set 9.2A of Taha.
University of Illinois, Urbana Champaign - GE - 288
GE288Homework 4Fall 021. Problem 5, Problem set 3.1A, page 73 of Taha. 2. Consider the following partial simplex tableau for a Max model: CB Basic 20 x1 3 1 -5 30 x2 0 1 0 25 x3 1 0 0 0 s1 1 0 -2 0 s2 -2 1 4 0 s3 0 0 1 RHS 100 200 400Indirect
University of Illinois, Urbana Champaign - GE - 288
GE288Homework 5Fall 02Notes: 1. Class will be cancelled on Oct. 2 and Oct. 4. 2. Office Hours will be cancelled on Oct. 2 and Oct. 3. 3. Quiz 5 will be held on Monday, Oct. 7 in class. 4. I will hold office hours from 2:00-3:00 on Tuesday, Oct.
University of Illinois, Urbana Champaign - ECE - 2002
Brian BagenstoseECE 459 Presentation write-upSome Schemes in Practice: Coding for WirelessWireless systems are in use everywhere today. From radios to clocks to wireless networks to cell phones, wires are seen more and more as a restraint rather
University of Illinois, Urbana Champaign - ECE - 459
Brian BagenstoseECE 459 Presentation write-upSome Schemes in Practice: Coding for WirelessWireless systems are in use everywhere today. From radios to clocks to wireless networks to cell phones, wires are seen more and more as a restraint rather
University of Illinois, Urbana Champaign - ECE - 2002
LATTICE CODES AND THEIR APPLICATIONSAlexia Briassouli459 RK: Advanced Coding Theory Fall 2002References:Sphere Packings, Lattices and Groups (J. H. Conway, N. J. A. Sloane) Coset Codes Part II: Binary Lattices and Related Codes (G. D. Forney J
University of Illinois, Urbana Champaign - ECE - 459
LATTICE CODES AND THEIR APPLICATIONSAlexia Briassouli459 RK: Advanced Coding Theory Fall 2002References:Sphere Packings, Lattices and Groups (J. H. Conway, N. J. A. Sloane) Coset Codes Part II: Binary Lattices and Related Codes (G. D. Forney J
University of Illinois, Urbana Champaign - ALLERTON - 05
Recently Erez and Zamir have shown that a lattice code withlattice decoding can achieve the capacity of the additive white Gaussiannoise (AWGN) channel. This was achieved by using a minimum mean-square error (MMSE) scaling and dithering to transf
University of Illinois, Urbana Champaign - ALLERTON - 05
We introduce the secure biometrics problem, argue that it is becomingincreasingly important, and discuss solutions from both a theoreticaland practical perspective.Essentially, the secure biometrics problem arises because biometricschange from o
University of Illinois, Urbana Champaign - ALLERTON - 05
Our recent proof of the completeness of decoding by list bitflipping is reviewed. The proof is based on an enumeration of all cosetsof low weight in terms of their minimum weight and syndrome weight. Byusing a geometric description of the error pa
University of Illinois, Urbana Champaign - ALLERTON - 05
For assessing the performance of linear programming decoding it isnecessary to know the minimal pseudo-codewords. In this talk we study theminimal pseudo-codewords of some Tanner graphs derived from projectiveplanes and give estimates on their pse
University of Illinois, Urbana Champaign - ALLERTON - 05
We prove that belief propagation provides a practical algorithm for implementing Maximum A posteriori Probability detectionin large CDMA systems. As a byproduct, we rederive Tse-Hanly formula for linear receivers without recourse ro random matrix
University of Illinois, Urbana Champaign - ALLERTON - 05
The behavior of error-correcting codes on ergodic channels, such as classicalGaussian and Rayleigh fading channels, has been extensively analyzed and well understood.Recently, coding for non-ergodic channels has attracted the attentionof researc
University of Illinois, Urbana Champaign - ALLERTON - 05
We argue that for approaching the capacity ofnoncoherent MIMO communication the sum diversity or the chordaldistance of space-time codes can play the primal role.In this work we present a family of Space-Time codesthat have large chordal minimum
University of Illinois, Urbana Champaign - ALLERTON - 05
We present in this talk sequences of ensembles of systematicaccumulate-repeat-accumulate (ARA) codes which asymptoticallyachieve capacity on the binary erasure channel (BEC) with*bounded complexity* per information bit. The results here improveth
Washington - MATH - 404
Math 404 Final Exam SolutionsShort answer questions. 1. State the first isomorphism theorem (for rings, not groups). If : R S is a surjective ring homomorphism with kernel I, then induces an isomorphism : R/I S. = 2. Describe the Eisenstein cri
Washington - MATH - 412
Mathematics 412Final preview 8 March 2006 As usual, clarity of exposition is as important as correctness of mathematics. The actual exam will be closed book, no notes or calculators allowed. There will be room on the paper to write your answers. Sin
Washington - MATH - 412
Mathematics 412Final preview 14 March 2003 As usual, clarity of exposition is as important as correctness of mathematics. 1. Two miscellaneous questions: (a) A friend says, "I've proved that 3x4 + 7x + 25 can't be factored as a product of lower degr