SOLUTION TO ANDREW–CARTER‚ INC.‚ CASE This case presents some of the basic concepts of aggregate planning by the transportation method. The case involves solving a rather complex set of transportation problems. Four different configurations of operating plants have to be tested. The solutions‚ although requiring relatively few iterations to optimality‚ involve degeneracy if solved manually. The costs are: [pic] The lowest weekly total cost‚ operating plants 1 and 3 with 2 closed‚ is
Premium Optimization Operations research Costs
DEPARTMENT OF APPLIED MATHEMATICS BSc Honours in Operations Research and Applied Statistics SMO 1101 Introduction to Operations Research TUTORIAL QUESTIONS 1. List and discuss the six major steps in the quantitative modeling process. 2. What is the difference between a i. descriptive and a normative model? ii. discrete and a continuous variable? 3. Show that the set ℜ n is a convex set. 4. Is the linearity assumption‚ in LP models‚ realistic in applications? 5. Print-Rite assembles printers for personal
Premium Maxima and minima Inventory Optimization
Short Info On Excel Solver Excel Solver is a tool to model and solve linear and nonlinear programming problems. To access it‚ open Excel‚ choose the tab “Data” and select “Solver” from the “Analysis” group. If it is not there‚ you have to install it‚ by clicking the “File” tab (or the Office button)‚ then “Options”‚ then “Add-Ins”‚ and then “Manage Add-Ins”. Check “Solver” there. To solve the model‚ you have to first program in on a spreadsheet. In the attached “excel-example.xls” we solve the linear
Premium Optimization Linear programming Mathematics
Attempt Score 34 out of 40 points Question 1 2 out of 2 points If exactly 3 projects are to be selected from a set of 5 projects‚ this would be written as 3 separate constraints in an integer program. Answer Selected Answer: False Correct Answer: False . Question 2 2 out of 2 points Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem. Answer Selected
Premium Linear programming Optimization
A: Formulation of the LP Model X1(Pizza)‚ X2(hotdogs)‚ X3(barbecue sandwiches) Constraints: Cost: Maximum fund available for the purchase = $1500 Cost per pizza slice = $6 (get 8 slices) =6/8 = $0.75 Cost for a hotdog = $.45 Cost for a barbecue sandwich = $.90 Constraint: 0.75X1 + 0.45X2+ 0.90(X3) ≤ 1500 Oven space: Space available = 3 x 4 x 16 = 192 sq. feet = 192 x 12 x 12 =27648 sq. inches The oven will be refilled before half time- 27648 x 2 = 55296
Premium Inch Imperial units English-language films
The three products/variables in this problem that must be considered for purchase are: x1: Pizza Slices x2: Hot Dogs x3: Barbeque Sandwiches The objective is for Julia to maximize profits. Julia’s goal is to earn a profit of at least $1‚000.00 after each game. Profit = Sell – Cost Profit Function: Z = 0.75(X1) + 1.05(X2) + 1.35(X3) Constraints and Cost: The maximum amount of funds available for purchase is $1500.00 Cost per pizza slice = $0.75 because Julia purchases each pizza for $6.00
Premium Profit maximization Optimization Profit
CLICK TO DOWNLOAD MAT 540 Week 6 Homework Complete the following problems from Chapter 2: 1. Problems 2‚ 6‚ 7‚ 12‚ 16‚ 20 2. Chapter 2 2. A company produces two products that are processed on two assembly lines. Assembly line 1 has 100 available hours‚ and assembly line 2 has 42 available hours. Each product requires 10 hours of processing time on line 1‚ while on line 2 product 1 requires 7 hours and product 2 requires 3 hours. The profit for product 1 is $6 per unit‚ and the profit
Premium Optimization Linear programming Operations research
CLICK TO DOWNLOAD MAT 540 MIDTERM EXAM 1. Regret is the difference between the payoff from the best decision and all other decision payoffs. 2. Variable costs are independent of volume and remain constant. 3. Regret is the difference between the payoff from the 4 A _________ period of real time is represented by a __________ period of simulated time. 5. A seasonal pattern is an up-and-down repetitive movement within a trend occurring periodically 6. A trend is a gradual‚
Premium Decision theory Operations research Simulation
Mat 540 Quiz 3 Question 1 .2 out of 2 points Correct The following inequality represents a resource constraint for a maximization problem: X + Y ≥ 20 Answer Selected Answer: False Correct Answer: False Question 2 .2 out of 2 points Correct Graphical solutions to linear programming problems have an infinite number of possible objective function lines. Answer Selected Answer: True Correct Answer: True Question 3 .2 out of 2 points Correct Surplus variables are only associated
Premium Linear programming Optimization Soft drink
Abstract— The work deals with the healing of the coverage hole identified in a location unaware network using fuzzy logic. The hole identification is done based on the Delaunay Triangulation method and the Empty circle concept. The main contribution here is that the healing of the coverage hole is done on a location unaware network based on the energy‚ angle and distance of the nodes involved in the healing process using the fuzzy rule set. Only the partial location information like the distance
Premium Research Scientific method Probability theory