**Midterm: IEOR 3609**

**Midterm: IEOR 3609**

优化Midterm代考 Submission Instructions.The exam contains five problems. (Total = 100 points). Exam duration: 2 hours. You do not need to print or copy the

**Submission Instructions. **

**Submission Instructions.**

- The exam contains
problems. (Total = 100 points). Exam duration: 2 hours.**five** - You do not need to print or copy the questions in your submission. Just submit your solutions, with clearly marked problem numbers.
Please take a clear photo or scan of your exam and upload it on the gradescope within 15 minutes of exam close time**Submit on gradescope.**. The upload process is similar to homework submission.**(i.e., by 10:15pm EST)**

**Queries during exam 优化Midterm代考**

**Queries during exam 优化Midterm代考**

- All the problems should be self-explanatory. Any student queries asking for further explanation of a problem will not be entertained, as it is not fair to other students who did not receive the additional explanation. If you feel that a problem statement is ambiguous, provide your interpretation of the problem, and answer it according to that interpretation.
- If there are any pressing queries during the exam, go to the zoom meeting for instructor office hours.

**Academic Integrity **

**Academic Integrity**

- The exam is open book. However, you must take the exam completely on your own. You should not show or discuss your exam with anyone (in-person or online or through chat/email).
- You may use a calculator if needed, although the exam can be solved without using a calculator. No other software (like Gurobi) or online utility should be used during the exam.
- DO NOT post or share the exam or your solutions online during or after the exam. Any violation of the above policies will be considered academic dishonesty and violation of honor code, and can be subject to disciplinary action.

** **

**Problem 1. (20 points) 优化Midterm代考**

**Problem 1. (20 points) 优化Midterm代考**

You are given a dataset with * m *tuples of form (

*a*

_{i}

*, b**)*

_{i}

*,*

*= 1*

*i**, where vector*

*, …, m*

*a*

_{i}

*R*

*∈*

^{n}*represents feature of candidate*

*and*

*i*

*b*

_{i}

*1*

*∈ {−**1*

*,**is the label for candidate*

*}**. Here label*

*i*

*b*

_{i}*= 1 means that the candidate*

*is qualified for the job and*

*i*

*b**=*

*i**1 means that the candidate*

*−**is unqualified. Your task is to find a*

*i*

*w**R*

*∈*

^{n}*such that the scores*

*w*

^{T}

*a*

_{i}

*= 1*

*, i**provide a ”good”*

*, ..n*prediction of candidate qualifications in the sense that the number of candidate pairs * i, j *where an unqualified candidate

*received a score above a qualified candidate*

*i**is minimized. More precisely, let*

*j*

*B*^{+}

*1*

*⊆ {*

*, . . . , m**denote the set of qualified candidates (those with*

*}*

*b*

_{i}*= 1), and*

*B*

^{−}*denote the remaining set of unqualified candidates; then the goal is to find*

*w**R*

*∈*

^{n}*to minimize*

*but this is not a Linear program or Integer Program since the function *** 1**(

*w*

^{T}

*a*

_{i}

*< w*

^{T}

*a*

_{j}*)*

*is not linear in*

*w*

*. There will be no credit for writing it in the above form. Your task is to use auxiliary variables, possibly binary or integer, to reformulate this optimization problem as a (mixed) Integer program.**Also note that **B*^{+}*, B*^{−}* **are fixed sets input to the program. You can use them to write constraints of form ”for all **i **∈ **B*^{+}*”, ”for all **j **∈ **B*^{−}*” etc. *

** **

**Problem 2. (20 points) 优化Midterm代考**

**Problem 2. (20 points) 优化Midterm代考**

You have received * m *requests for an appointment for vaccination. Each request

*includes a start date*

*j*

*s*

_{j}*. Person*

*can receive the vaccination on any date after (and including) the start date*

*j*

*s*

_{j}*. There are 20 appointment slots for vaccination available everyday at the JK hospital. At most one request can be scheduled for one appointment slot. If a request*

*is scheduled for a date*

*j*

*t*

_{j}

*> s*

_{j}*, then we say that the request*

*was delayed by*

*j*

*t*

_{j}

*−*

*s*

_{j}*days. (*

*t*

_{j}

*−*

*s*

_{j}*is the number of days between date*

*t*

_{j}*and*

*s*

_{j}*). Your goal is to schedule appointments such that the maximum delay over all requests is minimized.*

Consider the following greedy algorithm for scheduling appointments. Order the requests in ascending order of start dates. Then, starting from day 1, on each day schedule as many remaining requests as possible prioritized by start dates. Is this algorithm correct? If correct, give a proof of correctness. If incorrect, give a counter example.

**Problem 3. (20 points) **

**Problem 3. (20 points)**

Consider the following integer program.

