A company produces two products, A and B, which have profits of $9 and $7, respectively. Each unit of product must be processed on two assembly lines, where the required production times are as follows: Product Line 1 Line 2 A 12 4 B 4 8 Total hours 60 40 1) Formulate a linear programming model to determine the optimal product mix that will maximize profit.

A company produces two products, A and B, which have profits of $9 and $7, respectively. Each unit of product must be processed on two assembly lines, where the required production times are as follows: Product Line 1 Line 2 A 12 4 B 4 8 Total hours 60 40 1) Formulate a linear programming model to determine the optimal product mix that will maximize profit.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.3: Capital Budgeting Models

Problem 3P: Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows:...

See similar textbooks

Similar questions

Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows: 14, 58, 912, 1316, and 1720. a. Find the optimal investments when at most one investment from each group can be selected. b. Find the optimal investments when at least one investment from each group must be selected. (If the budget isnt large enough to permit this, increase the budget to a larger value.)
General Ford has two plants, two warehouses, and threecustomers. The locations of these are as follows:Plants: Detroit and AtlantaWarehouses: Denver and New YorkCustomers: Los Angeles, Chicago, and PhiladelphiaCars are produced at plants, then shipped to warehouses,and finally shipped to customers. Detroit can produce 150cars per week, and Atlanta can produce 100 cars per week.Los Angeles requires 80 cars per week; Chicago, 70; andPhiladelphia, 60. It costs $10,000 to produce a car at eachplant, and the cost of shipping a car between two cities isgiven in Table 62. Determine how to meet General Ford’sweekly demands at minimum cost.
A company produces two products, A and B, which have profits of $9 and $7, respectively. Each unit of product must be processed on two assembly lines, where the required production times are as follows. Hours/Unit Product Line 1 Line 2 A 12 4 B 4 8 Total hours 60 40 a. Formulate a linear programming model to determine the optimal product mix that will maximize profit. b. Transform this model into standard form.
Solve the problem using Linear programming model formulations, slack variables, and graphical solutions to determine the optimal product mix that will maximize profit. A company produces two products,A and B, which have profits of 9.00 in product A and 7.00 in product B. Each unit of product must be processed on two assembly lines, where the required production times are as follows Hours/unit Product Line 1 Line 2 A 12 4 B 4 8 Total Hours 60 40 What would be the effect on the optimal solution if the profit for product B was increased from 7.00 to 15.00? Solve with graphical solutions. What would be the effect on the optimal solution if the production time on line 1 was reduced to 40 hours? Solve with graphical solutions.
At the end of a cycle of schedules, a trucking firm has a surplus of one vehicle each in cities A, B, C, D, E, and F and a deficit of one vehicle each in cities 1, 2, 3, 4, 5, and 6. The distances between cities with a surplus and the cities with a deficit are shown below. Find an assignment of surplus vehicles to deficit cities that will result in a minimum total distance. What is the total distance? -Solve the following transportation models using Excel Solver. -Find the optimal solution for the transportation problem having the cost and requirement tablebelow.
General Ford has two plants, two warehouses, and three customers. The locations of these as follows: Plants: Detroit and Atlanta;Warehouses: Denver and New YorkCustomers: Los Angeles, Chicago, and Philadelphia Cars are produced at plants, then shipped to warehouses, and finally shipped to customers. Detroit can produce 142 cars per week, and Atlanta can produce 86 cars per week. Los Angeles requires 50 cars per week; Chicago, 52; and Philadelphia 84. It costs $9500 to produce a car in Detroit and $7500 to produce a car in Atlanta, and the costs of shipping a car between cities are given in the table below. What is the minimal cost of meeting General Ford's weekly demands?
A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. The firm’s problem falls within which classification? Multiple Choice Cost-benefit-trade-off Assignment problems Transshipment problems Transportation problems Resource-allocation
A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. Which of the following constraints is unnecessary for this problem (xi,j is the number of widgets shipped from factory i to customer j)? A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced…
The Bunker Manufacturing firm has five employees and six machines and wants to assign the employees to the machines to minimize cost. A cost table showing the cost incurred by each employee on each machine follows: Because of union rules regarding departmental transfers, employee 3 cannot be assigned to machine E, and employee 4 cannot be assigned to machine B. Solve this problem, indicate the optimal assignment, and compute total minimum cost.
A beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. A graph with 7 nodes and 9 arcs is shown. Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11. Node 2 is connected to node 3 by arc of value 4. Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7. Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6. Node 5 is connected to node 6 by arc of value 7. Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3. Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.) Min s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7…
There are three factories located at Arkansas (AR), Indianapolis (IN), and Texas (TX) respectively. From these locations, a certain commodity is to be delivered to each of the two warehouses situated at A and B. The revenue per commodity item is $18. The weekly demand of the warehouse A and B are respectively 45 and 60 units of the commodity while the production capacity of the factories at AR, IN, and TX are respectively 24, 28, and 33 units. The cost of transportation per unit is given as below. Cost Warehouse A Warehouse B AR 5 3 IN 6 6 TX 2 4 To maintain a good relationship with all the factories, warehouse A requires that it receives at least 30% of its product from factory in AR. Realize that it is making good profit in warehouse B, TX requires that at least 35% of its product shipped to warehouse B. Formulate (without solving) a linear programming problem to maximize the profit.
The distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2. 69 (lat1 − lat2)2 + (long1 − long2)2 Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The file Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations. Ted would like to find a wedding location that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Assuming that the wedding can occur anywhere, find the latitude and longitude of the optimal location. (Hint: Notice that all longitude values given for this problem are negative. Make sure that you do not check the option for Make Unconstrained Variables Non-Negative in Solver. Round your answers to three decimal places.) latitude of the optimal wedding location:…