Chapter 11: Problem 712
Graph the system \(\mathrm{x} \geq 4\) and \(2 x \leq 18\)
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 11: Problem 712
Graph the system \(\mathrm{x} \geq 4\) and \(2 x \leq 18\)
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
Find a basic feasible solution to: $$ \begin{aligned} &2 \mathrm{x}_{1}+\mathrm{x}_{2}+2 \mathrm{x}_{3}=4 \\ &3 \mathrm{x}_{1}+3 \mathrm{x}_{2}+\mathrm{x}_{3}=3 \\ &\mathrm{x}_{1} \geq 0, \mathrm{x}_{2} \geq 0, \mathrm{x}_{2} \geq 0 \end{aligned} $$
A businessman needs 5 cabinets, 12 desks, and 18 shelves cleaned out. He has two part time employees Sue and Janet. Sue can clean one cabinet, three desks and three shelves in one day, while Janet can clean one cabinet, two desks and 6 shelves in one day. Sue is paid \(\$ 25\) a day, and Janet is paid \(\$ 22\) a day. In order to minimize the cost how many days should Sue and Janet be employed?
Minimize \(\quad \mathrm{x}_{1}+\mathrm{x}_{2}\) Subject to: \(\begin{aligned} & \mathrm{x}_{1}+2 \mathrm{x}_{2} \leq 4 \\ & \mathrm{x}_{2} \leq 1 \\ & \mathrm{x}_{1}, \mathrm{x}_{2} \geq 0 \end{aligned}\) Find a basic feasible solution to the above problem, starting from a b.f.s with xi and in the basis.
Consider the following minimization problem: $$ \min z=2 x_{1}+x_{2}-x_{3} $$ subject to: $$ \begin{aligned} &\mathrm{x}_{1}+\mathrm{x}_{2}+\mathrm{x}_{3} \leq 3 \\ &\mathrm{x}_{2}+\mathrm{x}_{3} \geq 2 \\ &\mathrm{x}_{1}+\mathrm{x}_{3}=1 \\ &\mathrm{x}_{1}, \mathrm{x}_{2}, \mathrm{x}_{3} \geq 0 \end{aligned} $$ Find an initial basic feasible solution.
Find nonnegative numbers \(\mathrm{x}_{1}, \mathrm{x}_{2}, \mathrm{x}_{3}, \mathrm{x}_{4}\) which maximize $$ 3 \mathrm{x}_{1}+\mathrm{x}_{2}+9 \mathrm{x}_{3}-9 \mathrm{x}_{4} $$ and satisfy the conditions $$ \begin{aligned} &\mathrm{x}_{1}+\mathrm{x}_{2}+\mathrm{x}_{3}-5 \mathrm{x}_{4}=4 \\ &\mathrm{x}_{1}-\mathrm{x}_{2}+3 \mathrm{x}_{3}+\mathrm{x}_{4}=0 \end{aligned} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.