Saint MBA550/ MBA550 Final Exam 2016 2016

Question
Question 1.1.The activities that must be completed prior to the start of an activity in question are called the immediate ________ of the activity in question. (Points : 5)
successors
predecessors
successors and predecessors
followers
Question 2.2.Project management differs from management of more traditional day-to-day activities because: (Points : 5)
it has limited time frame.
it has an unlimited budget
it is more expensive
it involves more of the workforce
Question 3.3.Which of the following could not be a linear programming problem constraint? (Points : 5)
1A + 2B 3
1A + 2B = 3
1A + 2B > 3
1A + 2B < 3 Question 4.4.The theoretical limit on the number of constraints that can be handled by a linear programming problem is _____. (Points : 5) 2 3 4 unlimited Question 5.5.Which of the list of items below is not a component of a linear programming problem? (Points : 5) Constraints Objective function Decision variables Nonlinear residual Question 6.6.For most graphs the constraint equations which intersect to form a solution point must be solved simultaneously: (Points : 5) because the solution coordinates from the graph cannot be visually read with high precision. in order to confirm the mathematically determined coordinates. in order to determine all of the optimal point solution. because the slope b and the y-intercept a are not always integers. Question 7.7.For the constraints given below which point is in the feasible region of this minimization problem? 14x + 6y = 42 x + 3y = 6(Points : 5) x = 2; y = 5 x = 1; y = 2 x = 2; y = 1 x = 2; y = 3 Question 8.8.Binary variables are: (Points : 5) 0 or 1 only. any integer value. any continuous value. any negative integer value. Question 9.9.In a 0-1 integer programming model if the constraint x1 - x2 = 0 it means when project 2 is selected project 1 ________ be selected.(Points : 5) must always can sometimes can never is already Question 10.10.For a linear programming problem assume that a given resource has not been fully used. We can conclude that the shadow price associated with that constraint: (Points : 5) will have a positive value. will have a negative value. will have a value of zero. could have a positive negative or a value of zero. (no sign restrictions). Question 11.11.Thecritical path is the ________ path through the n etwork. (Points : 5) longest shortest straightest most expensive Question 12.12.Elements of project planning include: (Points : 5) defining project objectives identifying activities to crash. calculating expected times and standard deviations conducting a lessons learned session Question 13.13.Mallory Furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. If the Mallory Furniture company decides to purchase 150 big shelves and no medium shelves which of the two resources will be left over? (Points : 5) Investment money only Storage space only Investment money and storage space Neither investment money nor storage space Question 14.14. A linear programming model consists of: (Points : 5) decision variables an objective function constraints. all of the above Question 15.15.The term refers to testing how a problem solution reacts to changes in one or more of the model parameters. (Points : 5) Priority recognition Decision analysis Analysis of variance Sensitivity analysis Question 16.16.If a maximization linear programming problem consists of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients then rounding down the linear programming optimal solution values of the decision variables will ________ result in a(n) ________ solution to the integer linear programming problem. (Points : 5) always; optimal always; non-optimal never; non-optimal sometimes; optimal Question 17.17.Decision variables: (Points : 5) measure the objective function measure how much or how many items to produce purchase hire etc. always exist for each constraint measure the values of each constraint Question 18.18.Cully Turniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the storage space constraint? (Points : 5) 90 B + 100 M = 18000 90 B + 100 M = 18000 100 B + 90 M = 18000 500 B + 300 M = 18000 Question 19.19.Multiple optimum solutions can occur when the objective function is _______ a constraint line. (Points : 5) unequal to equal to linear to parallel to Question 20.20.A PERT/CPM activity has an optimistic time estimate of 3 days a most likely time estimate of 8 days and a pessimistic time estimate of 10 days. The expected time (in days) of this activity is ____. (Points : 5) 7.0 7.5 8.0 8.5