maximize * z *= 11

*x*_{1}+ 13

*x*_{2}

s.t.

*x*_{1}+

*x*_{2}

*5*

*≤*4

*x*_{1}+ 7

*x*_{2}

*28*

*≤*

*x*_{1}

*0*

*≥*

*x*_{2}

*0*

*≥*

*x*_{1}

*, x*_{2}integer

Following is a partial branch and bound tree for this program.

(a) (15 points) Using the information given in the above tree answer the following.

- What is the current best (highest) lower bound on the optimal solution?
- What is the best (lowest) upper bound available for the value of any integer solutions obtainable from node
or its children?**e** - Which of the remaining branches can be eliminated to prune the tree and which cannot be? Justify. You can use the letters (a,b,c,d,e) on the top left corner to refer to a node.

(b) (5 points) Finish executing the branch and bound to find the optimal integer solution. You can solve any LPs using graphical method or by inspection (show your work as much as possible). Make sure to prune the tree when possible.

**Problem 4. (20 points) 优化Midterm代考**

**Problem 4. (20 points) 优化Midterm代考**

Consider the following integer program.

maximize * z *= 5

*x*_{1}+ 8

*x*_{2}

s.t.

*x*_{1}+

*x*_{2}

*6*

*≤*5

*x*_{1}+ 9

*x*_{2}

*45*

*≤*

*x*_{1}

*0*

*≥*

*x*_{2}

*0*

*≥*

*x*_{1}

*, x*_{2}integer

The optimal solution to the LP relaxation is (2* .*25

*3*

*,**75). The final simplex tableau (including the slack variables) for this problem is as follows:*

*.** z *+1

*25*

*.*

*s*_{1}+0

*75*

*.*

*s*_{2}= 41

*25*

*.*

*x*_{1 }+2

*25*

*.*

*s*_{1}

*0*

*−**25*

*.*

*s*_{2}= 2

*25*

*.*

*x*_{2 }

*1*

*−**25*

*.*

*s*_{1}+0

*25*

*.*

*s*_{2}= 3

*75*

*.*Which of the following are valid inequalities? Justify. To justify that an inequality is valid, you can derive it using Chvatal-Gomory procedure or show graphically that it does not cut any feasible integer points. To show that an inequality is not valid, state an integer feasible point that does not satisfy the inequality.

(a) *x*_{1} + 2*s*_{1} *− **s*_{2} * ≤ *2

(b) *x*_{2} * − *2

*s*_{1}

*3*

*≤*(c) 0* .*75

*s*_{1}+ 0

*25*

*.*

*s*_{2}

*0*

*≥**75*

*.*(d) 2*x*_{1} + 3*x*_{2} * ≤ *15

** **

**Problem 5. (20 points) 优化Midterm代考**

**Problem 5. (20 points) 优化Midterm代考**

In the shortest path problem * with delays*, we are given a network

*= (*

*G**), where each edge (*

*V, E**)*

*i, j*

*∈**has a cost*

*E*

*c*

_{ij}*and a delay*

*d*

_{ij}*. The goal is to find a path from source*

*to terminal*

*s**with minimum cost such that the total delay over the path is at most*

*t**.*

*D*This problem can be formulated as the following integer program:

**(a) (6 points) **

Dualize the delay constraint (P_{(}_{i,j}_{)}_{∈}_{E}* **d*_{ij}*x*_{ij }*≤ ** D*) to obtain a Lagrangian relaxation. Argue that the Lagrangian relaxation is a standard shortest path problem (with only costs and no delays) and therefore can be easily solved. State the expression for the cost of each edge (

*) in this shortest path problem.*

*i, j***(b) (10 points) **

Consider the following example network for the shortest path with delays problem. On each edge, the first number (with dollar sign) indicates cost *c*_{ij}* *, and the second number (in red) indicates delay

*d*

_{ij}*. Here source*

*= 1, terminal*

*s**= 6, and*

*t**= 15.*

*D*

On this example network, solve the Lagrangian relaxation derived in part (a) for the following two values of the Lagrangian multiplier : * µ *= 0

*= 1. You may solve the standard shortest path problem by inspection (by comparing the costs of all possible paths).*

*, µ**Note: If the Lagrangian relaxation you constructed in part (a) provides a lower bound only for negative values of the Lagrange multiplier, solve it for ** µ *= 0

*=*

*, µ**1*

*−*

*.***(c) (4 points) **

What is the tightest (maximum) lower bound obtained in part (b)? Is there any gap from the optimal value of the original problem? Derive an upper bound in order to bound the gap from the optimal solution. (Note that any feasible solution to the original problem gives an upper bound.)

更多代写：加拿大web网课代上 gre在家考 英国物理代考 英文论文代写 国外留学论文apa代写 代写literature review