Operations Management: Sustainability and Supply Chain Management (12th Edition)
12th Edition
ISBN: 9780134130422
Author: Jay Heizer, Barry Render, Chuck Munson
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter B, Problem 3P
Summary Introduction
To solve: The following linear programming problem graphically.
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, minimize cost, or to determine the optimal product mix. The outcome will take the constraints present in achieving the solution into consideration.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Solve the linear programming problem. (If there is no solution, enter NO SOLUTION.)
Minimize
z = x + y
Subject to
4x + y ≥ 50
x + 4y ≥ 50
x ≤ 23
y ≤ 23
Minimum value is z = at(x, y) = ( , )
For the following linear programming problem, determine the optimal solution using the graphical solution method.
Max
−X + 2Y
s.t.
6X − 2Y
≤
3
−2X + 3Y
≤
8
X + Y
≤
3
X, Y ≥ 0
(X, Y) =
Please solve the following problem as a linear program.
My diet requires that all the food I eat come from one of the four “basic food groups” (chocolate cake, ice cream, soda, and cheesecake). At present, the following four foods are available for consumption: brownies, chocolate ice cream, cola, and pineapple cheesecake.Each brownie costs 50¢, each scoop of chocolate ice cream costs 20¢, each bottle of cola costs 30¢, and each piece of pineapple cheesecake costs 80¢. Each day, I must ingest at least 500 calories, 6 oz of chocolate, 10 oz of sugar, and 8 oz of fat. The nutritional content per unit of each food is shown in the following table. Formulate a linear programming model that can be used to satisfy my daily nutritional requirements at minimum cost.
Chapter B Solutions
Operations Management: Sustainability and Supply Chain Management (12th Edition)
Ch. B - Prob. 1DQCh. B - Prob. 2DQCh. B - Prob. 3DQCh. B - Prob. 4DQCh. B - Prob. 5DQCh. B - Prob. 6DQCh. B - Prob. 7DQCh. B - Prob. 8DQCh. B - Prob. 9DQCh. B - Prob. 10DQ
Ch. B - Prob. 11DQCh. B - Where a constraint crosses the vertical or...Ch. B - Prob. 13DQCh. B - The LP relationships that follow were formulated...Ch. B - Prob. 2PCh. B - Prob. 3PCh. B - B.4. Consider the following linear programming...Ch. B - Prob. 5PCh. B - Prob. 6PCh. B - Green Vehicle Inc. manufactures electric cars and...Ch. B - Prob. 8PCh. B - Prob. 9PCh. B - Prob. 10PCh. B - Prob. 11PCh. B - Prob. 12PCh. B - Prob. 13PCh. B - Prob. 14PCh. B - Prob. 22PCh. B - A fertilizer manufacturer has to fulfill supply...Ch. B - Prob. 25PCh. B - Prob. 26PCh. B - Prob. 27PCh. B - Prob. 28PCh. B - Prob. 29PCh. B - Prob. 30PCh. B - How many corner points are there in the feasible...Ch. B - Prob. 34PCh. B - Prob. 35PCh. B - Prob. 36PCh. B - Prob. 37PCh. B - Prob. 38PCh. B - Bowman Builders manufactures steel storage sheds...Ch. B - Prob. 40PCh. B - Prob. 41PCh. B - Quain Lawn and Garden, Inc Bill and Jeanne Quain...Ch. B - Quain Lawn and Garden, Inc Bill and Jeanne Quain...Ch. B - Prob. 1.1VCCh. B - Prob. 1.2VCCh. B - Prob. 1.3VCCh. B - Prob. 1.4VC
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.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.)arrow_forwardA company manufactures two products Q and W on three machines A, B and C. Q requires 1 hrs on machine A, 1 hr on machine B and C and yields a revenue of USD 3. Product W requires 2 hrs on machine A and 1 hr on machine B and C and yields revenue of USD 5. In the comming period the available time of three machines A, B and C are 2000 hrs, 1500 hrs and 600 hrs respectively. Find the optimal product mix.arrow_forwardConsider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0arrow_forward
- Find the indicated maximum or minimum value of the objective function in the linear programming problem. Minimize g = 10x + 6y subject to the following. x + 2y ≥ 10 2x + y ≥ 11 x + y ≥ 9 x ≥ 0, y ≥ 0arrow_forwardXYZ Corporation operates two plants, each of which has a capacity of 140 units per day. Each day, XYZ must ship their product to each of four customers. Customers A, B, and C each have a demand of 11 units per day while customer D has a demand of 247 units per day. The cost of shipping one unit of each product from each of the two plants to each of the customers is shown in the table below. Customer A Customer B Customer C Customer D Plant 1 12 18 21 10 Plant 2 16 14 18 20 How many units should XYZ ship from each plant to each customer? Customer A Customer B Customer C Customer D Plant 1 Plant 2 What is the least XYZ will spend on shipping each day?arrow_forwardA 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 ≥ 0arrow_forward
- Describe the type of problem that would lend itself to solution using linear programming.arrow_forwardConsider the following constraints from a two-variable Linear Program. (1) X ≥ 0 (2) Y ≥ 0 (3) 5X + 4Y ≤ 50 (4) 5X - 2Y ≤ 20 If constraints (3) and (4) are binding, what is the optimal solution (X, Y)? Answer choices (6, 5) (9, 5) (0, 20) (20, 0)arrow_forwardXYZ Corporation operates two plants, each of which has a capacity of 100 units per day. Each day, XYZ must ship their product to each of four customers. Customers A, B, and C each have a demand of 20 units per day while customer D has a demand of 140 units per day. The cost of shipping one unit of each product from each of the two plants to each of the customers is shown in the table below. Customer A Customer B Customer C Customer D Plant 1 24 21 19 18 Plant 2 18 16 19 10 How many units should XYZ ship from each plant to each customer? (Leave no cells blank—be certain to enter "0" wherever required. Round your answer to the nearest whole number.) What is the least XYZ will spend on shipping each day? (Round your answers to 2 decimal places.)arrow_forward
- A plant has sufficient capacity to manufacture any combination of four different products (A, B, C, D).For each product, time is required to be invested in four different machines, which is expressed in hours per kilogram of product, as shown in the following table as shown in the following table: (image) Each machine has an availability of 60 hours per week. Products A, B, C and D can be sold at $9, $7, $6 and $5per kilo, respectively. Variable labor costs are $2 per hour for machines 1 and 2, and $3 per hour for machines 3 and 4. The material costs for each kilogram of product A are $4. The material costs for each kilogram of products B, C, D and D are $4 each kilogram of products B, C and D are $1. What needs to be done:Formulate a profit-maximizing PL model given the maximum demand per product shown in the table (there are 16 variables). Note: it is not necessary to solve the exercise, simply state the exercisearrow_forwardSolve using the duality linear programming method of the following problem:Object Function: F = X1+X2+4X3Subjected to:X1+2X2+3X3 ≥ 1152X1+X2+8X3 ≥ 200X1+X3 ≥ 50X1,X2, X3 ≥ 0 Note: Please make sure to use the duality linear programming method.arrow_forwardWhich problem can be solved as a minimum cutset problem?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,