A manufacturing company produces two types of products called X and Y. Each product uses four different machines like lathe, drilling, grinding & milling operations. The profit per unit of selling X and Y are 7 RO and 3 RO respectively. Formulate a linear programming model with the given constraints to determine the production volume of each product in order to maximize the total profit (in OR). Solve the following linear programming model by using Graphical method. Subject to, 6X + 4Y ≤ 24 X + 2Y ≤ 6 -X + Y ≤ 1 Y ≤ 2 and X,Y ≥ 0

A manufacturing company produces two types of products called X and Y. Each product uses four different machines like lathe, drilling, grinding & milling operations. The profit per unit of selling X and Y are 7 RO and 3 RO respectively. Formulate a linear programming model with the given constraints to determine the production volume of each product in order to maximize the total profit (in OR). Solve the following linear programming model by using Graphical method. Subject to, 6X + 4Y ≤ 24 X + 2Y ≤ 6 -X + Y ≤ 1 Y ≤ 2 and X,Y ≥ 0

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter10: Introduction To Simulation Modeling

Section: Chapter Questions

Problem 35P: Lemingtons is trying to determine how many Jean Hudson dresses to order for the spring season....

See similar textbooks

Similar questions

Lemingtons is trying to determine how many Jean Hudson dresses to order for the spring season. Demand for the dresses is assumed to follow a normal distribution with mean 400 and standard deviation 100. The contract between Jean Hudson and Lemingtons works as follows. At the beginning of the season, Lemingtons reserves x units of capacity. Lemingtons must take delivery for at least 0.8x dresses and can, if desired, take delivery on up to x dresses. Each dress sells for 160 and Hudson charges 50 per dress. If Lemingtons does not take delivery on all x dresses, it owes Hudson a 5 penalty for each unit of reserved capacity that is unused. For example, if Lemingtons orders 450 dresses and demand is for 400 dresses, Lemingtons will receive 400 dresses and owe Jean 400(50) + 50(5). How many units of capacity should Lemingtons reserve to maximize its expected profit?
Facility Location. A paper products manufacturer has enough capital to build and manage some additional manufacturing plants in the United States in order to meet increased demand in three cities: New York City, NY; Los Angeles, CA; and Topeka, KS. The company is considering building in Denver, CO; Seattle, WA; and St. Louis, MO. Max Operating Capacity 400 tons/day 700 tons/day Denver Seattle $10/ton $17/tor $5/ton $11/ton.... $18/ton.... $28/ton Los Angeles Topeka New York City Figure 1: Graphical representation of the given data = • The cost fi of building plants in these cities is fi $10,000,000 in Seattle. Unmet Demand 300 tons/day 100 tons/day 500 tons/day • Due to geographic constraints, plants in Denver and Seattle would have a maximum operating capacity kį of 400 tons/day and 700 tons/day respectively. $5,000,000 in Denver and f2 = • The cost cij per ton of transporting paper from city i to city j is outlined in Figure 1. • The unmet demand d, for Los Angeles, Topeka, and New…
What function does linear programming play in OR?
A transport company engaged in carying parcels has three branches to serve five customers. This distance (km) from each branch to each of the customers is given below: Branches Customers Number of C trucks available I 10 12 6. 15 II 4. 4. 6. 6. 7. 12 III 15 7. 11 13 8. 16 Number of 4. 6. trucks required i. Find out using Vogel's Approximation Method (VAM) the allocation of trucks from branches to customers in order to minimize the total cost of transportation assuming that the cost is proportional to distance. What is the minimum required distance (km) to be run by the trucks? i. If an amival of a V.V.I.P. blocks the traffic from branch II to customers D and E, what should be the optimal allocation in order to minimize the total transportation cost? 111. 8.
Solve the following Linear Programming model using the graphical method (USING EXCEL){Write the steps of construction} Q1)MaximizeH = x + 3y Objective functionsubject tox + y ≤ 502x + y ≤ 60 x ≥ 0, y ≥ 0
The High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. A portion of the network is as follows: Due to the varying pipe sizes, the flow capacities vary. By selectively opening and closing sections of the pipeline network, the firm can supply any of the storage locations. a. If the firm wants to fully utilize the system capacity to supply storage location 7, how long will it take to satisfy a location 7 demand of 100,000 gallons? What is the maximal flow for this pipeline system? b. If a break occurs on line 2–3 and that line is closed down, what is the maximal flow for the system? How long will it take to transmit 100,000 gallons to location 7?
A company that makes handbags, razor bags and backpacks needs to make the most of its raw materials. The production includes leather and synthetic materials, and leather is the scarce raw material. The production process requires two types of skilled labor: sewing and finishing. The following table gives the availability of resources, their consumption by the three products and the profits per unit. Requested: Get the Case Variables Obtain the Objective Function Get Restrictions Create the Simplex Table Obtain the Optimal Solution and Slack Variables
fertilizer manufacturer has to fulfill supply contracts to its two main customers (650 tons to Customer A and 800 tons to Customer B). It can meet this demand by shipping existing inventory from any of its three warehouses. Warehouse 1 (W1) has 400 tons of inventory onhand, Warehouse 2 (W2) has 500 tons, and Warehouse 3 (W3) has 600 tons. The company would like to arrange the shipping for the lowest cost possible, where the per-ton transit costs are as follows: W 1 W 2 W 3 Customer A $7.50 $6.25 $6.50 Customer B $6.75 $7.00 $8.00 Write the objective function and the constraint in equations. Let Vij= tons shipped to customer i from warehouse j, and so on. For example, VA1=tons shipped to customer A from warehouse W1. This exercise contains only parts b, c, d, e, and f. Part 2 b) The objective function for the LP model =
Anna and Bob are the only residents of a small town. The town currently funds its fire department solely from the individual contributions of these two residents. Each of the two residents has a utility function over private goods x and total number of firemen M, of the form: u(x, M) = 2 ln x + In M. The total provision of firemen hired, M, is the sum of the number hired by each of the two persons: M = Mª + M². Ann and Bob both have income of 200 each, and the price of both the private good and a fireman is 1. They are limited to providing between 0 and 200 firemen. For the purposes of this problem, you can treat the number of firemen as a continuous variable (it could be man-years). Suppose that we identify the social welfare in this town by the sum of utilities of Ann and Bob. What is the socially optimal number of firemen?
Create spreadsheets and use Solver to determine the correct volumes to be produced to minimize cost for the following problem. Your company has two trucks that it wishes to use on a specific contract. One is a new truck the company is making payments on, and one is an old truck that is fully paid for. The new truck’s costs per mile are as follows: 54₵ (fuel/additives), 24₵ (truck payments), 36₵ (driver), 12₵ (repairs), and 1₵ (misc.). The old truck’s costs are 60₵ (fuel/additives), 0₵ (truck payments), 32₵ (rookie driver), 24₵ (repairs), and 1₵ (misc.). The company knows that truck breakdowns lose customers, so it has capped estimated repair costs at $14,000. The total distance involved is 90,000 miles (to be divided between the two trucks).
Solve the linear programming problem by the method of corners. Maximize P= x + 6y subject to x + y s4 2x + y s6 x 2 0, y 20 The maximum is P = at (x, y) = Need Help? Read It
Solve this theoretically not on excel please .: A refiner in city Q serves four customers near city W and maintains consignment inventory (owned by the refiner) at each location. Currently, the refiner uses TL (truckload) transportation to deliver separately to each customer. Each truck costs $(740) plus $(309) per stop. The refiner is considering aggregating deliveries to city W on a single truck. The demand of the first customer is 75 tons a year, the demand of the second customer is 30 tons per year, and the demand of the third and fourth customers is 10 tons per year. The product cost is $8,000 per ton, and it uses a holding cost of (24)%. The truck capacity is 20 tons. a. What is the optimal delivery policy to each customer if the refiner ships separately to each of them? What is the annual total inventory-related cost? b. What is the optimal delivery policy to each customer if the refiner aggregates shipments to each of the four customers on every truck that goes to city W? What…