Purchasing Enormous State University's Business School is buying computers. The school has two models to choose from: the Pomegranate and the iZac. Each Pomegranate comes with 900 GB of memory and 90 TB of disk space, and each iZac has 1000 GB ofmemory and 60 TB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 675,000 GB of memory and at least 49,500 TB of disk space. Draw the feasible region that shows the number of each kind ofcomputer it can buy. (Place the Pomegranate on the x-axis and the iZac on the y-axis.)y2000- 2000O(x, y) =(x, y) =-([-1000(x, y) =FRORE-1000+-2000Solution Set1800X2000-2000-1000y2000FRONT-1000-2000Solution Set1800X2000yFind the corner points of the region. (Order your answers from smallest to largest x, then from smallest to largest y. If an answer does not exist, enter DNE.)= ([20001Q0QSolution SetN- 2000 - 100018002000- 2000 - 1000-1000Solution Set-2000y20001908-1000-20001800X2000Ⓡ

A school is buying two models of computers: Pomegranate model: Memory- 900 GB Disk space -…

Answered: Purchasing Enormous State University's…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

A clothing manufacturer makes trousers,skirts and blouses.Each trouser requires 20 minutes of cutting time,60 minutes of sewing time and 5 minutes of packaging time.Each skirt requires 15 minutes of cutting time,30 minutes of sewing time and 12 minutes of packaging time.Each blouse requires 10 minutes of cutting time, 24 minutes of sewing time and 6 minutes of packaging time. The amount of time available for cutting,sewing and packaging is 115 hours, 280 hours and 65 hours respectively. Using either the Inverse Method or the Cramers Rule, determine how many of each type of clothing should be made to use all available labour hours?
The Enormous State University History Department offers three courses—Ancient, Medieval, and Modern History—and the chairperson is trying to decide how many sections of each to offer this semester. The department is allowed to offer 45 sections total, there are 5,000 students who would like to take a course, and there are 60 professors to teach them. Sections of Ancient History have 100 students each, sections of Medieval History hold 50 students each, and sections of Modern History have 200 students each. Modern History sections are taught by a team of two professors, while Ancient and Medieval History need only one professor per section. How many sections of each course should the chair schedule in order to offer all the sections that they are allowed, accommodate all of the students, and give one teaching assignment to each professor? HINT [See Example 2.] (Assume each section has the maximum number of students allowed.)
The Enormous State University History Department offers three courses—Ancient, Medieval, and Modern History—and the chairperson is trying to decide how many sections of each to offer this semester. The department is allowed to offer 45 sections total, there are 4,900 students who would like to take a course, and there are 60 professors to teach them. Sections of Ancient History have 100 students each, sections of Medieval History hold 50 students each, and sections of Modern History have 200 students each. Modern History sections are taught by a team of two professors, while Ancient and Medieval History need only one professor per section. How many sections of each course should the chair schedule in order to offer all the sections that they are allowed, accommodate all of the students, and give one teaching assignment to each professor? (Assume each section has the maximum number of students allowed.) Ancient History ______sections Medieval History____ sections Modern History___…
A famine relief effort is being mounted and there are three types of food bundles that can be flown out during each delivery. Bundle 1 has 4 kg. of flour, 4 kg. of sugar and 12 litres of water. Bundle 2 has 12 kg. of flour, 4 kg. of sugar and 4 litres of water and Bundle 3 has 8 kg. of flour, 8 kg. of sugar and 8 litres of water. The relief agency has 5200 kg. of flour, 3792 kg. of sugar and 6000 litres of water for each shipment. Bundle 1 can provide for 10 people between deliveries, Bundle 2 for 8 people and Bundle 3 for 11 people. How many bundles of each type should the relief agency send on each flight in order to maximize the number of people being fed. Do this problem by setting up a linear programming problem and determining the vertices of the feasibility set. Enter the number of bundles of types 1, 2, and 3 (in that order) into the answer box below, separated with commas.
The Cheery Cherry Chair Company makes three types of chairs, the Montegue, the Capulet, and the Verona. Each chair requires assembly, finishing, and a certain amount of wood to make. The assembly area can be used for at most 10 hours per day. To keep him busy, the finishing person needs to work at least 6 hours per day. Producing a Montegue requires 1 hour of assembly, 2 hour of finishing, and 9 board feet of wood. Producing a Capulet requires 1 hour of assembly, 1 hour of finishing, and 9 board feet of wood. Finally, producing a Verona requires 2 hour of assembly, 1 hour of finishing, and 3 board feet of wood. If the company wants to minimize the amount of cherry wood used, how many should they make of each model? (It is possible to complete a fractional part a chair in a given day; in the long run you end up with completed chairs.) Number of Montegues = Number of Capulets = Number of Veronas = How many board feet of cherry wood would be used each day?

Recommended textbooks for you

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Mathematics For Machine Technology

Advanced Math

ISBN:

9781337798310

Author:

Peterson, John.

Publisher:

Cengage Learning,

Basic Technical Mathematics

Advanced Math

ISBN:

9780134437705

Author:

Washington

Publisher:

PEARSON

Topology

Advanced Math

ISBN:

9780134689517

Author:

Munkres, James R.

Publisher:

Pearson,

SEE MORE TEXTBOOKS