Chapter 6: Problem 3
Find the graphical solution of each inequality. $$x-y \leq 0$$
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 6: Problem 3
Find the graphical solution of each inequality. $$x-y \leq 0$$
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Consider the linear programming problem $$ \begin{aligned} \text { Minimize } & C=-2 x+5 y \\ \text { subject to } & x+y \leq 3 \\ & 2 x+y \leq 4 \\ & 5 x+8 y \geq 40 \\ & x \geq 0, y \geq 0 \end{aligned} $$ a. Sketch the feasible set. b. Find the solution(s) of the linear programming problem, if it exists.
Acrosonic manufactures a model-G loudspeaker system in plants I and II. The output at plant \(I\) is at most \(800 /\) month, and the output at plant II is at most \(600 /\) month. Model-G loudspeaker systems are also shipped to the three warehouses \(-\mathrm{A}, \mathrm{B}\), and \(\mathrm{C}\) -whose minimum monthly requirements are 500,400 , and 400 systems, respectively. Shipping costs from plant I to warehouse A. warehouse \(\mathrm{B}\), and warehouse \(\mathrm{C}\) are $$\$ 16$$, $$\$ 20$$, and $$\$ 22$$ per loudspeaker system, respectively, and shipping costs from plant II to each of these warehouses are $$\$ 18$$, $$\$ 16$$, and $$\$ 14$$, respectively. What shipping schedule will enable Acrosonic to meet the requirements of the warehouses while keeping its shipping costs to a minimum? What is the minimum cost?
Solve each linear programming problem by the simplex method. $$ \begin{array}{ll} \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} $$
Determine whether the statement is true or false. If it is true, explain why it is true. If it is false, give an example to show why it is false. If \(A \subseteq B\), then \(n(B)=n(A)+n\left(A^{c} \cap B\right)\).
Solve each linear programming problem by the method of corners. $$ \begin{array}{rr} \text { Minimize } & C=2 x+5 y \\ \text { subject to } & 4 x+y \geq 40 \\ & 2 x+y \geq 30 \\ & x+3 y \geq 30 \\ & x \geq 0, y \geq 0 \end{array} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.