🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →

HomeStudy Guides420,000CA160,000

ADMS 3330 Study Guide - Linear Programming Relaxation, Sensitivity Analysis, Feasible Region

285 views15 pages

ceruleangoat757

3 Mar 2013

School

York University

Department

Administrative Studies

Course

Professor

For unlimited access to Study Guides, a Grade+ subscription is required.

Document Summary

Which of the following is the most useful contribution of integer programming? a. b. c. d. Topic: finding whole number solutions where fractional solutions would not be appropriate using 0-1 variables for modeling flexibility increased ease of solution provision for solution procedures for transportation and assignment problems b. In a model, x1 > 0 and integer, x2 > 0, and x3 = 0, 1. Which solution would not be feasible? a. b. c. d. Topic: x1 = 5, x2 = 3, x3 = 0 x1 = 4, x2 = . 389, x3 = 1 x1 = 2, x2 = 3, x3 = . 578 x1 = 0, x2 = 8, x3 = 0 c. Rounded solutions to linear programs must be evaluated for a. b. c. d. Topic: feasibility and optimality. sensitivity and duality. relaxation and boundedness. each of the above is true. a. Rounding the solution of an lp relaxation to the nearest integer values provides a. b. c. d.

Related Documents

ADMS 3330 Study Guide - Midterm Guide: Synthetic Fiber, Shade Tolerance, Dvd Region Code

turquoisemosquito948

ADMS 3330 Study Guide - Feasible Region, Linear Programming, Dvd Region Code

carminecheetah632

ADMS 3330 Study Guide - Final Guide: Start I

carminecheetah632

Related Questions

Need assistance with these problems!

1. The following is a linear programming formulation of a labor planning problem. There are four overlapping shifts, and management must decide how many employees to schedule to start work on each shift. The objective is to minimize the total number of employees required while the constraints stipulate how many employees are required at each time of day. The variables X₁ - X₄ represent the number of employees starting work on each shift (shift 1 through shift 4).
Minimize X₁ + X₂ + X₃ + X₄
Subject to: X₁ + X₄%u2265 12 (shift 1)
X₁ + X₂%u2265 15 (shift 2)
X₂ + X₃%u2265 16 (shift 3)
X₃ + X₄%u2265 14 (shift 4)
all variables %u2265 0

Find the optimal solution using QM.
How many workers would be assigned to shift 1? (Points : 3) 12
13
0
none of the above

2. When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and: (Points : 3)

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 above.
all of the above.

3. Multiple optimal solutions can occur when the objective function is __________ a constraint line. (Points : 3)

unequal to
equal to
linear to
parallel to

4. When applying linear programming to diet problems, the objective function is usually designed to: (Points : 3)

maximize profits from blends of nutrients.
maximize ingredient blends.
minimize production losses.
maximize the number of products to be produced.
minimize the costs of nutrient blends.

5. For a maximization problem, assume that a constraint is binding. If the original amount of a resource is 4 lbs., and the range of feasibility (sensitivity range) for this constraint is from 3 lbs. to 6 lbs., increasing the amount of this resource by 1 lb. will result in the: (Points : 3)

same product mix, different total profit.
different product mix, same total profit as before.
same product mix, same total profit.
different product mix, different total profit.

6. The corner point solution method: (Points : 3)

will yield different results from the isoprofit line solution method.
requires that the profit from all corners of the feasible region be compared.
will provide one, and only one, optimum.
requires that all corners created by all constraints be compared.
will not provide a solution at an intersection or corner where a non-negativity constraint is involved.

7. Consider the following linear programming problem.
Maximize 4X + 10Y
Subject to: 3X + 4Y %u2264 480 and 4X + 2Y %u2264 3 360
all variables %u2265 0
The feasible corner points are (48,84), (0,120), (0,0), (90,0).

What is the maximum possible value for the objective function? (Points : 3)

1032
1200
360
none of the above

8. When using Excel's Solver to input and solve a linear programming problem, it is essential that one perform an additional task before submitting the formulation. That important additional function is: (Points : 3)

guessing the values of the variables.
putting in a value for the objective function.
choosing the options for assuming both a linear model and non-negative variables.
resetting the parameters.
none of the above.

9. Consider the following linear programming problem.
Maximize 5X + 6Y
Subject to: 4X + 2Y %u2264 420 and 1X + 2Y %u2264 120
all variables %u2265 0

Which of the following points (X,Y) is not feasible? (Points : 3)

(50,40)
(20,50)
(60,30)
none of the above

10. ____________ is used to analyze changes in model parameters. (Points : 3)

Optimal solution
Feasible solution
Sensitivity analysis
None of the above