Solve the following. Follow the Linear Programming Model Formulation Steps. 1. Moore’s Meatpacking Company produces a hot dog mixture in 1,000-pound batches. The mixture contains two ingredients—chicken and beef. The cost per pound of each of these ingredients is as follows: Ingredient Cost/lb. Chicken $3 Beef $5 Each batch has the following recipe requirements: At least 500 pounds of chicken At least 200 pounds of bee The ratio of chicken to beef must be at least 2 to 1. The company wants to know the optimal mixture of ingredients that will minimize cost. Formulate a linear programming model for this problem.

Solve the following. Follow the Linear Programming Model Formulation Steps. 1. Moore’s Meatpacking Company produces a hot dog mixture in 1,000-pound batches. The mixture contains two ingredients—chicken and beef. The cost per pound of each of these ingredients is as follows: Ingredient Cost/lb. Chicken $3 Beef $5 Each batch has the following recipe requirements: At least 500 pounds of chicken At least 200 pounds of bee The ratio of chicken to beef must be at least 2 to 1. The company wants to know the optimal mixture of ingredients that will minimize cost. Formulate a linear programming model for this problem.

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.)
Solve for the linear programming 1. Minimize Z=3x+5y so that x+3y >=3 x+y >=2 x >=0 y >=0 Reshma wishes to mix two types of food, P and Q in such a way that the vitamin contents of the mixture contain at least 8 units of Vit. A and 11 units of Vit. B. Food P costs Php60/kg and Food Q costs Php80/kg. Food P contains 3 units/kg of Vit. A and 5 units/kg of Vit. B. while Food Q contains 4 units/kg of Vit. A and 2 units/kg of Vit. B. Determine the minimum cost of the mixture.
ABC is a small manufacturer of two types of popular all-terrain snow skis, the J and the D models. The manufacturing process consists of two principal departments: fabrication and finishing. The fabrication department has 12 skilled workers, each of whom works 7 hours per day. The finishing department has 3 workers, who also work a 7-hour shift. Each pair of J skis require 3.5 labor-hours in the fabricating department and 1 labor-hour in finishing. The D model requires 4 labor-hours in fabricating and 1.5 labor-hours in finishing. The company operates 5 days a week. ABC makes a net profit of $50 on the J model and $65 on the D model. In anticipation of the next ski-sale season, ABC must plan its production of these two models. Because of the popularity of its products and limited production capacity, its products are in high demand, and ABC can sell all it can produce each season. The company anticipates selling at least twice as many D as J models. Determine how many of each model…
The standard form of the following linear programming model is given. Find the values of variables at the point of intersection of constraint 1 and the vertical axis (y). (Round your answers to 3 decimal places.) Maximize P = 30x + 15y + 0s1 + 0s2 subject to 6x + 12y + s1 = 19 13x + 12y + s2 = 35 and x, y, s1, s2≥ 0.
Given this linear programming model, solve the model and then answer the questions that follow.Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc.Subject toMachine 5x1 + 4x2 + 3x3 ≤ 160 minutes Labor 4x1 + 10x2 + 4x3 ≤ 288 hoursMaterials 2x1 + 2x2 + 4x3 ≤ 200 poundsProduct 2 x2 ≤ 16 units x1, x2, x3 ≥ 0 a. Are any constraints binding? If so, which one(s)?
Consider the following LP problem with two constraints: 18X + 8Y >= 144and 9X + 4Y= 36. The objective function is Min 14X + 30Y . What combination of X and Y will yield the optimum solution for this problem? a. infeasible problem b. unbounded problem c. 0 , 9 d. 4 , 0 e. 2 , 4.5
Each batch has the following recipe requirements: a. At least 500 pounds of chicken b. At least 200 pounds of beef The ratio of chicken to beef must be at least 2 to 1. The company wants to know the optimal mixture of ingredients that will minimize cost. Formulate a linear programming model for this problem.
Solve the following linear programming problem using simplex method. A printing company makes three grades of wall posters. The better-quality posters sell for Rs. 2.50, intermediate quality for Rs.2.00 and the poorer quality poster for Rs. 1.50. Paper costs Rs. 0.75 for each of the better-quality posters and Rs.0.50 and Rs. 0.25 for each intimidates and poorer quality poster respectively. Because of poor quality paper, the less expensive posters require two minutes of printing time while the other two require 1 minute of printing time only. The department is allocated Rs.150 per day for paper. There are 480 minutes of printing time available daily and each minute that is used to estimate to cost the company Rs. 0.25. In addition, the department incurs a fixed daily cost of Rs. 125, which are not affected by the quantity and quality of papers produced. You are asked to suggest as to how much each type of posters is to produce in order to maximize daily profit?
Solve the following Linear programming problem using the simplex method:Maximize Z = 10X1 + 15X2 + 20X3subject to:2X1 + 4X2 + 6X3 ≤ 243X1 + 9X2 + 6X3 ≤ 30X1, X2 and X3 ≥ 0(b) Suppose X1, X2, X3 in (a) refer to number of red, blue, and green balloons respectivelywhich are produced by a company per day. And Z is the total profit obtained afterselling these balloons. Interpret your answer obtained in (a) above(c) Write the dual of the following linear programming problem:Minimize Z = 2X1 − 3X2 + 4X3subject to:3X1 + 4X2 + 5X3 ≥ 96X1 + X2 + 3X3 ≥ 47X1 − 2X2 − X3 ≤ 105x1 − 2X2 + X3 ≥ 34X1 + 6X2 − 2X3 ≥ 3X1, X2 and X3 ≥ 0
Irwin Textile Mills produces two types of cotton clothdenim and corduroy. Corduroy is a heavier grade of cotton cloth and, as such, requires 7.5pounds of raw cotton per yard, whereas denim requires 5 pounds of raw cotton per yard. A yard of corduroy requires 3.2 hours of processing time;a yard of denim requires 3.0 hours. Although the demand for denim is practically unlimited, the maximum demand for corduroy is 510 yards permonth. The manufacturer has 6,500 pounds of cotton and 3,000 hours of processing time available each month. The manufacturer makes a profitof $2.25 per yard of denim and $3.10 per yard of corduroy. The manufacturer wants to know how many yards of each type of cloth to produce tomaximize profit What would be the effect on the optimal solution if Irwin Mills could obtain only 6,000 pounds of cotton per month?