Embed Size (px)
DESCRIPTION
Saint GBA334 module 5 quiz (20/20)Saint GBA334 module 5 quiz (20/20)QuestionQuestion 1.1.Consider the following linear programming problem:Maximize 12X + 10YSubject to: 4X + 3Y ≤ 4802X + 3Y ≤ 360All variables ≥ 0What is the optimum solution of (X,Y)?(Points : 5)X=480, Y = 360X=360, Y-480X=60, Y=80X=80, Y=60None of the aboveQuestion 2.2.When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and(Points : 5)finding the profit at every corner point of the feasible region to see which one gives the highest value.moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered.locating the point that is highest on the graph.None of the aboveAll of the aboveQuestion 3.3.An LP formulation typically requires finding the maximum value of an objective while simultaneously maximizing usage of the resource constraints.(Points : 5)TrueFalse Question 4.4.Infeasibility in a linear programming problem occurs when(Points : 5)there is an infinite solution.a constraint is redundant.more than one solution is optimal.the feasible region is unbounded.there is no solution that satisfies all the constraints given.Question 5.5.If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be(Points : 5)unbounded.non-negative.infeasible.redundant.bounded.Question 6.6.Solve the following linear programming problem:Maximize 10X + 1YSubject to: 4X + 3Y ≤ 362X + 4Y ≤ 40Y ? 3What is the maximum profit?(Points : 5)364036.7570.5Question 7.7.In the term linear programming, the word programming comes from the phrase “computer programming.”(Points : 5)TrueFalseQuestion 8.8.The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as(Points : 5)surplus.constraint.slack.shadow price.None of the aboveQuestion 9.9.Consider the following linear programming:Maximize 10X + 1YSubject to: 4X + 3Y ≤ 362X + 4Y ≤ 40Y ≤ 3What is the value of X and Y maximizing profit?(Points : 5)X = 36, Y = 40X = 40, Y = 36X = 70.5, Y = 6.75X = 6.75, Y = 3X = 3, Y = 6.75Question 10.10.The difference between the left-hand side and right-hand side of a less-than-or-equal-to constraint is referred to as(Points : 5) surplus. constraint.slack.slack.shadow price.None of the aboveQuestion 11.11.Which of the following is not an assumption of LP?(Points : 5)simultaneitycertaintyproportionalitydivisibilityadditivityQuestion 12.12.A feasible solution to a linear programming problem(Points : 5)must be a corner point of the feasible region.must satisfy all of the problem’s constraints simultaneously.need not satisfy all of the constraints, only the non-negativity constraints.must give the maximum possible profit.must give the minimum possible cost.Question 13.13.Sensitivity analysis may also be called(Points : 5)postoptimality analysis.parametric programming.optimality analysis.All of the aboveNone of the aboveQuestion 14.14.An objective function is necessary in a maximization problem but is not required in a minimization problem.(Points : 5)TrueFalseQuestion 15.15.Management resources that need control include machinery usage, labor volume, money spent, time used, warehouse space used, and material usage.(Points : 5)TrueFalseQuestion 16.16.A constraint with zero slack or surplus is called a(Points : 5)nonbinding constraint.resource constraint.binding constraint.nonlinear constraint.linear constraint.Question 17.17.The set of solution points that satisfies all of a linear programming problem’s constraints simultaneously is defined as the feasible region in graphical linear programmi
Citation preview
10/12/2015 TheAceStudent: Saint GBA334 module 5 quiz (20/20)
data:text/html;charset=utf8,%3Ch3%20class%3D%22posttitle%20entrytitle%22%20itemprop%3D%22name%22%20style%3D%22margin%3A%200px%3B… 1/4
Saint GBA334 module 5 quiz (20/20)
QuestionQuestion 1.1.Consider the following linear programming problem:Maximize 12X + 10YSubject to: 4X + 3Y ≤ 4802X + 3Y ≤ 360All variables ≥ 0What is the optimum solution of (X,Y)?(Points : 5)X=480, Y = 360X=360, Y480X=60, Y=80X=80, Y=60None of the aboveQuestion 2.2.When appropriate, the optimal solution to a maximization linear programming problem can be foundby graphing the feasible region and(Points : 5)finding the profit at every corner point of the feasible region to see which one gives the highestvalue.moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasibleregion is encountered.locating the point that is highest on the graph.None of the aboveAll of the aboveQuestion 3.3.An LP formulation typically requires finding the maximum value of an objective while simultaneouslymaximizing usage of the resource constraints.(Points : 5)TrueFalse Question 4.4.Infeasibility in a linear programming problem occurs when(Points : 5)there is an infinite solution.a constraint is redundant.more than one solution is optimal.the feasible region is unbounded.there is no solution that satisfies all the constraints given.Question 5.5.If the addition of a constraint to a linear programming problem does not change the solution, theconstraint is said to be(Points : 5)unbounded.
Saint GBA334 module 5 quiz (20/20)
10/12/2015 TheAceStudent: Saint GBA334 module 5 quiz (20/20)
data:text/html;charset=utf8,%3Ch3%20class%3D%22posttitle%20entrytitle%22%20itemprop%3D%22name%22%20style%3D%22margin%3A%200px%3B… 2/4
nonnegative.infeasible.redundant.bounded.Question 6.6.Solve the following linear programming problem:Maximize 10X + 1YSubject to: 4X + 3Y ≤ 362X + 4Y ≤ 40Y ? 3What is the maximum profit?(Points : 5)364036.7570.5Question 7.7.In the term linear programming, the word programming comes from the phrase “computerprogramming.”(Points : 5)TrueFalseQuestion 8.8.The difference between the lefthand side and righthand side of a greaterthanorequalto constraintis referred to as(Points : 5)surplus.constraint.slack.shadow price.None of the aboveQuestion 9.9.Consider the following linear programming:Maximize 10X + 1YSubject to: 4X + 3Y ≤ 362X + 4Y ≤ 40Y ≤ 3What is the value of X and Y maximizing profit?(Points : 5)X = 36, Y = 40X = 40, Y = 36X = 70.5, Y = 6.75X = 6.75, Y = 3X = 3, Y = 6.75Question 10.10.The difference between the lefthand side and righthand side of a lessthanorequalto constraint isreferred to as(Points : 5)
10/12/2015 TheAceStudent: Saint GBA334 module 5 quiz (20/20)
data:text/html;charset=utf8,%3Ch3%20class%3D%22posttitle%20entrytitle%22%20itemprop%3D%22name%22%20style%3D%22margin%3A%200px%3B… 3/4
surplus. constraint.slack.slack.shadow price.None of the aboveQuestion 11.11.Which of the following is not an assumption of LP?(Points : 5)simultaneitycertaintyproportionalitydivisibilityadditivityQuestion 12.12.A feasible solution to a linear programming problem(Points : 5)must be a corner point of the feasible region.must satisfy all of the problem’s constraints simultaneously.need not satisfy all of the constraints, only the nonnegativity constraints.must give the maximum possible profit.must give the minimum possible cost.Question 13.13.Sensitivity analysis may also be called(Points : 5)postoptimality analysis.parametric programming.optimality analysis.All of the aboveNone of the aboveQuestion 14.14.An objective function is necessary in a maximization problem but is not required in a minimizationproblem.(Points : 5)TrueFalseQuestion 15.15.Management resources that need control include machinery usage, labor volume, money spent,time used, warehouse space used, and material usage.(Points : 5)TrueFalseQuestion 16.16.A constraint with zero slack or surplus is called a(Points : 5)nonbinding constraint.resource constraint.binding constraint.nonlinear constraint.
10/12/2015 TheAceStudent: Saint GBA334 module 5 quiz (20/20)
data:text/html;charset=utf8,%3Ch3%20class%3D%22posttitle%20entrytitle%22%20itemprop%3D%22name%22%20style%3D%22margin%3A%200px%3B… 4/4
linear constraint.Question 17.17.The set of solution points that satisfies all of a linear programming problem’s constraintssimultaneously is defined as the feasible region in graphical linear programming.(Points : 5)TrueFalseQuestion 18.18.Sensitivity analysis enables us to look at the effects of changing the coefficients inthe objective function, one at a time.(Points : 5)TrueFalseQuestion 19.19.Consider the following linear programming problem:Maximize 12X + 10XSubject to: 4X + 3Y ? 4802X + 3Y ? 360All variables ? 0The maximum possible value for the objective function is(Points : 5)360.480.1520.1560.None of the aboveQuestion 20.20.In a maximization problem, when one or more of the solution variables and the profit can be madeinfinitely large without violating any constraints, the linear program has(Points : 5)an infeasible solution.an unbounded solution.a redundant constraint.alternate optimal solutions.None of the above
Saint GBA334 module 5 quiz (20/20)
