## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

)

**Part I: True/False
**

1. Given that x and y are decision variables, the equation 3xy = 9 is linear. 2. A feasible solution is one that satisfies at least one of the constraints of a linear programming

problem.

3. Decision variable is one of the parameters in a linear programming model. 4. Alternative (multiple) optimal solution occurs only if there is no optimum solution. 5. Unbounded feasible region always results in an unbounded solution. 6. A problem is a single criterion problem if there is only one objective function to be optimized. 7. Profit is the difference between volume multiplied by price and the sum of fixed and variable costs. 8. In LP the constraints usually appear as linear expressions that are ≤ or = or ≥ than a parameter . 9. In LP < or > are not allowed for the constraints. 10. Fixed cost increases as the number of produced products increases. 11. In LP the objective function always consists of either maximizing or minimizing some value. 12. An infeasible solution violates at least one of the constraints. 13. Linear programming problems can be solved graphically, if they have any number of decision

**variables and only 2 constraints.
**

14. The feasible solution area contains infinite solutions to the linear program. 15. Sensitivity ranges can be computed only for the right-hand sides of constraints. 16. The sensitivity range for a constraint quantity value is the range over which the shadow price is valid. 17. A change in the value of an objective function coefficient will always change the value of the

optimal solution.

**Part II: Multiple Choice
**

1. Which of the following could not be a constraint for a linear programming problem? a. 1A + 2B ≤ 3. b. 1A + 2B ≥ 3. c. 1A + 2B. d. 1A + 2B = 3. e. 1A + 2B + 3C ≤ 3. 2. What is the optimal solution for the following problem? Maximize P = 3x + 15 y subject to 2x + 4y ≤ 12 5x + 2y ≤ 10 and x ≥ 0, y ≥ 0. a. b. c. d. e. (x, y) = (0, 3). (x, y) = (2, 0). (x, y) = (0, 0). (x, y) = (1, 5). (x, y) = (2, -3).

3. Which one of the following is true about the optimal solution for a linear programming problem: a. b. c. d. e. The optimal solution always uses all the limited resources available The optimal solution does not necessarily use up all the limited resources available The optimal solution always leaves at least one limited resource unused none of the above. a and c

4. All variables in the solution of a linear programming problem are either positive or zero because of the existence of: a. b. c. d. e. an objective function structural constraints limited resources none of the above. a and c

5. It is possible to solve a linear programming problem graphically if there are no more than two: a. b. c. d. e. non-negativity constraints decision variables inequalities constraints objective functions

6. In linear programming, non-negativity implies that a variable cannot have: a. b. c. d. e. a negative coefficient in the objective function a negative coefficient in a constraint a negative right hand side value none of the above. b and c

7. If for an optimal solution for a linear programming problem, the slack variable is equal to zero, then: a. b. c. d. e. the solution is not feasible the solution is not possible the entire amount of resource identified with the constraint in which the slack variable appears has been used up all of the above a and b

8. Which of the following are components of a linear programming model for decision making? a. Decision variables. b. An objective function. c. Constraints. d. All the data. e. All of the above. 9. Which of the following is an inequality or equation that expresses a restriction in a mathematical model? a. Decision variable. b. Parameter. c. Constraint. d. Objective function. e. None of the above.

Consider the Linear Programming problem given below to answer the questions in this section: Max s.t. 8X + 7Y 15X + 5Y 10X + 6Y X+ Y X, Y

< < <

75 60 8 0

Constraint (1) Constraint (2) Constraint (3)

1. A feasible solution to the above problem is: a. X = 5, Y = 3 b. X = 3, Y = 5 c. X = 4, Y = 6 d. X = 3, Y = 6 e. None of the above

2. What is the value of the objective function at (X=3, Y=6) a. 58 b. 66 c. 61 d. 74 e. None of the above

3. Which of the following points represents an infeasible solution a. (0, 0) b. (2, 3) c. (3, -2) d. (4, 3) e. None of the above 4. If the optimal solution is (X=3 , Y=5), which constraints are fully utilized (i.e., which constraints are binding) a. 2 & 3 b. 1 & 2 c. 1 & 3 d. All constraints are fully utilized e. None of the constraints are fully utilized

