Question

this was second part of question.

llUBlems by (a) rounding off solving and (b) enumeration. stow do the three types of integer programming (d 10-4 roblems differ? Which do you think is most com- mon, and why? What is meant by satisficing, and why is the term often used in conjunction with goal programming? 10-6 k What are deviational variables? How do they differ from decision variables in traditional LP problems? Problerm If you were the president of the college you are 10-10 attending and were employing goal programming to assist in decision making, what might your goals be? What kinds of constraints would you include in your model? 10-7 10-8 What does it mean to rank goals in goal program- ming? How does this affect the problem's solution'? why? (a) Maximize profit 3% + 5x2 + 99x3 10-9 Which of the following are NLP problems, and subject to X 10 x, 18 ote: means the problem may be solnd with QM for Windows: means the probles means the problem may be solvedv Windows and/or Excel (b) Maximize cost subject to 25x, + 30x, + 8X1X2 0.0005X (c) Maximize Z = Pdl-+ Pd2+ + P3+ xi- X2 = 11 subject to X1 + X2 + d--dt = 300 X2 d2d2 200 d3 d3 100 X1 + (d) Maximize profit 3X + 4X2 subject to 3% + 4x2 12 (e) Minimize cost = 18X1+ 5X2+X22 4%-3% 8 subject to Are any of these quadratic programming problems ns (b) Maximize cost-25% + 30X2 + 8X1X2 subject to Xi+ X2 2 12 0.0005X1 X2 11 (c) Maximize Z Pdi Pd2t P3+ subject to X +X2 + di d 300 X2 d2-d2 200 d3 d3 100 Xi+ (d) Maximize profit --ЗХ, + 4x2 subject to (e) Minimize cost subject to 3x1 + 4x2 12 18X, + 5X2 + X2 4%-3% 8 Xi+ X2 2 18 Are any of these quadratic programming problems ns

Answer 1

In NLP, either the objective function or one or more constraints or both have non linear relationships.

Hence in the given questions, (b) and (e) have non linear objective function and (d) have non linear constraints. Thus, (b), (d) and (e) are NLP and since all these are of degree 2, we can call them as QPP(quadratic programming problem) as well.