Chapter 1.3, Problem I.1E

Find the x- intercept and y- intercept of each constraints and graph.

Solve the following problems by the fractional cut, and compare the true optimum integer solution with the solution obtained by rounding the continuous optimum

Suppose we are solving a maximization problem andthe variable xr is about to leave the basis.a What is the coefficient of xr in the current row 0?b Show that after the current pivot is performed, thecoefficient of xr in row 0 cannot be less than zero.c Explain why a variable that has left the basis on agiven pivot cannot re-enter the basis on the next pivot.

Consider the points (0, 0), (1, 1), and (2, 3). Formulatean NLP whose solution will yield the circle of smallestradius enclosing these three points. Use LINGO to solvethe NLP.

Consider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?

Search for the best solution of the following integer program using the branch and bound algorithm.

Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.

Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0

The Janie Gioffre Drapery Company makes three types of draperies at two different locations. At location I, it can make 10 pairs of deluxe drapes, 20 pairs of better drapes, and 13 pairs of standard drapes per day. At location II, it can make 20 pairs of deluxe, 50 pairs of better, and 6 pairs of standard per day. The company has orders for 3000 pairs of deluxe drapes, 6300 pairs of better drapes, and 1800 pairs of standard drapes. If the daily costs are $750 per day at location I and $900 per day at location II, how many days should Janie schedule at each location to fill the orders at minimum cost? location I        days location II        days Find the minimum cost.$