Answer the following questions using the problem given below: An ad campaign for a new snack chip will be conducted in a limited geographical area and can use TV time, radio time, and newspaper ads. Information about each medium is shown below: Medium TV Radio Newspaper Cost Per Ad 500 200 400 # Reached 10000 3000 5000 Exposure Quality 30 40 25

If the number of TV ads cannot exceed the number of radio ads by more than 4, and if the advertising budget is $10000, develop the model that will maximize the number reached and achieve an exposure quality of at least 1000. If the decisions Variables are defined as following: Let T = the number of TV ads Let R = the number of radio ads Let N = the number of newspaper ads 1. What is the objective function? a. Max 10000T + 3000R + 5000N b. Max 500T + 200R + 400N c. Max 30T + 40R + 25N d. Max 500T + 3000R + 25N e. Max 1000T + 500R + 30N 2. What is the advertising budget constraint? a. 500T + 200R + 400N ≥ 10000 b. 10000T + 3000R + 5000N 10000 c. 500T + 200R + 400N ≤ 10000 d. 500T + 200R + 400N =10000 e. 30T + 40R + 25N ≤ 10000 3. Which constraint represents the condition: "the number of TV ads cannot exceed the number of radio ads by more than 4?" a. T-R4 b. T-R≥4 c. T-R=4 d. T+R≥4 e. T+R4 4. Which constraint represents the condition: "achieve an exposure quality of at least 1000.” a. 30T + 40R + 25N 1000 b. 30T + 40R + 25N = 1000 c. 30T + 40R + 25N ≤ 1000 d. 30T + 40R - 25N 1000 e. 30T - 40R + 25N 1000 5. Which constraint represents the condition: "achieve an exposure quality of at most 3000.” a. 30T + 40R + 25N 3000 b. 30T + 40R + 25N = 3000 c. 30T + 40R + 25N ≤ 3000 d. 30T + 40R - 25N 3000 e. 30T - 40R + 25N ≤ 3000

Refer to the following sensitivity report for a maximization problem and answer the questions below: ADJUSTABLE CELLS

Cell $B$9 $C$9 Name Number of Tables Number of Chairs Final Value 30 0 Objective Coefficient 5 4 Allowable Increase 1E + 30 6 Allowable Decrease 3 1E + 30

.

.

----------------------------------------------------------------------------------------------------------------------------------------------------------.

CONSTRAINTS

Final Shadow Constraint Allowable Allowable Cell Name Value Price R. H. S. Increase Decrease . $D$6 Assembly 90 0 120 1E + 30 30 $D$7 Painting 60 2.5 60 20 60 ___________________________________________________________________ .

.

1

What is the optimal value of the objective function? a. 30. b. 90. c. 60. d. 150. e. 120. If you were to decrease only one of the resources, which one of the following would be the best action to take? a. decrease Assembly by 30 units. b. decrease Painting by 60 units c. decrease Assembly by 31 units d. decrease Painting by 61 units. e. decrease Assembly by 29 units. If you were to increase only one of the resources, which one of the following would be the best action to take? a. increase Assembly by 90 units. b. increase Assembly by 120 units. c. increase Painting by 2.5 units. d. increase Painting by 20 units. e. increase Assembly by 30 units. What is the allowable range for the Painting constraint’s RHS value? a. 60≤RHS≤120 b. 120≤RHS≤80 c. 0≤RHS≤80 d. 60≤RHS≤20 e. none of the above

2

3

4

5

Which of the following is true about the allowable range for the objective function value of the first variable (Number Of Tables) a. it has no upper limit b. it has no lower limit c. it can decrease by 5 d. it can increase by 3 e. none of the above

6

If the objective function coefficient for number of tables and number of chairs change to 4 and 6 respectively, then: a. The optimum solution will not change. b. The problem have to be resolved to find the optimum solution c. The shadow prices are valid d. There will be no optimum solution e. None of the above

7

