OvestonT ot yt areas out ot 100 Time let 0:59:39 S classes 1, 2, 3, 4, Sneed tobe assigned to 2 teachers 1,2in which each clas is assigned to only one teacher and each teacher 's responsible to teach some classes. Due to the timetable ofthe classes, there are pars of classes that cannot be assigned to the same teacher (14), (1.5), (25), (34) The lod ofa teacher is defined tobe the numberof classes assigned to that teacher. ‘The goals to fin an assignment such that maximum load among loads of teachers is minimal ‘The problem can be modeled by binary variables X(.) in which XQ) ‘means that class iis not assigned to teacher j (wth = 1. § and) ‘1 means that class iis assigned to teacher jand x) = 0 2. ‘We state 5 constraints below: (AEXC) + X02.) + X83.1)+ X41) + X51) = (EXC +xia=1 (O):X(11) + X(12)<=1 (O}:XC + XN + XN + X41) + XIGN) <4 ©: XQ +122) Which constraints stated above are vali? 2. Allconstraints (A), (B),(), (0), ae not valid ». Constraint (is vai € Constraint (0) vais 4. Constraint Ais valid © Constraint () i vaisTwo truck 1, 2 need to be scheduled to deliver goods to 7 customers 1, 2, 3,4, 6, 6,7 Customer is located at point |(1= 1, 7). The amount of goods requested by customers 1,2, 3,4 5,6, 7 are respectively 2, 3,1, 42,3, 4 ‘+ Truck thas capacity 9, the starting point 8 andthe terminating point 10 ‘© Tuck has capacity 11, the starting point 9 and the terminating point 11 Find the route planning such that: ‘+ Each truck operates a route that departs from its starting point, visits some customers for delivering goods and goto ts terminating point ‘+ Each customer s visited by exactly one truck ‘+ Total amount of goods requested by customers on a route of a truck cannot exceed its capacity «Total travel dstance ofthe routes of the two trucks i minimal ‘The problom is modeled by binary variables x(k which XIki X{K.] = 0 means that truck k does not traverse from pont to point} “Which statements are correct? means that truck ktraverses from point to point, and | Zand 1<=ije= 7) . ‘Constraint "X(1.14] + X111.5] = 1" vai ‘Constraint "X(1.21] + X12] + XI12.4] + X112/5] + X(12.6] + X112,7] <= Tis not val © Constraint "K111.2] + X(11.3] + X11] + X11] + X16] + X{147I= Tis not ak 1. Allstatements are not correct ©Time let 0:59:34 onston in term of Cosntraint Programming methods for solving combinatorial optimization problems, which statements below are ex yt comect? Saad oot |8. Constraint Programming methods have exponential time complexity for finding optimal solutions in general cases . Constraint Programming methods always have polynomial time complexity for any combinatorial optimization problemsueston Tine let 0:59:32 Interm of solving a near program by the simplex method under a tabular form, let consider a table (during the execution ofthe simplex method) bolow: 2 [3 [1 [1 [o fo fo fa 1 [a1 [o fo [2 Jo fo [7 | 3 |-2 [6 o fo f1 [o | 10 3 |2 [7 o jo fo [a [o | Table 1 Which statements are correct? [Al statements ae not correct ‘The objective function ofthe considered near program s unbounded (the value of the objective function canbe positive infinity) ‘The considered linear program does not have any fessble solution . 1405 C, GD)Time left 0:59:12 Question 6 Given the following optimization problem an, Mize ay) 2+39 “Marked out of ‘subject to = w2+y2=0, xis integer, ys real Which ofthe folowing constraints ae valid inequalities? yerx ee Bye? xeyer? 14. Allthe constraints (x + 2y <= 2, x+y-<=2, y-=0 ‘Below are tabies (wth 3 slack variables added) atthe nal step. Which tables are correct? me pa fax [2 [em] [apa [e [oa [xs [2 [me a |e 1 |e 1/4 2|7 eh" ly =lefelel™ cn 3 1 7 z s]e[*|5 ° 1 ° ° ° 5 2 . ° 3 ° ° =apel= Table 1 Table 2 Table 3 4 Table 3 is correct . Al Tables are not correct Table 1is correct Table 2s comect‘vestan 22 artes out ot 100 Time left 0:55:51 In term of solving inear program by the simplex method under a tabular form, let consider 3 tabes (Table , Table 2, Table 3) ‘below (these tables are generated during the execution ofthe simplex method step-by-step): z mapa po [ee [z [re x fs [x [z [es [a fo fo |e a [e [am [an [o [ure tap fe lel 1 [| eo |i [an fan [o [aa oz 1 fo [3 oft fo 0 [o [an [sm [a [am eo [5 oft [2 (4, 0,0, 3) is an optimal solution tothe considered inear program (0,5, 3,0)is an optimal solution tothe considered near program All statements are not correct ‘The considered linear program does not have optimal solutions (85, 15, 0, 0) isan optimal solution ofthe considered linear program Table 3and ot ot 100 ‘Given some optimization problems (Pt, (P2),(P3) below: (©): Manimize (x,y, 2)= 3x4 y= az ‘subject to xeyeze7 Dee dy-2e9 Xy, 2010 real (2): Maximize fx, y, 2) subject to x-yszee6 e+ 5y-3rea3 yar integer, is rea tyeae (3): Minimize tx, y,2) = x9 yz # 82 subject to xey-222 Des 6y- dread xy.zarereal Which statements are correct? Time let 0:85:49ee Time left 0:55:47 (02): Maximize fx, 9, 2)= x+y 4 42 subject to x-ys2086 2+ 5y 3223 1 ae integer, zis reat (3): Minimize ty, 2)= + y2 + 32 subject to xey-222 2x4 6y- Arend ‘Which statements ae coreet? 8. (P3) i alinear prorgamming problem 1b. (PD, (02), (P3) ae tinea programming problems € (P2) is amixed integer linear programming problem 4. Allstatements ae not correctoveston 24 Manta oto Time et 0:55:48 {A shipper departs from point visits points 2,3 4 (each point i vised exactly once), and comes back to point 1 for delivering packages. Denote c(i) the travel distance from point ito pont (1<= | <= 4). The distance matrcis given below: 142 1017 4301 1310 ‘The goa isto find the shortest route forthe shipper. ‘Gwen two solutions below: ‘© Solution t:routeis 1-2-3-4-1 ‘© Solution 2: routes 1-3-4-2-1 Which statements ae correct? ‘2. Solution 1s better than solution 2 1b Allstatements are not corect & Solution 2is better than solution 1ovesten 25 Netyet Manas outot {Given some Linear Programming problems (LPI), (LP2},(LP3) below: (UP1) Maximize 1001, x2, X3) = 2X1 = X2-6 5x3. subject to 4x1 12- 2x3. 5 x1 4x2 x3 X1, X2,X3 are real and non-negative (€P2) Minienize f(x, X2, x3) = 2X1 2 + 5X3 subject to 4X1-X2- 2x3 >=6 Xt sax2-x3<=3 XI, X2, X3 are real and non-negative (0P3) Maximize (41, x2, X3) = 2X1 = 2+ 8X3 XI, X2, X3 are real and non-negative Which statements are correct? Tine let 0:55:42ae ee eee x1 44x2- x3 Time lett 55:41 X1, x2, X3 are real and non-negative poet ones} (2) Minimize 1X1, X2, X3) = 2x1- X2-+ 5X3 subject to 4x1 2-23 = x1 44x2-X3 X1, 2, X3 are teal and non-negative (4.93) Maize 101, X2, x3) subject to x1-x2-2x3=6 Xt = X2-+ 6X3 x1 saxa-x3=3 XI, X2, X3 are real and non-negative Which statements ate corect? (LP0) and (LP2) are under a standard form (LP) is under a standard form (Only (LPI is under a standard form 4. All statements ae not correctety 109 Let be the set of points (xy) such that: 2 2exe? ssayeo + x yare real numbers ‘Statement "Sis a convex set" it TRUE for FALSE? a FALSE b. TRUE Time eft 0:55:38vesten 28 et yt {Given alinear program (LP) below Maximize fx, x2, 3) = 244-2 + 3x subject to 2439 -14<=7 nt +Se8 2, ta Xa non-negative, xi integer Given 4 soltions:1= (1, 15,1), 52 (2,1, 18), 53=(15,1,1), #4 =(2.0,45) Which statements are correct? ean e s2inbetterthanst ‘31s beter than st ‘sis better than st Ailstatements ae not correct ‘sis beter than s2 Time left 0:55:33,109 (Given a linear program (LP) below Maximize fx, 2% 2-194 9 subject to 2443-7 wt B58 1% a Xa non-negative, 1s integer (Gwen 4 solutions: (15,0, $2=(2,1,18), $3: Which statements are correct? ae ee ‘and $2 ae feasbe solutions 131s afeasble solution ‘Al statements are not correct ‘tis a feasble solution 5,11), $4=(2,0,45) Time let 0:55:33,ata out ot 109 Time eft 05:28 ‘A shipper departs from point 1, visits points 2, 3,4 (each points visited exactly once), and comes back to pont 1 for delivering ‘packages. Denote c(i) the travel distance from point to point (1 <=, <= 4). The distance matrix is given below: 0342 1037 4308 2310 ‘The goals to find the shortest itinerary forthe shipper, ‘The problem is modelled by binary variables X() in which X(j) = 1 means thatthe shipper travels directly from point to from, ‘and X() = O means that the shipper does not travel directly from point ito point (1-<= | <=4), Hence, Xis a 0-1 matrix Given a solution (value of matrix X) below: 0100 0001 1000 0010 Which statements are corect? The given solution x does not representa feasible solution 1. The given solution X represents a feasible solution