
Finite Mathematics (11th Edition)
11th Edition
ISBN: 9780321979438
Author: Margaret L. Lial, Raymond N. Greenwell, Nathan P. Ritchey
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem 30RE
To determine
Solve the problem using simplex method
Expert Solution & Answer

Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The Martin-Beck Company operates a plant in St. Louis with an annual capacity of 30,000 units. Product is shipped to regional distribution centers located in Boston, Atlanta, and Houston. Because of an anticipated increase in demand, Martin-Beck plans to increase capacity by constructing a new plant in one or more of the following cities: Detroit, Toledo, Denver, or Kansas. The following is a linear program used to
determine which cities Martin-Beck should construct a plant in.
Let
y₁ = 1 if a plant is constructed in Detroit; 0 if not
y₂ = 1 if a plant is constructed in Toledo; 0 if not
y₂ = 1 if a plant is constructed in Denver; 0 if not
y = 1 if a plant is constructed in Kansas City; 0 if not.
The variables representing the amount shipped from each plant site to each distribution center are defined just as for a transportation problem.
*,, = the units shipped in thousands from plant i to distribution center j
i = 1 (Detroit), 2 (Toledo), 3 (Denver), 4 (Kansas City), 5 (St.Louis) and…
Consider the following mixed-integer linear program.
Max
3x1
+
4x2
s.t.
4x1
+
7x2
≤
28
8x1
+
5x2
≤
40
x1, x2 ≥ and x1 integer
(a)
Graph the constraints for this problem. Indicate on your graph all feasible mixed-integer solutions.
On the coordinate plane the horizontal axis is labeled x1 and the vertical axis is labeled x2. A region bounded by a series of connected line segments, and several horizontal lines are on the graph.
The series of line segments connect the approximate points (0, 4), (3.889, 1.778), and (5, 0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
At each integer value between 0 and 4 on the vertical axis, a horizontal line extends out from the vertical axis to the series of connect line segments.
On the coordinate plane the horizontal axis is labeled x1 and the vertical axis is labeled x2. A region bounded by a series of connected line segments, and several…
Consider the nonlinear optimization model stated below.
Min
s.t.
2x²-18x + 2XY + y² - 14Y + 53
x + 4Y ≤ 8
(a) Find the minimum solution to this problem.
|at (X, Y) =
(b) If the right-hand side of the constraint is increased from 8 to 9, how much do you expect the objective function to change?
Based on the dual value on the constraint X + 4Y ≤ 8, we expect the optimal objective function value to decrease by
(c) Resolve the problem with a new right-hand side of the constraint of 9. How does the actual change compare with your estimate?
If we resolve the problem with a new right-hand-side of 9 the new optimal objective function value is|
, so the actual change is a decrease of
rather than what we expected in part (b).
Chapter 4 Solutions
Finite Mathematics (11th Edition)
Ch. 4.1 - Convert each inequality into an equation by adding...Ch. 4.1 - Prob. 2ECh. 4.1 - Convert each inequality into an equation by adding...Ch. 4.1 - Prob. 4ECh. 4.1 - For Exercises 5-8. (a) determine the number of...Ch. 4.1 - Prob. 6ECh. 4.1 - For Exercises 5-8, (a) determine the number of...Ch. 4.1 - For Exercises 5-8, (a) determine the number of...Ch. 4.1 -
Introduce slack variables as necessary, then...Ch. 4.1 - Introduce slack variables as necessary, then write...
Ch. 4.1 - Introduce slack variables as necessary, then write...Ch. 4.1 - Introduce slack variables as necessary, then write...Ch. 4.1 - Prob. 13ECh. 4.1 - Introduce slack variables as necessary, then write...Ch. 4.1 -
Write the solutions that can be read from each...Ch. 4.1 - Write the solutions that can be read from each...Ch. 4.1 - Prob. 17ECh. 4.1 - Prob. 18ECh. 4.1 - Pivot once as indicated in each simplex tableau....Ch. 4.1 - Pivot once as indicated in each simplex tableau....Ch. 4.1 - Prob. 21ECh. 4.1 - Prob. 22ECh. 4.1 - Prob. 23ECh. 4.1 - Prob. 24ECh. 4.1 - Explain the purpose of a slack variable.Ch. 4.1 - Prob. 26ECh. 4.1 - Prob. 27ECh. 4.1 - Set up Exercises 2731 for solution by the simplex...Ch. 4.1 - Set up Exercises 2731 for solution by the simplex...Ch. 4.1 - Set up Exercises 2731 for solution by the simplex...Ch. 4.1 - Set up Exercises 27for solution by the simplex...Ch. 4.2 -
In Exercises 1-6, the initial tableau of a linear...Ch. 4.2 -
In Exercises 1-6, the initial tableau of a linear...Ch. 4.2 - In Exercises 1-6, the initial tableau of a linear...Ch. 4.2 - In Exercises 1-6, the initial tableau of a linear...Ch. 4.2 -
In Exercises 1-6, the initial tableau of a linear...Ch. 4.2 - In Exercises 1- the initial tableau of a linear...Ch. 4.2 -
Use the simplex method to solve each linear...Ch. 4.2 - Prob. 8ECh. 4.2 - Prob. 9ECh. 4.2 - Use the simplex method to solve each linear...Ch. 4.2 - Prob. 11ECh. 4.2 - Prob. 12ECh. 4.2 -
Use the simplex method to solve each linear...Ch. 4.2 - Prob. 14ECh. 4.2 - Use the simplex method to solve each linear...Ch. 4.2 - Prob. 16ECh. 4.2 - Prob. 17ECh. 4.2 - Prob. 18ECh. 4.2 - The simplex algorithm still works if an indicator...Ch. 4.2 -
20. What goes wrong if a quotient other than...Ch. 4.2 - Prob. 21ECh. 4.2 - Prob. 22ECh. 4.2 - Prob. 23ECh. 4.2 -
Set up and solve Exercises 23–29 by the...Ch. 4.2 -
Set up and solve Exercises 23–29 by the simplex...Ch. 4.2 - Set up and solve Exercises 23–29 by the simplex...Ch. 4.2 - Set up and solve Exercises 2329 by the simplex...Ch. 4.2 - Set up and solve Exercises 2329 by the simplex...Ch. 4.2 - Prob. 29ECh. 4.2 - Profit A manufacturer makes two products, toy...Ch. 4.2 - Exercises and 32 come from past CPA examinations....Ch. 4.2 - Prob. 32ECh. 4.2 - Prob. 33ECh. 4.2 - Prob. 34ECh. 4.2 - Prob. 35ECh. 4.2 - Prob. 36ECh. 4.2 -
37. Resource Management The average weights of...Ch. 4.2 - Prob. 38ECh. 4.2 - Prob. 39ECh. 4.2 - Prob. 40ECh. 4.3 -
Find the transpose of each matrix.
1.
Ch. 4.3 - Prob. 2ECh. 4.3 - Prob. 3ECh. 4.3 - Find the transpose of each matrix. [...Ch. 4.3 -
State the dual problem for each linear...Ch. 4.3 - Prob. 6ECh. 4.3 -
State the dual problem for each linear...Ch. 4.3 - Prob. 8ECh. 4.3 - Prob. 9ECh. 4.3 -
Use the simples method to solve.
10. Find y1 ≥...Ch. 4.3 -
Use the simplex method to solve.
11. Find y1 ≥...Ch. 4.3 -
Use the simplex method to solve.
12. Minimize w...Ch. 4.3 - Prob. 13ECh. 4.3 -
Use the simplex method to solve.
14. Minimize w =...Ch. 4.3 - Prob. 15ECh. 4.3 - Prob. 16ECh. 4.3 - Prob. 17ECh. 4.3 - Prob. 18ECh. 4.3 -
19. Production Costs A brewery produces regular...Ch. 4.3 - Supply Costs The chemistry department at a local...Ch. 4.3 - Prob. 21ECh. 4.3 - Prob. 22ECh. 4.3 - Prob. 23ECh. 4.3 -
24. Animal Food An animal food must provide at...Ch. 4.3 - Feed Costs Refer to Example 5 in this section on...Ch. 4.3 - Prob. 26ECh. 4.3 - Calorie Expenditure Maureen Rachford wants to...Ch. 4.3 -
28. Health Care Greg Conover takes vitamin...Ch. 4.3 - 29. Blending Nutrients A biologist must make a...Ch. 4.4 - Prob. 1ECh. 4.4 - Prob. 2ECh. 4.4 - Prob. 3ECh. 4.4 - Prob. 4ECh. 4.4 -
Convert each problem into a maximization...Ch. 4.4 - Prob. 6ECh. 4.4 - Prob. 7ECh. 4.4 - Prob. 8ECh. 4.4 - Prob. 9ECh. 4.4 - Prob. 10ECh. 4.4 - Use the simplex method to solve. Find x1 0, x2 0...Ch. 4.4 - Prob. 12ECh. 4.4 - Prob. 13ECh. 4.4 - Prob. 14ECh. 4.4 - Prob. 15ECh. 4.4 - Prob. 16ECh. 4.4 - Prob. 17ECh. 4.4 - Prob. 18ECh. 4.4 - Solve using artificial variables. Maximize w =...Ch. 4.4 - Prob. 20ECh. 4.4 - Prob. 21ECh. 4.4 - Prob. 22ECh. 4.4 - Prob. 23ECh. 4.4 - Prob. 24ECh. 4.4 - Prob. 25ECh. 4.4 - Prob. 26ECh. 4.4 - Prob. 27ECh. 4.4 - Blending Seed Topgrade Turf lawn seed mixture...Ch. 4.4 - Prob. 29ECh. 4.4 - Prob. 30ECh. 4.4 - 31. Blending Chemicals Natural Brand plant food is...Ch. 4.4 - Prob. 32ECh. 4.4 -
33. Calorie Expenditure Joe Vetere’s exercise...Ch. 4 - Suppose you plan to build a raised flower bed...Ch. 4 - For the list of standard paper roll widths given...Ch. 4 - Prob. 3EACh. 4 - For the computer solution of the cutting problem,...Ch. 4 - Prob. 5EACh. 4 - Prob. 6EACh. 4 - Suppose that of the original 33 cutting patterns,...Ch. 4 - Prob. 8EACh. 4 - Compare your two answers from Exercise 8 with each...Ch. 4 - Prob. 10EACh. 4 -
Determine whether each of the following...Ch. 4 - Prob. 2RECh. 4 -
Determine whether each of the following...Ch. 4 - Prob. 4RECh. 4 -
Determine whether each of the following...Ch. 4 - Prob. 6RECh. 4 - Prob. 7RECh. 4 - Prob. 8RECh. 4 - Prob. 9RECh. 4 - Determine whether each of the following statements...Ch. 4 - Determine whether each of the following statements...Ch. 4 - Prob. 12RECh. 4 - Prob. 13RECh. 4 - Prob. 14RECh. 4 - Prob. 15RECh. 4 -
Determine whether each of the following...Ch. 4 -
For each problem. (a) add slack variables or...Ch. 4 - For each problem, (a) add slack variables or...Ch. 4 -
For each problem, (a) add slack variables or...Ch. 4 - For each problem, (a) add slack variables or...Ch. 4 -
Use the simplex method to solve each maximization...Ch. 4 - Use the simplex method to solve each maximization...Ch. 4 -
Use the simplex method to solve each maximization...Ch. 4 - Use the simplex method to solve each maximization...Ch. 4 - Convert each problem into a maximization problem...Ch. 4 - Convert each problem into a maximization problem...Ch. 4 - Prob. 27RECh. 4 - Prob. 28RECh. 4 - Prob. 29RECh. 4 - Prob. 30RECh. 4 - Prob. 31RECh. 4 - Prob. 32RECh. 4 - Prob. 33RECh. 4 - Prob. 34RECh. 4 - Prob. 35RECh. 4 -
36. In Chapter 2 we wrote a system of It near...Ch. 4 - Prob. 37RECh. 4 - Prob. 38RECh. 4 - Prob. 39RECh. 4 - Prob. 40RECh. 4 - Prob. 41RECh. 4 - Prob. 42RECh. 4 - Prob. 43RECh. 4 - Prob. 44RECh. 4 - Prob. 45RECh. 4 - Prob. 46RECh. 4 - Prob. 47RE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Statement:If 2 | a and 3| a, then 6 a. So find three integers, and at least one integer should be negative. For each of your examples, determine if the statement is true or false.arrow_forwardStatement: If 4 | a and 6 | a, then 24 | a. So find three integers, and at least one integer should be negative. For each of your examples, determine if the statement is true or false.arrow_forward2) dassify each critical point of the given plane autovers system x'=x-2x²-2xy y' = 4y-Sy³-7xyarrow_forward
- Evaluate the next integralarrow_forward1. For each of the following, find the critical numbers of f, the intervals on which f is increasing or decreasing, and the relative maximum and minimum values of f. (a) f(x) = x² - 2x²+3 (b) f(x) = (x+1)5-5x-2 (c) f(x) = x2 x-9 2. For each of the following, find the intervals on which f is concave upward or downward and the inflection points of f. (a) f(x) = x - 2x²+3 (b) g(x) = x³- x (c) f(x)=x-6x3 + x-8 3. Find the relative maximum and minimum values of the following functions by using the Second Derivative Test. (a) f(x)=1+3x² - 2x3 (b) g(x) = 2x3 + 3x² - 12x-4arrow_forward24.2. Show that, for any constant zo Є C, (a). e* = e²o Σ j=0 (2 - 20); j! |z|arrow_forwardQuestion 10 (5 points) (07.04 MC) Vectors u and v are shown in the graph. -12-11 -10 -9 -8 -7 -6 -5 What is proju? a -6.5i - 4.55j b -5.2i+2.6j с -4.7631 3.334j d -3.81i+1.905j < + 10 6 5 4 3 2 -3 -2 -10 1 -1 -2 -3 u -4 -5 -6 -7arrow_forward25.4. (a). Show that when 0 < || < 4, 1 1 8 zn 4z - z2 4z +Σ 4n+2* (b). Show that, when 0 < |z1|<2, n=() 2 1 8 (z - 1)(z - 3) - 3 2(z - 1) 3 Σ (2-1)" 27+2 n=0 (c). Show that, when 2<|z|< ∞, 1 z4+4z2 -*()*. n=0arrow_forwardFind the Soultion to the following dy differential equation using Fourier in transforms: = , хуо, ухо according to the terms: lim u(x,y) = 0 x18 lim 4x (x,y) = 0 x14 2 u (x, 0) = =\u(o,y) = -y لوarrow_forward. Expand sinh z in Taylor's series at zo = πi, and show that lim sinh: καπί κ - п - - 1.arrow_forwardQ prove or disprove: If Ely/x) = x = c(dipy =BCCo (BVC) ECxly)=y, and E(X2), Ely)arrow_forward24.3. Show that 8 (a). =(+1)(z+1)*, |+1|<1, j=0 8 (b). sin³ z j=0 (-1) 3(1-9) 4 (2j+1)! 22j+1, |<∞,arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_iosRecommended textbooks for you
- Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALElementary AlgebraAlgebraISBN:9780998625713Author:Lynn Marecek, MaryAnne Anthony-SmithPublisher:OpenStax - Rice UniversityAlgebra for College StudentsAlgebraISBN:9781285195780Author:Jerome E. Kaufmann, Karen L. SchwittersPublisher:Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin HarcourtHolt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALElementary AlgebraAlgebraISBN:9780998625713Author:Lynn Marecek, MaryAnne Anthony-SmithPublisher:OpenStax - Rice UniversityAlgebra for College StudentsAlgebraISBN:9781285195780Author:Jerome E. Kaufmann, Karen L. SchwittersPublisher:Cengage Learning
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY
Optimization Problems in Calculus; Author: Professor Dave Explains;https://www.youtube.com/watch?v=q1U6AmIa_uQ;License: Standard YouTube License, CC-BY
Introduction to Optimization; Author: Math with Dr. Claire;https://www.youtube.com/watch?v=YLzgYm2tN8E;License: Standard YouTube License, CC-BY