Question 11 an assignment problem is a special type of transportation problem.
True
False
Question 12 when formulating a linear programming problem on a spreadsheet, the data cells will show the optimal solution.
True
False
Question 13 an example of a decision variable in a linear programming problem is profit maximization.
True
False
Question 14 Predictive analytics is the process of using data to.
C) determine the break-even point.
D) solve linear programming problems.
B) predict what will happen in the future.
E) determine the best course of action for the future.
A) analyze trends.
Question 15 A transportation problem requires a unit cost for every source-destination combination.
True
False
Question 16 which of the following are components of a mathematical model for decision making?
D) Parameters.
B) An objective function.
C) Constraints.
A) Decision variables.
E) All of the above answer choices are correct.
Question 17 A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called:
C) a cost-benefit tradeoff problem.
A) a resource-allocation problem.
E) None of the answer choices are correct.
D) a mixture problem.
B) a blending problem.
Question 18 All constraints in a linear programming problem are either ≤ or ≥ inequalities.
True
False
Question 19 Linear programming models can have either ≤ or ≥ inequality constraints but not both in the same problem.
True
False
Question 20 The best feasible solution is called the optimal solution.
True
False
11. The given statement is TRUE
12. The given statement is FALSE
13. The given statement is FALSE
14. The correct option is A) analyze trends.
15. The given statement is TRUE
Do give a positive rating if you think this answer helped
As per Chegg's guidelines, we are required to do only the first four parts of a question.
Question 11 an assignment problem is a special type of transportation problem. True False Question 12...
3. 1-10 are True/False questions, Please write True (T) or False (F) next to each question 11-20 are multiple choice questions, Please circle the correct answer for each question.(20) 1. The linear programming approach to media selection problems is typically to either maxim The use of LP in solving assignment problems yields solutions of either O or 1 for each An infeasible solution may sometimes be the optimal found by the corner point method the number of ads placed per...
Which of the following statements is false? A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply nodes nor destination nodes. The assignment problem is a special case of the transportation problem in which all supply and demand values equal one. The objective of the transportation problem is to minimize the number of shipments necessary to satisfy total demand at the destinations. Converting a transportation problem linear programming from profit maximization to cost...
Create a worksheet called "Transport a. Enter the following transportation model into excel following the linear programming layout. Hint: this is unbalanced Make sure to include your 1) decision variables, 2) objective function, 3) constraints, 4) inequalities, 5) confounds, 6) and solution b. c. Once you run your model, select "keep solver solution". Name the sheet that's created "solution_basic" DESTINATIONS 13 20 20 25 10 12 30 16 35 20 30 25
1. (6 points) Find an optimal solution for the following transportation problem using the minimal cost method and the transportation algorithm: Minimize lahi + 2x12 + 2x13 + 4x21 + 3x22 + 4x23 + 4x31 + 1x32 + 3x33, subject to the constraints X11 + X12 + X13 = 100. x21 +x22 +x23 = 50. r31 + 232 +x33 100 x11 + 2'21 +2'3,-150. 12 22+32-50 x13 + x23 + x33-50. for all i, j = 1.2.3. xij > 0,...
True or False? 1. If an LP has multiple optimal solutions, then all solutions have the same objective function value (such as total profit or cost). 2. As long as all prices (objective coefficients) change within their respective ranges, the optimal solution of a linear program does not change. 3. When a dual price changes within its range, the optimal solution does not change. 4. The solution of a linear program always consists of whole numbers (integers). That is why...
Assignment 1. Linear Programming Case Study Your instructor will assign a linear programming project for this assignment according to the following specifications. It will be a problem with at least three (3) constraints and at least two (2) decision variables. The problem will be bounded and feasible. It will also have a single optimum solution (in other words, it won’t have alternate optimal solutions). The problem will also include a component that involves sensitivity analysis and the use of the...
QUESTION 15 3 p The objective of a linear programming problem is to maximize 1.50X + 1.50Y, subject to 3X + 2Y = 600, 2X +4YS 600, and X,Y 2 0. What is the optimal (best) value of the objective function, subject to the constraints and rounded to the nearest whole number? 225 300 338 425 500
Question 1: (20 Marks) In the following write (True) or (False) taking into account the sentences 1- Operational research specialists are involved to predict the future behavior using an appropriate model ) 2- Pocock stresses that operational research is not an applied science 3- India was one of the few first countries who started using O.R. in 1969 ( ) 4- Decision theory is concerned with making decision without any conditions ( ) 5- Markov process cannot be used in...
QUESTION 20 In what parts of a linear programming formulation do the decision variables appear? In the objective function only In the RHS of constraints only In the LHS of constraints only Can appear in both RHS and LHS of constraints AND the objective function None are correct QUESTION 21 A constraint that directly affects the optimal solution in a linear program is called A non-binding constraint A null constraint A binding constraint None of the above QUESTION 22 Which...
Question #1 (15 Marks) a) (8 Marks) Answer the following questions with True or False. 1) 2) 3) Every basic solution in the assignment problem is necessarily degenerate. The assignment problem cannot be solved using the transportation technique. If the gradient vector of a function at a given point is zero, the point can only be a maximum or minimum. If a single-variable function has two local minima, it must have at least one local 4) maximum 5) The Golden...