Chapter 3: Problem 26
Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded. $$ \begin{array}{l} 4 x-3 y \leq 12 \\ 5 x+2 y \leq 10 \\ x \geq 0, y \geq 0 \end{array} $$
/*! 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 26
Determine graphically the solution set for each system of inequalities and indicate whether the solution set is bounded or unbounded. $$ \begin{array}{l} 4 x-3 y \leq 12 \\ 5 x+2 y \leq 10 \\ x \geq 0, y \geq 0 \end{array} $$
All the tools & learning materials you need for study success - in one app.
Get started for free
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} $$
MANUFACTURING-PRODUCTION SCHEDULING Custom Office Furniture Company is introducing a new line of executive desks made from a specially selected grade of walnut. Initially, three different models \(-\mathrm{A}, \mathrm{B}\), and \(\mathrm{C}\) -are to be marketed. Each model A desk requires \(1 \frac{1}{4} \mathrm{hr}\) for fabrication, \(1 \mathrm{hr}\) for assembly, and \(1 \mathrm{hr}\) for finishing; each model \(\mathrm{B}\) desk requires \(1 \frac{1}{2} \mathrm{hr}\) for fabrication, \(1 \mathrm{hr}\) for assembly, and \(1 \mathrm{hr}\) for finishing; each model C desk requires \(1 \frac{1}{2} \mathrm{hr}, \frac{3}{4} \mathrm{hr}\), and \(\frac{1}{2} \mathrm{hr}\) for fabrication, assembly, and finishing, respectively. The profit on each model A desk is \(\$ 26\), the profit on each model B desk is \(\$ 28\), and the profit on each model \(\mathrm{C}\) desk is \(\$ 24 .\) The total time available in the fabrication department, the assembly department, and the finishing department in the first month of production is \(310 \mathrm{hr}, 205 \mathrm{hr}\), and \(190 \mathrm{hr}\), respectively. To maximize Custom's profit, how many desks of each model should be made in the month?
Patricia has at most \(\$ 30,000\) to invest in securities in the form of corporate stocks. She has narrowed her choices to two groups of stocks: growth stocks that she assumes will yield a \(15 \%\) return (dividends and capital appreciation) within a year and speculative stocks that she assumes will yield a \(25 \%\) return (mainly in capital appreciation) within a year. Determine how much she should invest in each group of stocks in order to maximize the return on her investments within a year if she has decided to invest at least 3 times as much in growth stocks as in speculative stocks.
MaNUFACTURING-PRODUCTION SCHEDULING A company manufactures products \(\mathrm{A}, \mathrm{B}\), and \(\mathrm{C}\). Each product is processed in three departments: I, II, and III. The total available labor-hours per week for departments I, II, and III are 900,1080, and 840, respectively. The time requirements (in hours per unit) and profit per unit for each product are as follows: $$ \begin{array}{lccc} \hline & \begin{array}{c} \text { Product } \\ \mathbf{A} \end{array} & \begin{array}{c} \text { Product } \\ \mathbf{B} \end{array} & \begin{array}{c} \text { Product } \\ \mathbf{C} \end{array} \\ \hline \text { Dept. I } & 2 & 1 & 2 \\ \hline \text { Dept. II } & 3 & 1 & 2 \\ \hline \text { Dept. III } & 2 & 2 & 1 \\ \hline \text { Profit } & \$ 18 & \$ 12 & \$ 15 \\ \hline \end{array} $$ How many units of each product should the company produce in order to maximize its profit?
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{aligned} \text { Maximize } & P=4 x+3 y \\ \text { subject to } & 5 x+3 y \leq 30 \\ 2 x+3 y & \leq 21 \\ x & \leq 4 \\ & x \geq 0, y \geq 0 \end{aligned} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.