• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/1

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

1 Cards in this Set

  • Front
  • Back
ExamTutorials.comhttp://www.examtutorials.comBUS 461 Week 2 Quizhttp://www.examtutorials.com/course/bus-461-week-2-quiz/ Author : bmin1. Question : The functional constraints of a linear model with nonnegative variables are 3X1 + 5X2 = 16 and 4X1 + X2 = 10. Which of the following points could not be an optimal solution for the model? Student Answer: X1 = 0, X2 = 3.2 X1 = 1, X2 = 2.25 X1 = 2, X2 = 2 Points Received: Comments: 2. Question : 1 of 1 X1 = 2.5, X2 = 0A "non-binding" constraint is: redundant.Student Answer:not satisfied with an equality at the optimal solution. one having zero slack or surplus never a non-negativity variable constraint. Points Received: Comments: 3. Question : solution? Student Answer: Degenerate. Infeasible. 1 of 1An over-constrained linear programming problem results in what type ofUnbounded.1/3Sub-optimal. Points Received: Comments: 4. Question : 1 of 1A non-binding constraint is always a redundant constraint. TrueStudent Answer: False Points Received: Comments:1 of 15. Question : Linear programming and integer linear programming both yield a great amount of sensitivity analysis. Student Answer: False Points Received: Comments: True1 of 16. Question : When specifying linear constraints, the modeler must take into account the unit specification of the decision variables so that the units represented by the left side of the constraints are consistent with the units represented by the right side of the constraints. Student Answer: False Points Received: Comments: True1 of 17. Question : Linear programming models are a subset of constrained optimization models that require the assumptions of continuity of the variables, certainty of the coefficients, additivity of terms, and proportionality of costs, profits, and the use of resources to the value of the decision variables. Student Answer: False Points Received: Comments: True1 of 18. Question : The complementary slackness principle states that either there is zero slack on a constraint or the reduced cost is zero.2/3Student Answer: False Points Received: Comments:True1 of 19. Question : If two extreme points are optimal, then so is every point on the line segment connecting the two extreme points. Student Answer: False Points Received: Comments: 10. Question : True0 of 1Minimization linear programming models may not involve constraints. TrueStudent Answer: False Points Received: Comments:1 of 1http://www.examtutorials.com/course/bus-461-week-2-quiz/3/3Powered by TCPDF (www.tcpdf.org)
ExamTutorials.comhttp://www.examtutorials.comBUS 461 Week 2 Quizhttp://www.examtutorials.com/course/bus-461-week-2-quiz/ Author : bmin1. Question : The functional constraints of a linear model with nonnegative variables are 3X1 + 5X2 = 16 and 4X1 + X2 = 10. Which of the following points could not be an optimal solution for the model? Student Answer: X1 = 0, X2 = 3.2 X1 = 1, X2 = 2.25 X1 = 2, X2 = 2 Points Received: Comments: 2. Question : 1 of 1 X1 = 2.5, X2 = 0A "non-binding" constraint is: redundant.Student Answer:not satisfied with an equality at the optimal solution. one having zero slack or surplus never a non-negativity variable constraint. Points Received: Comments: 3. Question : solution? Student Answer: Degenerate. Infeasible. 1 of 1An over-constrained linear programming problem results in what type ofUnbounded.1/3Sub-optimal. Points Received: Comments: 4. Question : 1 of 1A non-binding constraint is always a redundant constraint. TrueStudent Answer: False Points Received: Comments:1 of 15. Question : Linear programming and integer linear programming both yield a great amount of sensitivity analysis. Student Answer: False Points Received: Comments: True1 of 16. Question : When specifying linear constraints, the modeler must take into account the unit specification of the decision variables so that the units represented by the left side of the constraints are consistent with the units represented by the right side of the constraints. Student Answer: False Points Received: Comments: True1 of 17. Question : Linear programming models are a subset of constrained optimization models that require the assumptions of continuity of the variables, certainty of the coefficients, additivity of terms, and proportionality of costs, profits, and the use of resources to the value of the decision variables. Student Answer: False Points Received: Comments: True1 of 18. Question : The complementary slackness principle states that either there is zero slack on a constraint or the reduced cost is zero.2/3Student Answer: False Points Received: Comments:True1 of 19. Question : If two extreme points are optimal, then so is every point on the line segment connecting the two extreme points. Student Answer: False Points Received: Comments: 10. Question : True0 of 1Minimization linear programming models may not involve constraints. TrueStudent Answer: False Points Received: Comments:1 of 1http://www.examtutorials.com/course/bus-461-week-2-quiz/3/3Powered by TCPDF (www.tcpdf.org)