Consider the following problem: 2x max z = 120 - 8x? - 2y? + 5xy +T+y s.t. 6x + 8y s 77 (1) 5x – 2y 2 10 (2) 5 SxS 12 (3) 3sys9 (4) x and y are integer variables 1- Ienore constraints (1) and (2). Let [7, 4]" be the current solution. Write all the possible feasible immediate neighbors of the current solution. 2- lunore constraints (1) and (2). Execute one iteration of greedy heuristic with expanded neighborhood of size 2. Start the search from [5, 11]". Report the best solution of the performed iteration. 3- Consider the entire model. Create a penalty objective function of the above model. Assume the penalty coefficients are equal to 1000. Evaluate the penalized objective function value of the candidate solution [3, 31". 4- Consider constraints (1), (3), and (4) only and update the bounds on x and y in order (start with x then y).

Consider the following problem: 2x max z = 120 - 8x? - 2y? + 5xy +T+y s.t. 6x + 8y s 77 (1) 5x – 2y 2 10 (2) 5 SxS 12 (3) 3sys9 (4) x and y are integer variables 1- Ienore constraints (1) and (2). Let [7, 4]" be the current solution. Write all the possible feasible immediate neighbors of the current solution. 2- lunore constraints (1) and (2). Execute one iteration of greedy heuristic with expanded neighborhood of size 2. Start the search from [5, 11]". Report the best solution of the performed iteration. 3- Consider the entire model. Create a penalty objective function of the above model. Assume the penalty coefficients are equal to 1000. Evaluate the penalized objective function value of the candidate solution [3, 31". 4- Consider constraints (1), (3), and (4) only and update the bounds on x and y in order (start with x then y).

Algebra for College Students

10th Edition

ISBN:9781285195780

Author:Jerome E. Kaufmann, Karen L. Schwitters

Publisher:Jerome E. Kaufmann, Karen L. Schwitters

Chapter13: Conic Sections

Section13.1: Circles

Problem 48PS

See similar textbooks