If the RHS value of Assembly decrease by 20 and the RHS value of Painting increase by 10 then: a. The optimum solution will not change. b. The problem have to be resolved to find the new optimum solution c. The shadow prices are valid d. The shadow prices may or may not be valid e. None of the above

**Spread Sheet Modeling
**

Questions 1 through 4 in this part refer to the following spreadsheet model for a cost minimization problem.

A 1 2 3 4 5 6 7 8 9 10 Unit Cost Benefit A B C B Activity 1 $15 C Activity 2 $20 D E F

Contribution per Unit 1 2 2 3 1 1 Activity 1 2 Activity 2 4

Totals 10 16 6

>= >= >=

Needed 10 6 6 Total Cost $110

Solution

1

Where are the data cells located? a. B2:C2, B5:C7, and F5:F7. b. B2:C2. c. B10:C10. d. F10. e. None of the above. Where are the changing cells located? a. B10:C10. b. B2:C2, B5:C7, and F5:F7. c. B2:C2. d. F10. e. None of the above.

2

3

Where is the target cell located? a. B2:C2. b. B2:C2, B5:C7, and F5:F7. c. F10 d. B10:C10. e. None of the above. Where are the output cells located? a. B2:C2. b. B2:C2, B5:C7, and F5:F7. c. B10:C10. d. F10. e. None of the above. Where are the decision variables located? a. B10:C10. b. B2:C2, B5:C7, and F5:F7. c. B2:C2. d. F10. e. None of the above.

4

5

- Operation Research
- 4.Linear Programming
- Graphical Problem Linear Programming
- Lp2005 Full Bw
- Operation Research
- GATE Production and Industrial Engineering 2007
- ch08[1]managerialeconomic
- Lecture 1
- Operation research paper
- Decision Models for Management
- .. TenthClass Content EM Mathematics 04 LinearProgramming
- Linear Programming
- SampleFINAL KEY 205 Taylor
- 2. Graphical Solution
- Goal Programming
- Graphical Method in LP
- Linear Program 1
- Operations Research I
- 05910689
- chap1-2.pptx
- 10.1.1.42
- Linear Prog.
- Optimization Supply Chain Planning Under Uncertainty
- 361 Chapter 10 MC Solutions
- optimizing profit
- 9. Eng-Heuristic Algorithm on Monte Carlo for Constrained-Chandan Choubey _1
- SYLABUS
- 2007-LNCS
- Umar Suleman
- Transportation and Assignment Models

Skip carousel

- Quantitative Management for Analysis
- ON Fuzzy Linear Programming Technique Application
- UT Dallas Syllabus for opre6302.001.07f taught by Kathryn Stecke (kes021000)
- A New Method for Solving Deterministic Multi-Item Fuzzy Inventory Model with Three Constraints
- 65726_1970-1974
- UT Dallas Syllabus for opre6302.mbc 06s taught by Metin Cakanyildirim (metin)
- UT Dallas Syllabus for opre6302.001.09f taught by Kathryn Stecke (kes021000)
- UT Dallas Syllabus for opre6302.001.10f taught by Kathryn Stecke (kes021000)
- Optimization
- UT Dallas Syllabus for opre6302.001.08f taught by Kathryn Stecke (kes021000)

- Syllabus 210
- 205 Subtotal
- Syllabus 205
- Tutorial_205_summer_2013_2014
- Chapter 1
- 03 Ch 04
- SampleFINAL KEY 205
- 210 Subtotal
- Tutorial Times
- Tutorial Times (New 3)
- Tutorial Times (Newer)
- Ch 2
- Final Grades
- Ch 17 (Project Management).ppt
- CH 1 Stvnsn Ed 11
- Ch 5 (Capacity Planning).pptx
- Syllabus QM205 Fall 2013
- Syllabus QM210 Fall 2013
- SampleFINAL 205 Taylor Excel
- SampleFINAL 205 Taylor Excel
- SampleFINAL 205 Taylor Excel
- SampleFINAL KEY 205 Taylor
- SampleFINAL 205 Taylor Excel

Sign up to vote on this title

UsefulNot usefulRead Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading