辅导IB2070编程、写作PROGRAMMING程序

” 辅导IB2070编程、写作PROGRAMMING程序Page 1 of 5University of Warwick – Warwick Business SchoolJanuary 2021IB2070 MATHEMATICAL PROGRAMMING IIOpen Book Assessment 2 hoursInstructions:A. You have 2 hours and 45 minutes in total to complete your assessment and upload it to theAEP. This includes provision for technical delays.B. There are three number of questions. You should attempt every question.C. The number of Marks each question will carry is indicated.D. Save your file with your Student ID number and Module Code before submitting via the AEP.E. By starting this assessment you are declaring yourself fit to undertake it. You are expected tomake a reasonable Attempt at the assessment by answering the questions.F. Use the AEP immediately to seek advice if you cannot access the assessment, or believe youare registered to the incorrect paper.Other information (read the following very carefully):G. During the online assessment:i. If you have a question about the content of your assessment you should ask theModule Convenor/invigilator via the AEP query system. Do not send an email to them,or to undergraduate@wbs.ac.uk as this will not be answered.ii. If you experience technical difficulties that prevent you from completing andsubmitting your answer file please submit a mitigating circumstances case via my.wbs(or the Universitys portal if you are a non-WBS student). Please do not attach youranswer file as it will not be marked.H. Your document:i. You must type your answers in Word (or an equivalent piece of software) and uploadthese to the AEP within a single PDF file.ii. Ensure your answers to each question follow the order in which the questions appearin the exam paper. Start each new question or question part on a new page (orseparate piece of paper, where handwritten answers are required) and write thequestion number at the top of each page of your answers.iii. Include on each Page of your file your Student ID Number, the module code and thepage number (using the format x of y pages to confirm how many pages in total youare submitting).iv. Within your one, single file you may include images (where required or where youwant to use as part of your answer) (i.e. screenshots, photos or online drawings) ofhand-written calculations, formulae, charts or graphs to complement your answersand show your workings. These images should be embedded at the point in thedocument where they are relevant in your answers.v. Ensure that you label any images you include to inform and assist the marker. Whereyou have handwritten items please write legibly, preferably in dark blue or black ink,IB2070Page 2 of 5and ensure that it is not too faint to be captured by a scan or photograph. Remember,it is your responsibility to ensure that your work can be read.I. Academic integrity (plagiarism/collusion):i. You are allowed to Access module materials, notes, resources, other referencematerials and the internet during the assessment.ii. You should not communicate with any other candidate during the assessment periodas this could be interpreted as collusion and may lead to your work being reviewed forcheating. This includes the sharing of the exam paper with other students. Collusion istaken very seriously by the University.iii. To further maintain the academic integrity of online assessments:You are asked to provide details of your working out to indicate your approach toaddressing the questions posed.Warwick Business School reserves the right to viva any students suspected ofcheating.J. Submitting your answer file:i. You have an additional 45 minutes beyond the stated duration of the assessment. Thisis for finalising your Answer file, converting to PDF (if relevant), uploading to the AEP ensure you upload the correct document, and submitting. This includes provision fortechnical delays.ii. This online assessment will close at 11:45am UK time and you will not be able tosubmit your answer file after that time, unless you have Reasonable ExamAdjustments.iii. If you have an agreement that entitles you to additional time (reasonableadjustments), you should see the amount of additional time you have been granted onthe AEP. If you have any queries regarding the amount of additional time you havebeen granted please email exams@wbs.ac.uk.iv. Only documents submitted via the AEP will be accepted and marked.v. Incorrect documents submitted via the AEP may be marked and that mark will befinal. You should therefore use the 45 minutes of extra time granted to ensure yousubmit the correct document.vi. Documents sent via email or through the mitigating circumstances portal will not bemarked.Your Assessment starts below.IB2070Page 3 of 5[Question 1](1) Consider the following linear programming problem, in whichandare parameters:(a) Show that the Problem is feasible.[3 marks](b) Derive the dual of the problem.[8 marks](c) Find the Condition ofandso that the given problem has a finite optimal value. Provideall details of Your working. (Hint: check the feasibility of the dual problem.)[12 marks](2) The branch-and-bound algorithm has been used to solve an integer linear programming problem(IP) of maximizing the investment return. Part of the corresponding branch-and-bound tree ispresented below, where the circled numbers are the optimal values of the corresponding LPrelaxations and, of all eight integer variables,andare binary.(a) Unfortunately, there is one misprint among the circled numbers in the branch-and-boundtree. Identify this misprinted number and explain your answer.[5 marks](b) Use the information presented in the tree to provide the best (i.e., smallest) upper bound ofthe optimal objective value of the original IP problem. Explain your answer.[7 marks](Continued/)IB2070Page 4 of 5[Question 2]The following diagram indicates the Costs of travelling along the arcs of the network, where a negativecost represents a profit.(1) Use the Label Correcting Algorithm to find a cheapest directed path from node 1 to node 5.Provide all the working details, including every step and the final result: the shortest path you findand its total length.[12 marks](2) Formulate the shortest-path (i.e., cheapest-path) problem as an integer linear programming (IP)problem, which is a special case of the minimum-cost network flow problem. Provide all the detailsof your formulation: variables, objective function and constraints.[8 marks](3) Construct the dual of the linear program (LP) relaxation of the IP you constructed in part (2).[10 marks](4) Use the dual in part (3) to confirm the optimality of the shortest path you find in part (1).[5 marks](5) The problem in part (2) can be considered as finding a cheapest route for one truck. Nowformulate an IP model for finding the cheapest routes for two trucks (i.e., two directed paths fromnode 1 to node 5 with the Minimum total cost): Denote by= {(1,2), (1,3), (2,3), (2,4), (2,5),(3,4), (4,5) } the set of all seven arcs in the above network. Let the travelling costs of one truckand two trucks along arc (,)beand, respectively, for Each arc (,) .Provide all detailswithout omission.[15 marks](Hint: Introduce a set of binary variablesto define a path for the first truck, a set of binaryvariablesto define a path for the second truck, and a set of binary variablesto identify thesituation where two trucks use the Same arc (,).)[Question 3]Consider the following network, where the number by each arc is the capacity of the arc:(1) Use the Ford-Fulkerson algorithm To find a maximum flow from node 1 to node 5 in the networkabove.[10 marks](2) Identify a cut that can be Used to verify the optimality of the maximum flow you have found inpart (1).如有需要，请加QQ：99515681 或WX：codehelp

“