The minimum distance travelled between the factory and the warehouse using linear programming. Introduction: Linear programming: It is a linear optimization technique followed to develop the best outcome for the linear programming problem. The outcome might be to maximize profit, minimum cost or to determine the optimal product mix. The outcome will take into consideration the constraints present in achieving the solution.

Question

Want to see the full answer?

Answer 1

Question

Chapter B, Problem 38P

Summary Introduction

To determine: The minimum distance travelled between the factory and the warehouse using linear programming.

Introduction:

Linear programming:

It is a linear optimization technique followed to develop the best outcome for the linear programming problem. The outcome might be to maximize profit, minimum cost or to determine the optimal product mix. The outcome will take into consideration the constraints present in achieving the solution.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: ______________________________________________________________

Please use excel for this problem A furniture manufacturer produces two types of tables – country and contemporary – using three types of machines. The time required to produce the tables on each machine is given in the following table: Machine Country Contemporary Total Machine Time Available Per Week Router 3.5 4.0 1,000 Sander 4.5 6.5 2,000 Polisher 3.0 2.0 1,500 Country tables sell for $395 and contemporary tables sell for $515. Management has determined that at least 25% of the tables made should be country and at least 38% should be contemporary. How many of each type of table should the company manufacture if it wants to maximize its revenue? Formulate an LP model for this problem Create the spreadsheet model and use Solver to solve the problem.

Solve the following problems using Excel Solver or R Studio. A company produces cars in Atlanta, Boston, Chicago, and Los Angeles. The cars are then shipped to warehouses in Memphis,Milwaukee, New York City, Denver, and San Francisco. The number of cars available at each plant is given in Table 1. Eachwarehouse needs to have available the number of cars given in Table 2. The distance (in miles) between the cities is given inTable 3. Assuming that the cost (in dollars) of shipping a car equals the distance between two cities, determine an optimalshipping schedule.