YORK UNIVERSITY. Faculty of Science and Engineering Faculty of Liberal Arts and Professional Studies MATH A Test #3.
|
|
- Monica Lucinda Bradford
- 5 years ago
- Views:
Transcription
1 YORK UNIVERSITY Faculty of Science and Engineering Faculty of Liberal Arts and Professional Studies MATH A Test #3 July 25, 212 Surname (print): Given Name: Student No: Signature: INSTRUCTIONS: 1. Please write your name, student number and final answers in ink. 2. This is a closed-book test, duration- 75 minutes. 3. No calculator is permitted. 4. There are six questions on eight pages. Answer all the questions. 5. Show all work necessary to justify each answer you give. Clearly indicate each time you use the back of a page for your work. 6. Remain seated until we collect all the test papers. 7. Do the easiest questions first. GOOD LUCK! Question I Points I Scored I Total: 6
2 Name: Student No: 1. ( pts) (a) For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For this question, each correct answer is worth 1.5 point and each incorrect answer is worth -.5 (negative half!) point. If the number of incorrect answers is more than three times greater than the number of correct ones, then the total mark will be zero. If you don't know the answer, don't write anything. For this question only, you do NOT need to explain your answer or show your work. I Statement I TRUE/FALSE I Sensitivity analysis allows to determine how much can the RHS of a constraint be changed without changing of the optimality of a basic feasible solution. r-r'ru.e_ Sensitivity analysis is used to determine the range of values for an OFC of a basic variable, within which the optimal objective value remains unchanged. -f;i?sz._ Faiee- A weak duality may be used for getting an upper bound for optimal objective value of the primal (max) LP. If the dual LP is unbounded, then the primal LP is infeasible. In a balanced transportation problem with m sources and n destinations the number of basic variables is m + n. An assignment problem is a balanced transportation problem. 'Tvu.c 'T'rUL Fdce_ 1
3 Name: (b) Using the LINDO output bellow, answer the following questions: Student No: i. If the RHS of the second constraint is changed from 1 to 7, (and the first RHS is still 5) what is the new optimal objective value?.i.l r/je.ww.m- t't... fu R/{ $ of Jk "'-cf COtt <::A-vcut.;{. ANSWER: 4 _Lt 3 > UM-J ffj... du.af fv"e-'cl o.p1t-e.?.ta.of 1:- 'YCM--wi..:s -. i>. Hu; V\ 2 opt-.+ 3 (--1. )-=- 1'3,4. ii. If the OFC of X2 is changed from 3 to 5, what is the new optimal objective value? -ft._.t.. OF C!. o.f X t. s t:a-eve.m.e.cf ANSWER: J.."f. b 5-3 -=-(t).,wi.-t:e-l c<; t\... o re_. So) tk opfc.:l-1.<o. :t<j t.'> U-6 t o.ffe.clecp.f:l nht<- w...ai_ o s'e.c>h 'l,..e... V opt- ( ) If zopf-=- 1.i>.S + (5""-3)X -=- g.g ;-..t Lt.4 MIN X1+3X2+2X3 SUBJECT TO 2) 3Xl-2X2+X3>5 3) Xl+X2+X3 >1 4) -2Xl+3X2-X3>2 END OBJECTIVE FUNCTION VALUE 1) , g -+. -:::- e2. :f. b. VARIABLE Xl X2 X3 ROW 2) 3) 4) VALUE SLACK OR SURPLUS 3... REDUCED COST...6 DUAL PRICES (;-:- 4 RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X X X3 2. INFINITY.6 RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE INFINITY 3 1. INFINITY
4 Name: Student No: 2. ( pts) Consider the LP: max z = 4xl subject to 8x1 6x1 +x2 +3x2 +2x2 +2x3 +x3 +x3 X1 7 X2, X3 < 2 < 8 2: and its optimal tableau f Z X1 X2 X3 S1 S2 RH S ] (a) Write the dual LP and determine its optimal solution. <fk.e_ ka.f_ L P t 1Mi (A_ w- -= c1 'cj 1 + g ra 2. S. {;. g1 + 6"'2.. Lt 3ce -r 62.-'cf 'c!2.. '>- 1., l<j 2.. f V'OiM._..tk_ t tj...eficjv.-l. rov-= \J<.:3)1 > ) [: 1= f-{ut) 'ijud. 1hevvt {U_ ettt:a..r &v.- LP [<t:pt 'i:f J = SI{ - = cj._ 1 L ] = c o J OM. J< Us opf--=- z_o pf 4. e.--f.m-.._, w-ot>f- = L( > tj (>f--.i, a... of 1 :!1-. 3
5 Name: Student No: (b) Determine the range of values for the objective function coefficient of x 3 for which the current basis remains optimal. Hint: Recall that row has the form z + (cbvb-l N- CNBV )xnbv = CBV s- 1 b. su.. & V "= \_'X 3,.&2-1? fu_ fa_r ANSWER: Cg 6 [, oe> J..e,- B -=- [ 1 o 1 1 -= r 3 ] - _ [L 1 1 j ) A L-.1, ) c N'B v - ( _J. Le.f eb '";:::.. [c!> o1 ) '1(!?:. E \'R..fk e_u_x-v S -, - \e..\m.(llu)) ott" CB\f rj- CNr1\f c2::::> r o] r 3 A ' - L-4 " o l > o C?> [ (':> o J lo 1\ \_-.t -J.. -1) j...\ _... ( c - 4 '3 3 - e. 3. J. J g C 3-4 > 3 c 3-1 &x' C. ll:e-1 cfw X.... C 3 E [ J eo) (c) Determine the range of values for the objective function coefficient of x 1 for which the current basis remains optimal. 1h Cu/frewi & rev tv\ ot.f,;l-uap c:: 1 ] trro'i>ljej.f:tt.e.j 1:.-e_ cure.j{"? ANSWERo C, C C, 6. 1_ i ) lj,-= 1 Ye.IM.4.-t. <{ ' so 1 M.u_Y'f CV/ALg u -+- (ju >- c -="> J. T- CA. (!"6 <1\ <12 :.- ".. '1c.,{;(-s:o.o, G] &. cu.v-v 4 s r L-Vl ort- t4a-e. (d) Were we add the constraint x1 + x2 + X3 ::; 5, would the current basis (i.e., x 3, s 2 ) remain optimal? Explain. 1fu_.rewt t's'" 'J'- ANSWER: "d -2. of> 4 'N< fit "Jc,opf = Xf =D x;p(--.l. 1/,u:s t- VeM- W"> f'e..m-t t-el Lb--ke.vL o..jj CU.:wt '"JC 1 -t- )(2- -t X.. 1 2).. C!.,tv/vJ -t..- Ve-u<eu- 4
6 Name: Student No: 3. (4 + 4 pts) Given the LP for minimizing the total transportation cost of a certain commodity: subject to min z = 9xu + 2x12 + Sx21 + lox x31 + 8x32 Xu + X12 X31 xu + X21 + X31 X12 + X22 xu, X12, x2l, X22, X3l, (a) Write down the corresponding transportation tableau. + X32 + X32 X32 > 1 = 2 = = s, )\ SL.$ 1J 4- '):_2.\ li_ 4o w _w ')c._ 3\ (b) Use the minimum-cost method to find a BFS for the problem. ANSWER: s" 1_2_ AKf M:fo $2_ rj.1). / s> 4 S.o 7 BfS t.5 x -=- 1- ;c. L \ -=- 2 a ) ) x,.,n ')C..? o l - ovj ) ;.2._ O.eR 1-k ofu..e e.. U&Y<;. OAd -=-cd. 4
7 Name: Student No: 4. (6 pts) Use Vogel's Method to find an initial BFS for the transportation tableau: I) _.., () 5+ ':)-+eio...;...j_-=-6-==- O+':)+lD -tcflo, <;;) Pv- t.'s (96t' p :t' l ') -::::... ") ':t 4.-= ')c -=- o 1 7C :3. 2 -=- x tr 2- -:::. 5' ) x 4 -:=... 3 JD G.RJ_ k s: Cl+".e... N f3, \f <k =-o. c - J...J -;;::. (,[;) ro 1/-o o { ol@-- 5. ( pts) Consider the transportation tableau b in part (a) with a basic feasible solution. A.3 (a) Calculate the reduced costs for all nonbasic variables. Is the BFS optimal? Explain. -+ }) + 55' -t- 4 -=-- { b '$"-:=- 4 + '1 + ANSWER: () -4: w + w' ) TP L<;. cu;(( "#=-'DNBVs -=- t1tt k.. -(l+l+-t-) = l{g- +=-g. kt u. =- caf_j..cvfe_ 15- J &-J.J 7 U.4, '15".;, Lt2-, u-lf a..._j u?:> u-,.-:::: t- u-..2-= :> 'l5:- 5" L re..ctnv"k ' l,..( k >- ul.(=--\ - /J ' D 1 D2 D3 D4 ')W'IM-c.A. (t:;l._. u-o 51 - ()...2.-"='4 u \::_ \2. \ \.::_ e \.2 /X) _ ol\ =-n l ' L{. + 1.r.- e... =o t.. J LJ 6
8 Name: Student No: fit.' (b) Is there an alternative optimal solution? If no, explain why. If yes, perform one pivot on the tableau from part (a) to find it and write your solution in the empty tableau below. ct, "'-' c...ta-el c 3i =- u3 + 15', - c13 =- ANSWER: 'J ==- G :, = Ct.M f:t._e_y.e. t-6 :. (3,1)- (3/t)- (,4) -(:L,3) --(4)3) - (.ti}1) Ju-- 3,) TP /A tz4 --"b-e. PerVtA- CL., u-e... olcu.-k- x23 t- o.- c'la_- tfsc_ia} Va. t-'- oph. ke.ur- ti il!u- Sl S2 S3 S4 Dl D2 {5 \.2. jl(:)\!_ \22. \g_ 5" 6 25 D3 D4 \.2_ \...::_.3 1' \-2. 5o\!_ z.tff--= :t\15' " + S..3 -t-13..w +!J g.!),/-* 6'.5.) -==- 1 Q., 15-, (c) What two conditions are necessary and sufficient to make a feasible solution a basic feasible solution? 4) rft,._,_. of c:_ vo..,h fk_ JIU..+- k. -1 == 4 -rl(- 1 -=- ;, J {1./ tbef& Ck c_ va.-.-,. 7
9 Name: Student No: 6. (7 pts) A company is taking bids on four construction jobs. Three people have placed bids on the jobs. Their bids (in thousand dollars) are given in the table Jobl Job2 Job3 Job4 Personl Person2 Person3 51 * * 45 where * indicates that the person did not bid on the given job. Person 1 can do only one job but persons 2 and 3 can each do as many as two jobs. Use the Hungarian method to determine the minimum cost assignment of persons to jobs. u_ pw--.s c2_. 3 C:.Q..u... e.o.o-l ANSWER: Jo 'f fo iura d dy, 1 CA>k.<;...,fev e.ad, oj M two dt-"ffe -ed -d?ci -/e1{jolen- '"-fr rr-y ll-l "- -fiu._ Uff Ct.>6.f.}r";; 1-tr 1}- -. ot z p Pot Pot' P3 5' 5 51 '-16 4g, 4g 'J9'9 P3' So 4(; Lc.t 4o o \ttu.. '"'-- ; Lt 'f '-fj_ Lro '-r'r ggg 44 9q9 45" its ,-r, ; r"\ tr\ -...:: v '-../ \.../ (\) 1 95i, c <b (D gsg ( St z <D 4 cb qt g, p J._ '-( cb '.i. ol CJ5g :( 9s-g q4'3 1 3 s- 94g CD 3 5 :11 4 <: s- p!--1--"-'---+t''-"-1 > p f-7--hf--h- PJ.:--f.b,I--H---'+-+-tHt
YORK UNIVERSITY. Faculty of Science and Engineering Faculty of Liberal Arts and Professional Studies. MATH B Test #1. September 28, 2012
YORK UNIVERSITY Faculty of Science and Engineering Faculty of Liberal Arts and Professional Studies MATH 1013 3.00 B Test #1 September 28, 2012 Surname (print):------------ Given Name: Student No: --------------
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
More informationA L A BA M A L A W R E V IE W
A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More information176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s
A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More informationSEN301 OPERATIONS RESEARCH I LECTURE NOTES
SEN30 OPERATIONS RESEARCH I LECTURE NOTES SECTION II (208-209) Y. İlker Topcu, Ph.D. & Özgür Kabak, Ph.D. Acknowledgements: We would like to acknowledge Prof. W.L. Winston's "Operations Research: Applications
More information56:171 Operations Research Midterm Exam--15 October 2002
Name 56:171 Operations Research Midterm Exam--15 October 2002 Possible Score 1. True/False 25 _ 2. LP sensitivity analysis 25 _ 3. Transportation problem 15 _ 4. LP tableaux 15 _ Total 80 _ Part I: True(+)
More informationYORK UNIVERSITY. Faculty of Science and Engineering Faculty of Liberal Arts and Professional Studies MATH A Test #2.
YORK UNIVERSITY Faculty of Science and Engineering Faculty of Liberal Arts and Professional Studies MATH 317 6. A Test #2 June 27, 212 Surname (print): Given Name: Student No: Signature: INSTRUCTIONS:
More informationSensitivity Analysis
Dr. Maddah ENMG 500 /9/07 Sensitivity Analysis Changes in the RHS (b) Consider an optimal LP solution. Suppose that the original RHS (b) is changed from b 0 to b new. In the following, we study the affect
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More information56:171 Fall 2002 Operations Research Quizzes with Solutions
56:7 Fall Operations Research Quizzes with Solutions Instructor: D. L. Bricker University of Iowa Dept. of Mechanical & Industrial Engineering Note: In most cases, each quiz is available in several versions!
More informationSOUTHWESTERN ELECTRIC POWER COMPANY SCHEDULE H-6.1b NUCLEAR UNIT OUTAGE DATA. For the Test Year Ended March 31, 2009
Schedule H-6.lb SOUTHWSTRN LCTRIC POWR COMPANY SCHDUL H-6.1b NUCLAR UNIT OUTAG DATA For the Test Year nded March 31, 29 This schedule is not applicable to SVvPCO. 5 Schedule H-6.1 c SOUTHWSTRN LCTRIC POWR
More information~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..
,, 'l t (.) :;,/.I I n ri' ' r l ' rt ( n :' (I : d! n t, :?rj I),.. fl.),. f!..,,., til, ID f-i... j I. 't' r' t II!:t () (l r El,, (fl lj J4 ([) f., () :. -,,.,.I :i l:'!, :I J.A.. t,.. p, - ' I I I
More informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationAPPH 4200 Physics of Fluids
APPH 42 Physics of Fluids Problem Solving and Vorticity (Ch. 5) 1.!! Quick Review 2.! Vorticity 3.! Kelvin s Theorem 4.! Examples 1 How to solve fluid problems? (Like those in textbook) Ç"Tt=l I $T1P#(
More informationP a g e 5 1 of R e p o r t P B 4 / 0 9
P a g e 5 1 of R e p o r t P B 4 / 0 9 J A R T a l s o c o n c l u d e d t h a t a l t h o u g h t h e i n t e n t o f N e l s o n s r e h a b i l i t a t i o n p l a n i s t o e n h a n c e c o n n e
More informationApril 2003 Mathematics 340 Name Page 2 of 12 pages
April 2003 Mathematics 340 Name Page 2 of 12 pages Marks [8] 1. Consider the following tableau for a standard primal linear programming problem. z x 1 x 2 x 3 s 1 s 2 rhs 1 0 p 0 5 3 14 = z 0 1 q 0 1 0
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics. MATH A Test #2. June 25, 2014 SOLUTIONS
YORK UNIVERSITY Faculty of Science Department of Mathematics an Statistics MATH 505 6.00 A Test # June 5, 04 SOLUTIONS Family Name (print): Given Name: Stuent No: Signature: INSTRUCTIONS:. Please write
More information02/05/09 Last 4 Digits of USC ID: Dr. Jessica Parr
Chemistry 05 B First Letter of PLEASE PRINT YOUR NAME IN BLOCK LETTERS Exam last Name Name: 02/05/09 Last 4 Digits of USC ID: Dr. Jessica Parr Lab TA s Name: Question Points Score Grader 2 2 9 3 9 4 2
More informationLast 4 Digits of USC ID:
Chemistry 05 B Practice Exam Dr. Jessica Parr First Letter of last Name PLEASE PRINT YOUR NAME IN BLOCK LETTERS Name: Last 4 Digits of USC ID: Lab TA s Name: Question Points Score Grader 8 2 4 3 9 4 0
More informationSpecial cases of linear programming
Special cases of linear programming Infeasible solution Multiple solution (infinitely many solution) Unbounded solution Degenerated solution Notes on the Simplex tableau 1. The intersection of any basic
More informationMATH 445/545 Homework 2: Due March 3rd, 2016
MATH 445/545 Homework 2: Due March 3rd, 216 Answer the following questions. Please include the question with the solution (write or type them out doing this will help you digest the problem). I do not
More informationORF307 Optimization Practice Midterm 1
Princeton University Department of Operations Research and inaocial Engineering OR307 Optimization Practice Midterm 1 Closed book. No computers. Calculators allowed (but not needed). You are permined to
More informationSOLUTION SET. Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS "LASER FUNDAMENTALS" Second Edition. By William T.
SOLUTION SET Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS "LASER FUNDAMENTALS" Second Edition By William T. Silfvast C.11 q 1. Using the equations (9.8), (9.9), and (9.10) that were developed
More informationMATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00
MATH 373 Section A1 Final Exam Dr. J. Bowman 17 December 2018 14:00 17:00 Name (Last, First): Student ID: Email: @ualberta.ca Scrap paper is supplied. No notes or books are permitted. All electronic equipment,
More information(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider
More informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
More informationr(j) -::::.- --X U.;,..;...-h_D_Vl_5_ :;;2.. Name: ~s'~o--=-i Class; Date: ID: A
Name: ~s'~o--=-i Class; Date: U.;,..;...-h_D_Vl_5 _ MAC 2233 Chapter 4 Review for the test Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Find the derivative
More informationLecture 5. x 1,x 2,x 3 0 (1)
Computational Intractability Revised 2011/6/6 Lecture 5 Professor: David Avis Scribe:Ma Jiangbo, Atsuki Nagao 1 Duality The purpose of this lecture is to introduce duality, which is an important concept
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions 1. What does the Representation Theorem say (in linear programming)? 2. What is the Fundamental Theorem of Linear Programming? 3. What is the main idea
More informationThe Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science
The Simplex Method Lecture 5 Standard and Canonical Forms and Setting up the Tableau Lecture 5 Slide 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard
More informationMATH 445/545 Test 1 Spring 2016
MATH 445/545 Test Spring 06 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 545 level. Please read and follow all of these
More informationFuture Self-Guides. E,.?, :0-..-.,0 Q., 5...q ',D5', 4,] 1-}., d-'.4.., _. ZoltAn Dbrnyei Introduction. u u rt 5,4) ,-,4, a. a aci,, u 4.
te SelfGi ZltAn Dbnyei Intdtin ; ) Q) 4 t? ) t _ 4 73 y S _ E _ p p 4 t t 4) 1_ ::_ J 1 `i () L VI O I4 " " 1 D 4 L e Q) 1 k) QJ 7 j ZS _Le t 1 ej!2 i1 L 77 7 G (4) 4 6 t (1 ;7 bb F) t f; n (i M Q) 7S
More informationSAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.
SAMPLE QUESTIONS. (a) We first set up some constant vectors for our constraints. Let b = (30, 0, 40, 0, 0) T, c = (60, 000, 30, 600, 900) T. Then we set up variables x ij, where i, j and i + j 6. By using
More informationMPM 2D Final Exam Prep 2, June b) Y = 2(x + 1)2-18. ~..: 2. (xl- 1:'}")( t J') -' ( B. vi::: 2 ~ 1-'+ 4 1<. -t-:2 -( 6! '.
MPM 2D Final Exam Prep 2 June 2017 1. Express each equation in standard form and factored form: ~ ~ +et's 'leu t W (.. ".>tak( a) y = (x + 5)2 + 1 on ::t~'t.{1'" ~heeh v 1' K 1 C'. T.) '. (J. lr lov J
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics. MATH C Test #1. October 23, 2013.
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 1505 6.00 C Test #1 October 3, 013 Solutions Family Name (print): Student No: Given Name: Signature: INSTRUCTIONS: 1. Please
More information,\ I. . <- c}. " C:-)' ) I- p od--- -;::: 'J.--- d, cl cr -- I. ( I) Cl c,\. c. 1\'0\ ~ '~O'-_. e ~.\~\S
Math 3306 - Test 1 Name: An d {"0v\ ( _ roj ~ ed Date: l'( ~0 { 1\ Fall 2011 1. (to Pts) Let S == {I, 2, 3,4, 5,6,7,8,9, 10}. of each of the following types of mappings, provide justification for why the
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
More informationTausend Und Eine Nacht
Connecticut College Digital Commons @ Connecticut College Historic Sheet Music Collection Greer Music Library 87 Tausend Und Eine Nacht Johann Strauss Follow this and additional works at: https:digitalcommonsconncolledusheetmusic
More informationWeek_4: simplex method II
Week_4: simplex method II 1 1.introduction LPs in which all the constraints are ( ) with nonnegative right-hand sides offer a convenient all-slack starting basic feasible solution. Models involving (=)
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationColby College Catalogue
Colby College Digital Commons @ Colby Colby Catalogues College Archives: Colbiana Collection 1871 Colby College Catalogue 1871-1872 Colby College Follow this and additional works at: http://digitalcommonscolbyedu/catalogs
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationLecture 11: Post-Optimal Analysis. September 23, 2009
Lecture : Post-Optimal Analysis September 23, 2009 Today Lecture Dual-Simplex Algorithm Post-Optimal Analysis Chapters 4.4 and 4.5. IE 30/GE 330 Lecture Dual Simplex Method The dual simplex method will
More informationSimplex Algorithm Using Canonical Tableaus
41 Simplex Algorithm Using Canonical Tableaus Consider LP in standard form: Min z = cx + α subject to Ax = b where A m n has rank m and α is a constant In tableau form we record it as below Original Tableau
More informationSystems Analysis in Construction
Systems Analysis in Construction CB312 Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d 3. Linear Programming Optimization Simplex Method 135
More informationEXAM 2, MATH 132 WEDNESDAY, OCTOBER 23, 2002
EXAM 2, MATH 132 WEDNESDAY, OCTOBER 23, 2002 This examination has 20 multiple choice questions, and two essay questions. Please check it over and if you find it to be incomplete, notify the proctor. Do
More informationMAC 1147 Final Exam Review
MAC 1147 Final Exam Review nstructions: The final exam will consist of 15 questions plu::; a bonus problem. Some questions will have multiple parts and others will not. Some questions will be multiple
More informationLINEAR PROGRAMMING 2. In many business and policy making situations the following type of problem is encountered:
LINEAR PROGRAMMING 2 In many business and policy making situations the following type of problem is encountered: Maximise an objective subject to (in)equality constraints. Mathematical programming provides
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP Different spaces and objective functions but in general same optimal
More informationnecessita d'interrogare il cielo
gigi nei necessia d'inegae i cie cic pe sax span s inuie a dispiegaa fma dea uce < affeandi ves i cen dea uce isnane " sienzi dei padi sie veic dei' anima 5 J i f H 5 f AL J) i ) L '3 J J "' U J J ö'
More informationFarkas Lemma, Dual Simplex and Sensitivity Analysis
Summer 2011 Optimization I Lecture 10 Farkas Lemma, Dual Simplex and Sensitivity Analysis 1 Farkas Lemma Theorem 1. Let A R m n, b R m. Then exactly one of the following two alternatives is true: (i) x
More information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More informationT h e C S E T I P r o j e c t
T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T
More informationPHYS 232 QUIZ minutes.
/ PHYS 232 QUIZ 1 02-18-2005 50 minutes. This quiz has 3 questions. Please show all your work. If your final answer is not correct, you will get partial credit based on your work shown. You are allowed
More informationn r t d n :4 T P bl D n, l d t z d th tr t. r pd l
n r t d n 20 20 :4 T P bl D n, l d t z d http:.h th tr t. r pd l 2 0 x pt n f t v t, f f d, b th n nd th P r n h h, th r h v n t b n p d f r nt r. Th t v v d pr n, h v r, p n th pl v t r, d b p t r b R
More informationJsee x dx = In Isec x + tanxl + C Jcsc x dx = - In I cscx + cotxl + C
MAC 2312 Final Exam Review Instructions: The Final Exam will consist of 15 questions plus a bonus problem. All questions will be multiple choice, which will be graded partly on whether or not you circle
More informationColby College Catalogue
Colby College Digital Commons @ Colby Colby Catalogues College Archives: Colbiana Collection 1866 Colby College Catalogue 1866-1867 Colby College Follow this and additional works at: http://digitalcommons.colby.edu/catalogs
More informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Department of Mathematics & Statistics Faculty of Science and Engineering END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MS4303 SEMESTER: Spring 2018 MODULE TITLE:
More informationQJ) Zz LI Zz. Dd Jj. Jj Ww J' J Ww. Jj Ww. Jj I\~~ SOUN,DS AND LETTERS
SOUN,DS AND LETTERS.--< Say the name of each picture.llsten to the first sound. Then circle the letters with that"sound..-.. Dd QJ) Jj Ww J' J Ww Zz LI Zz Dd Jj Ww Dd Jj Zz Jj LI Ww Jj LI Ww Jj Ww Zz Dd
More informationTh pr nt n f r n th f ft nth nt r b R b rt Pr t r. Pr t r, R b rt, b. 868. xf rd : Pr nt d f r th B bl r ph l t t th xf rd n v r t Pr, 00. http://hdl.handle.net/2027/nyp.33433006349173 P bl D n n th n
More informationOperations Research I: Deterministic Models
AMS 341 (Fall, 2016) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, September 29, 2016 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
More information4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th
n r t d n 20 2 :24 T P bl D n, l d t z d http:.h th tr t. r pd l 4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
More informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationColby College Catalogue
Colby College Digital Commons @ Colby Colby Catalogues College Archives: Colbiana Collection 1870 Colby College Catalogue 1870-1871 Colby College Follow this and additional works at: http://digitalcommonscolbyedu/catalogs
More information56:171 Operations Research Fall Quizzes. D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa
56:171 Operations Research Fall 2000 Quizzes D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa Name Quiz #1 August 30, 2000 For each statement, indicate "+"=true or "o"=false.
More informationINSTRUCTIONS: CHEM Exam I. September 13, 1994 Lab Section
CHEM 1314.05 Exam I John I. Gelder September 13, 1994 Name TA's Name Lab Section Please sign your name below to give permission to post, by the last 4 digits of your student I.D. number, your course scores
More informationAM 121: Intro to Optimization
AM 121: Intro to Optimization Models and Methods Lecture 6: Phase I, degeneracy, smallest subscript rule. Yiling Chen SEAS Lesson Plan Phase 1 (initialization) Degeneracy and cycling Smallest subscript
More informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
More informationColby College Catalogue
Colby College Digital Commons @ Colby Colby Catalogues College Archives: Colbiana Collection 1872 Colby College Catalogue 1872-1873 Colby College Follow this and additional works at: http://digitalcommonscolbyedu/catalogs
More informationl~ 0 0 'JL 1. )t\ 1-, 'x,,; 1-r
Test 1 Math 2407 Spring 2011 1. (9 points) For each of the following augmented matrices answer the following questions. ~ 1 0 0 5 6] i. [ 0 000 1 X( 1('1 7ty: Number of equations of the corresponding system
More informationScore: Fall 2009 Name Row 80. C(t) = 30te- O. 04t
Math 1410 - Test #3A Score: Fall 2009 Name Row 80 Q1: This is a calculator problem. If t, in minutes, is the time since a drug was administered, the concentration, C(t) in ng/ml, of a drug in a patient's
More informationYears. Marketing without a plan is like navigating a maze; the solution is unclear.
F Q 2018 E Mk l lk z; l l Mk El M C C 1995 O Y O S P R j lk q D C Dl Off P W H S P W Sl M Y Pl Cl El M Cl FIRST QUARTER 2018 E El M & D I C/O Jff P RGD S C D M Sl 57 G S Alx ON K0C 1A0 C Tl: 6134821159
More information1 Simplex and Matrices
1 Simplex and Matrices We will begin with a review of matrix multiplication. A matrix is simply an array of numbers. If a given array has m rows and n columns, then it is called an m n (or m-by-n) matrix.
More informationMathematics Extension 1
BAULKHAM HILLS HIGH SCHOOL TRIAL 04 YEAR TASK 4 Mathematics Etension General Instructions Reading time 5 minutes Working time 0 minutes Write using black or blue pen Board-approved calculators may be used
More informationAPPLIED OPTIMIZATION
Systems Analysis Group, 1995 Uppsala University APPLIED OPTIMIZATION optimal point, f = 12 Starting solution: f=o 10 Thomas Persson January 1995 Revised in October 1998, Håkan Lanshammar Contents 1 INTRODUCTION...
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationECE 4213/5213 Test 1. SHOW ALL OF YOUR WORK for maximum partial credit! GOOD LUCK!
ECE 4213/5213 Test 1 Fall 2018 Dr. Havlicek Monday, October 15, 2018 4:30 PM - 5:45 PM Name: S_O_L_U_'T_I Q_t\l Student Num: Directions: This test is open book. You may also use a calculator, a clean copy
More informationThe Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006
The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,
More information(b) For the change in c 1, use the row corresponding to x 1. The new Row 0 is therefore: 5 + 6
Chapter Review Solutions. Write the LP in normal form, and the optimal tableau is given in the text (to the right): x x x rhs y y 8 y 5 x x x s s s rhs / 5/ 7/ 9 / / 5/ / / / (a) For the dual, just go
More informationMarch 13, Duality 3
15.53 March 13, 27 Duality 3 There are concepts much more difficult to grasp than duality in linear programming. -- Jim Orlin The concept [of nonduality], often described in English as "nondualism," is
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More information56:171 Operations Research Final Examination December 15, 1998
56:171 Operations Research Final Examination December 15, 1998 Write your name on the first page, and initial the other pages. Answer both Parts A and B, and 4 (out of 5) problems from Part C. Possible
More informationLecture 5 Simplex Method. September 2, 2009
Simplex Method September 2, 2009 Outline: Lecture 5 Re-cap blind search Simplex method in steps Simplex tableau Operations Research Methods 1 Determining an optimal solution by exhaustive search Lecture
More informationwo(..lr.i L"'J b]. tr+ +&..) i'> 't\uow).,...,. (o.. J \,} --ti \(' m'\...\,,.q.)).
Applying Theorems in Calculus 11ter111ediate Value Theorem, Ettreme Value Theorem, Rolle 's Theorem, and l\ea11 Value Theorem Before we begin. let's remember what each of these theorems says about a function.
More information56:171 Operations Research Final Exam December 12, 1994
56:171 Operations Research Final Exam December 12, 1994 Write your name on the first page, and initial the other pages. The response "NOTA " = "None of the above" Answer both parts A & B, and five sections
More informationChemistry 1 First Lecture Exam Fall Abbasi Khajo Levine Mathias Mathias/Ortiz Metlitsky Rahi Sanchez-Delgado Vasserman
Chemistry 1 First Lecture Exam Fall 2011 Page 1 of 9 NAME Circle the name of your recitation/lab instructor(s) Abbasi Khajo Levine Mathias Mathias/Ortiz Metlitsky Rahi Sanchez-Delgado Vasserman Before
More information46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th
n r t d n 20 0 : T P bl D n, l d t z d http:.h th tr t. r pd l 46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l
More informationTrade Patterns, Production networks, and Trade and employment in the Asia-US region
Trade Patterns, Production networks, and Trade and employment in the Asia-U region atoshi Inomata Institute of Developing Economies ETRO Development of cross-national production linkages, 1985-2005 1985
More informationExecutive Committee and Officers ( )
Gifted and Talented International V o l u m e 2 4, N u m b e r 2, D e c e m b e r, 2 0 0 9. G i f t e d a n d T a l e n t e d I n t e r n a t i o n a2 l 4 ( 2), D e c e m b e r, 2 0 0 9. 1 T h e W o r
More informationfur \ \,,^N/ D7,,)d.s) 7. The champion and Runner up of the previous year shall be allowed to play directly in final Zone.
OUL O GR SODRY DUTO, ODS,RT,SMTUR,USWR.l ntuctin f cnuct f Kbi ( y/gil)tunent f 2L-Lg t. 2.. 4.. 6. Mtche hll be lye e K ule f ene f tie t tie Dutin f ech tch hll be - +0 (Rece)+ = M The ticint f ech Te
More informationH NT Z N RT L 0 4 n f lt r h v d lt n r n, h p l," "Fl d nd fl d " ( n l d n l tr l t nt r t t n t nt t nt n fr n nl, th t l n r tr t nt. r d n f d rd n t th nd r nt r d t n th t th n r lth h v b n f
More information56:171 Operations Research Fall 2000
56:171 Operations Research Fall 2000 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz #1 Solutions August 30, 2000 For each statement,
More information,.*Hffi;;* SONAI, IUERCANTII,N I,IMITDII REGD- 0FFICE: 105/33, VARDHMAN GotD[N PLNLA,R0AD No.44, pitampura, DELHI *ffigfk"
$ S, URCT,,MTD RGD 0C: 10/, VRDM G[ LL,R0D.44, ptmpur, DL114 C: l22ldll98l,c0224gb, eb:.nlmernte.m T, Dte: 17h tber, 201 BS Lmted hre ]eejeebhy Ter Dll Street Mumb 41 The Mnger (Ltng) Delh Stk xhnge /1,
More informationAP Calculus AB. Sample Student Responses and Scoring Commentary. Inside: Free Response Question 1. Scoring Guideline.
218 AP Calculus AB Sample Student Responses and Scoring Commentary Inside: Free Response Question 1 RR Scoring Guideline RR Student Samples RR Scoring Commentary 218 The College Board. College Board, Advanced
More informationNew Artificial-Free Phase 1 Simplex Method
International Journal of Basic & Applied Sciences IJBAS-IJENS Vol:09 No:10 69 New Artificial-Free Phase 1 Simplex Method Nasiruddin Khan, Syed Inayatullah*, Muhammad Imtiaz and Fozia Hanif Khan Department
More information35H MPa Hydraulic Cylinder 3.5 MPa Hydraulic Cylinder 35H-3
- - - - ff ff - - - - - - B B BB f f f f f f f 6 96 f f f f f f f 6 f LF LZ f 6 MM f 9 P D RR DD M6 M6 M6 M. M. M. M. M. SL. E 6 6 9 ZB Z EE RC/ RC/ RC/ RC/ RC/ ZM 6 F FP 6 K KK M. M. M. M. M M M M f f
More information