Suggested languages for you:

Americas

Europe

Problem 12

Use the method of this section to solve each linear programming problem. $$ \begin{aligned} \text { Minimize } & C=x+2 y \\ \text { subject to } & 4 x+7 y \leq 70 \\ & 2 x+y=20 \\ & x \geq 0, y \geq 0 \end{aligned} $$

Expert verified

The solution to the given linear programming problem is to minimize the cost function \(C = x + 2y\), subject to the constraints \(4x + 7y \leq 70\), \(2x + y = 20\), and \(x \geq 0\), \(y \geq 0\). By graphing the constraints and finding the vertices of the feasible region, we find four vertices: \((0, 0)\), \((10, 0)\), \((8, 4)\), and \((0, 10)\). Evaluating the cost function at each vertex, we find that the minimum value of the cost function is \(C_{min} = 0\) at \((x, y) = (0, 0)\).

What do you think about this solution?

We value your feedback to improve our textbook solutions.

- Access over 3 million high quality textbook solutions
- Access our popular flashcard, quiz, mock-exam and notes features
- Access our smart AI features to upgrade your learning

Chapter 4

Steinwelt Piano manufactures uprights and consoles in two plants, plant I and plant II. The output of plant I is at most \(300 /\) month, whereas the output of plant II is at most \(250 /\) month. These pianos are shipped to three warehouses that serve as distribution centers for the company. To fill current and projected orders, warehouse A requires a minimum of 200 pianos/month, warehouse B requires at least 150 pianos/month, and warehouse \(\mathrm{C}\) requires at least 200 pianos/month. The shipping cost of each piano from plant I to warehouse A, warehouse \(\mathrm{B}\), and warehouse \(\mathrm{C}\) is $\$ 60, \$ 60\(, and \)\$ 80$, respectively, and the shipping cost of each piano from plant II to warehouse A, warehouse B, and warehouse \(\mathrm{C}\) is $\$ 80, \$ 70\(, and \)\$ 50$, respectively. Use the method of this section to determine the shipping schedule that will enable Steinwelt to meet the warehouses' requirements while keeping the shipping costs to a minimum.

Chapter 4

Rewrite each linear programming problem as a maximization problem with constraints involving inequalities of the form \(\leq\) a constant (with the exception of the inequalities \(x \geq 0, y \geq 0\), and \(z \geq 0\) ). $$ \begin{array}{ll} \text { Maximize } & P=2 x+y-2 z \\ \text { subject to } & x+2 y+z \geq 10 \\ & 3 x+4 y+2 z \geq 5 \\ & 2 x+5 y+12 z \leq 20 \\ & x \geq 0, y \geq 0, z \geq 0 \end{array} $$

Chapter 4

Solve each linear programming problem by the simplex method. $$ \begin{array}{cc} \text { Maximize } & P=3 x+4 y+5 z \\ \text { subject to } & x+y+z \leq 8 \\ & 3 x+2 y+4 z \leq 24 \\ x & \geq 0, y \geq 0, z \geq 0 \end{array} $$

Chapter 4

Solve each linear programming problem by the simplex method. $$ \begin{array}{lr} \text { Maximize } & P=x+4 y-2 z \\ \text { subject to } & 3 x+y-z \leq 80 \\ & 2 x+y-z \leq 40 \\ & -x+y+z \leq 80 \\ x & \geq 0, y \geq 0, z & \geq 0 \end{array} $$

Chapter 4

Use the method of this section to solve each linear programming problem. $$ \begin{array}{ll} \text { Maximize } & P=5 x+y \\ \text { subject to } & 2 x+y \leq 8 \\ & -x+y \geq 2 \\ & x \geq 0, y \geq 0 \end{array} $$

The first learning app that truly has everything you need to ace your exams in one place.

- Flashcards & Quizzes
- AI Study Assistant
- Smart Note-Taking
- Mock-Exams
- Study Planner