{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Quiz4BKey - True False Multiple Choices(4 pts 7 The reduced...

This preview shows pages 1–2. Sign up to view the full content.

OSCM 230 Quiz 4B (Key) Name: Score:           /10 pts  True/False (6pts): 1. The optimal solution to an NLP model must be a corner solution. True False 2. The local optimal solution for maximizing a concave programming problem is also the global optimal  solution. True False 3. The point at which the general reduced gradient algorithm stops search is affected by the initial starting  point of the search. True False 4. For NLP problems,  Solver  may stop at a point that is a local rather than a global optimum. True False 5. A quadratic programming model formulation differs from a linear programming model only in the nature  of its objective function. True False 6.   3 x  + 3  y 2 +7 xy   where  x and y  are decision variables, is an example of a quadratic function.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: True False Multiple Choices (4 pts) 7. The reduced gradient in the sensitivity report of the NLP model is similar to which of these terms from linear programming? a. Shadow Price b. Allowable Increase c. Allowable Decrease d. Reduced Cost 8. Which of the following shaded areas CAN BE feasible regions of convex programming problems ? 1 OSCM 230 Quiz 4B (Key) A B C D E F a. B, D, F b. A, C, E c. A, B, C, E d. C, E 2...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

Quiz4BKey - True False Multiple Choices(4 pts 7 The reduced...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online