Chapter 3: Problem 28
Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded. $$ \begin{aligned} x+y & \geq 20 \\ x+2 y & \geq 40 \\ x \geq 0, y & \geq 0 \end{aligned} $$
/*! 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 3: Problem 28
Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded. $$ \begin{aligned} x+y & \geq 20 \\ x+2 y & \geq 40 \\ x \geq 0, y & \geq 0 \end{aligned} $$
All the tools & learning materials you need for study success - in one app.
Get started for free
You are given a linear programming problem. a. Use the method of corners to solve the problem. b. Find the range of values that the coefficient of \(x\) can assume without changing the optimal solution. c. Find the range of values that resource 1 (requirement 1) can assume. d. Find the shadow price for resource 1 (requirement 1). e. Identify the binding and nonbinding constraints. $$ \begin{array}{cc} \text { Minimize } & C=3 x+4 y \\ \text { subject to } & x+3 y \geq 8 \\ & x+y \geq 4 \\ & x \geq 0, y \geq 0 \end{array} $$
Solve each linear programming problem by the method of corners. $$ \begin{array}{rr} \text { Minimize } & C=3 x+4 y \\ \text { subject to } & x+y \geq 3 \\ & x+2 y \geq 4 \\ & x \geq 0, y \geq 0 \end{array} $$
Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded. $$ \begin{aligned} x-y & \geq-6 \\ x-2 y & \leq-2 \\ x+2 y & \geq 6 \\ x-2 y & \geq-14 \\ x \geq 0, y & \geq 0 \end{aligned} $$
Solve each linear programming problem by the method of corners. $$ \begin{array}{ll} \text { Maximize } & P=4 x+2 y \\ \text { subject to } & x+y \leq 8 \\ & 2 x+y \leq 10 \\ & x \geq 0, y \geq 0 \end{array} $$
Solve each linear programming problem by the method of corners. $$ \begin{aligned} \text { Maximize } & P=2 x+5 y \\ \text { subject to } & 2 x+y \leq 16 \\ & 2 x+3 y \leq 24 \\ y & \leq 6 \\ & x \geq 0, y & \geq 0 \end{aligned} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.