21 Aug Question CSU Dominguez Hills OMG322 Ch. 3
Question 1 1 out of 1 points
A heuristic solution is
Question 2 1 out of 1 points
How many decision variables are there in a transportation problem which has 5 supply points and 4 demand points?
Question 3 1 out of 1 points
Exhibit 3.1
The following questions are based on this problem and accompanying Excel windows.
Jones Furniture Company produces beds and desks for college students. The production process requires carpentry and varnishing. Each bed requires 6 hours of carpentry and 4 hour of varnishing. Each desk requires 4 hours of carpentry and 8 hours of varnishing. There are 36 hours of carpentry time and 40 hours of varnishing time available. Beds generate $30 of profit and desks generate $40 of profit. Demand for desks is limited, so at most 8 will be produced.
Let X1 = Number of Beds to produce
X2 = Number of Desks to produce
The LP model for the problem is
| MAX: | 30 X1 + 40 X2 |
| Subject to: | 6 X1 + 4 X2 £ 36 (carpentry) |
| 4 X1 + 8 X2 £ 40 (varnishing) | |
| X2 £ 8 (demand for desks) | |
| X1, X2 ³ 0 |
| A | B | C | D | E | |
| 1 | Jones Furniture | ||||
| 2 | |||||
| 3 | Beds | Desks | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Carpentry | 6 | 4 | 36 | |
| 9 | Varnishing | 4 | 8 | 40 | |
| 10 | Desk demand | 1 | 8 | ||
Refer to Exhibit 3.1. Which cells should be changing cells in this problem?
Question 4 0 out of 1 points
How many constraints are there in a transportation problem which has 5 supply points and 4 demand points? (ignore the non-negativity constraints)
Question 5 1 out of 1 points
Exhibit 3.1
The following questions are based on this problem and accompanying Excel windows.
ones Furniture Company produces beds and desks for college students. The production process requires carpentry and varnishing. Each bed requires 6 hours of carpentry and 4 hour of varnishing. Each desk requires 4 hours of carpentry and 8 hours of varnishing. There are 36 hours of carpentry time and 40 hours of varnishing time available. Beds generate $30 of profit and desks generate $40 of profit. Demand for desks is limited, so at most 8 will be produced.
Let X1 = Number of Beds to produce
X2 = Number of Desks to produce
The LP model for the problem is
| MAX: | 30 X1 + 40 X2 |
| Subject to: | 6 X1 + 4 X2 £ 36 (carpentry) |
| 4 X1 + 8 X2 £ 40 (varnishing) | |
| X2 £ 8 (demand for desks) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Jones Furniture | ||||
| 2 | |||||
| 3 | Beds | Desks | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Carpentry | 6 | 4 | 36 | |
| 9 | Varnishing | 4 | 8 | 40 | |
| 10 | Desk demand | 1 | 8 | ||
Refer to Exhibit 3.1. Which cells should be the constraint cells in this problem?
Question 6 1 out of 1 points
Exhibit 3.2
The following questions are based on this problem and accompanying Excel windows.The Byte computer company produces two models of computers, Plain and Fancy. It wants to plan how many computers to produce next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but faces only a limited demand. There are also a limited number of wiring, assembly and inspection hours available in each month. The data for this problem is summarized in the following table.
|
Computer Model |
Profit per Model ($) |
Maximum demand for product |
Wiring Hours Required |
Assembly Hours Required |
Inspection Hours Required |
| Plain | 30 | 80 | .4 | .5 | .2 |
| Fancy | 40 | 90 | .5 | .4 | .3 |
| Hours Available | 50 | 50 | 22 | ||
| Let | X1 = Number of Plain computers to produce |
| X2 = Number of Fancy computers to produce | |
| MAX: | 30 X1 + 40 X2 |
| Subject to: | .4 X1 + .5 X2 £ 50 (wiring hours) |
| .5 X1 + .4 X2 £ 50 (assembly hours) | |
| .2 X1 + .2 X2 £ 22 (inspection hours) | |
| X1 £ 80 (Plain computers demand) | |
| X2 £ 90 (Fancy computers demand) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Byte Computer Company | ||||
| 2 | |||||
| 3 | Plain | Fancy | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Wiring | 0.4 | 0.5 | 50 | |
| 9 | Assembly | 0.5 | 0.4 | 50 | |
| 10 | Inspection | 0.2 | 0.3 | 22 | |
| 11 | Plain Demand | 1 | 80 | ||
| 12 | Fancy Demand | 1 | 90 | ||
Refer to Exhibit 3.2. Which cells should be the constraint cells in this problem?
Question 7 1 out of 1 points
Numeric constants should be
Question 8 1 out of 1 points
What is the significance of an absolute cell reference in Excel?
Question 9 1 out of 1 points
An LP problem with a feasible region will have
Question 10 0 out of 1 points
Problems which have only integer solutions are called
Question 11 1 out of 1 points
Exhibit 3.1
The following questions are based on this problem and accompanying Excel windows.Jones Furniture Company produces beds and desks for college students. The production process requires carpentry and varnishing. Each bed requires 6 hours of carpentry and 4 hour of varnishing. Each desk requires 4 hours of carpentry and 8 hours of varnishing. There are 36 hours of carpentry time and 40 hours of varnishing time available. Beds generate $30 of profit and desks generate $40 of profit. Demand for desks is limited, so at most 8 will be produced.
| Let | X1 = Number of Beds to produce |
| X2 = Number of Desks to produce | |
The LP model for the problem is
| MAX: | 30 X1 + 40 X2 |
| Subject to: | 6 X1 + 4 X2 £ 36 (carpentry) |
| 4 X1 + 8 X2 £ 40 (varnishing) | |
| X2 £ 8 (demand for desks) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Jones Furniture | ||||
| 2 | |||||
| 3 | Beds | Desks | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Carpentry | 6 | 4 | 36 | |
| 9 | Varnishing | 4 | 8 | 40 | |
| 10 | Desk demand | 1 | 8 | ||
Refer to Exhibit 3.1. What formula should be entered in cell D8 in the accompanying Excel spreadsheet to compute the amount of carpentry used?
Question 12 1 out of 1 points
Exhibit 3.1
The following questions are based on this problem and accompanying Excel windows.Jones Furniture Company produces beds and desks for college students. The production process requires carpentry and varnishing. Each bed requires 6 hours of carpentry and 4 hour of varnishing. Each desk requires 4 hours of carpentry and 8 hours of varnishing. There are 36 hours of carpentry time and 40 hours of varnishing time available. Beds generate $30 of profit and desks generate $40 of profit. Demand for desks is limited, so at most 8 will be produced.
| Let | X1 = Number of Beds to produce |
| X2 = Number of Desks to produce | |
The LP model for the problem is
| MAX: | 30 X1 + 40 X2 |
| Subject to: | 6 X1 + 4 X2 £ 36 (carpentry) |
| 4 X1 + 8 X2 £ 40 (varnishing) | |
| X2 £ 8 (demand for desks) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Jones Furniture | ||||
| 2 | |||||
| 3 | Beds | Desks | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Carpentry | 6 | 4 | 36 | |
| 9 | Varnishing | 4 | 8 | 40 | |
| 10 | Desk demand | 1 | 8 | ||
Refer to Exhibit 3.1. What formula should be entered in cell E5 in the accompanying Excel spreadsheet to compute total profit?
Question 13 1 out of 1 points
Exhibit 3.1
The following questions are based on this problem and accompanying Excel windows.Jones Furniture Company produces beds and desks for college students. The production process requires carpentry and varnishing. Each bed requires 6 hours of carpentry and 4 hour of varnishing. Each desk requires 4 hours of carpentry and 8 hours of varnishing. There are 36 hours of carpentry time and 40 hours of varnishing time available. Beds generate $30 of profit and desks generate $40 of profit. Demand for desks is limited, so at most 8 will be produced.
| Let | X1 = Number of Beds to produce |
| X2 = Number of Desks to produce | |
The LP model for the problem is
| MAX: | 30 X1 + 40 X2 |
| Subject to: | 6 X1 + 4 X2 £ 36 (carpentry) |
| 4 X1 + 8 X2 £ 40 (varnishing) | |
| X2 £ 8 (demand for desks) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Jones Furniture | ||||
| 2 | |||||
| 3 | Beds | Desks | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Carpentry | 6 | 4 | 36 | |
| 9 | Varnishing | 4 | 8 | 40 | |
| 10 | Desk demand | 1 | 8 | ||
Refer to Exhibit 3.1. Which of the following statements represent the carpentry, varnishing and limited demand for desks constraints?
Question 14 1 out of 1 points
Exhibit 3.2
The following questions are based on this problem and accompanying Excel windows.
The Byte computer company produces two models of computers, Plain and Fancy. It wants to plan how many computers to produce next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but faces only a limited demand. There are also a limited number of wiring, assembly and inspection hours available in each month. The data for this problem is summarized in the following table.
| Let | X1 = Number of Beds to produce |
| X2 = Number of Desks to produce | |
The LP model for the problem is
| MAX: | 30 X1 + 40 X2 |
| Subject to: | 6 X1 + 4 X2 £ 36 (carpentry) |
| 4 X1 + 8 X2 £ 40 (varnishing) | |
| X2 £ 8 (demand for desks) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Jones Furniture | ||||
| 2 | |||||
| 3 | Beds | Desks | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Carpentry | 6 | 4 | 36 | |
| 9 | Varnishing | 4 | 8 | 40 | |
| 10 | Desk demand | 1 | 8 | ||
Refer to Exhibit 3.1. Which of the following statements represent the carpentry, varnishing and limited demand for desks constraints?
Question 15 1 out of 1 points
The constraints X1 ³ 0 and X2 ³ 0 are referred to as
Question 16 0 out of 1 points
Exhibit 3.2
The following questions are based on this problem and accompanying Excel windows.
The Byte computer company produces two models of computers, Plain and Fancy. It wants to plan how many computers to produce next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but faces only a limited demand. There are also a limited number of wiring, assembly and inspection hours available in each month. The data for this problem is summarized in the following table.
|
Computer Model |
Profit per Model ($) |
Maximum demand for product |
Wiring Hours Required |
Assembly Hours Required |
Inspection Hours Required |
| Plain | 30 | 80 | .4 | .5 | .2 |
| Fancy | 40 | 90 | .5 | .4 | .3 |
| Hours Available | 50 | 50 | 22 | ||
| Let | X1 = Number of Plain computers to produce |
| X2 = Number of Fancy computers to produce | |
| MAX: | 30 X1 + 40 X2 |
| Subject to: | .4 X1 + .5 X2 £ 50 (wiring hours) |
| .5 X1 + .4 X2 £ 50 (assembly hours) | |
| .2 X1 + .2 X2 £ 22 (inspection hours) | |
| X1 £ 80 (Plain computers demand) | |
| X2 £ 90 (Fancy computers demand) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Byte Computer Company | ||||
| 2 | |||||
| 3 | Plain | Fancy | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Wiring | 0.4 | 0.5 | 50 | |
| 9 | Assembly | 0.5 | 0.4 | 50 | |
| 10 | Inspection | 0.2 | 0.3 | 22 | |
| 11 | Plain Demand | 1 | 80 | ||
| 12 | Fancy Demand | 1 | 90 | ||
Refer to Exhibit 3.2. What formula should be entered in cell E5 in the accompanying Excel spreadsheet to compute total profit?
Question 17 1 out of 1 points
Exhibit 3.2
The following questions are based on this problem and accompanying Excel windows.
The Byte computer company produces two models of computers, Plain and Fancy. It wants to plan how many computers to produce next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but faces only a limited demand. There are also a limited number of wiring, assembly and inspection hours available in each month. The data for this problem is summarized in the following table.
|
Computer Model |
Profit per Model ($) |
Maximum demand for product |
Wiring Hours Required |
Assembly Hours Required |
Inspection Hours Required |
| Plain | 30 | 80 | .4 | .5 | .2 |
| Fancy | 40 | 90 | .5 | .4 | .3 |
| Hours Available | 50 | 50 | 22 | ||
| Let | X1 = Number of Plain computers to produce |
| X2 = Number of Fancy computers to produce | |
| MAX: | 30 X1 + 40 X2 |
| Subject to: | .4 X1 + .5 X2 £ 50 (wiring hours) |
| .5 X1 + .4 X2 £ 50 (assembly hours) | |
| .2 X1 + .2 X2 £ 22 (inspection hours) | |
| X1 £ 80 (Plain computers demand) | |
| X2 £ 90 (Fancy computers demand) | |
| X1, X2 ³ 0 | |
| A | B | C | D | E | |
| 1 | Byte Computer Company | ||||
| 2 | |||||
| 3 | Plain | Fancy | |||
| 4 | Number to make: | Total Profit: | |||
| 5 | Unit profit: | 30 | 40 | ||
| 6 | |||||
| 7 | Constraints: | Used | Available | ||
| 8 | Wiring | 0.4 | 0.5 | 50 | |
| 9 | Assembly | 0.5 | 0.4 | 50 | |
| 10 | Inspection | 0.2 | 0.3 | 22 | |
| 11 | Plain Demand | 1 | 80 | ||
| 12 | Fancy Demand | 1 | 90 | ||
Refer to Exhibit 3.2. What formula should be entered in cell D8 in the accompanying Excel spreadsheet to compute the amount of wiring used?
Question 18 1 out of 1 points
Models which are setup in an intuitively appealing, logical layout tend to be the most
Question 19 1 out of 1 points
Which command is equivalent to =SUMPRODUCT(A1:A3,B1:B3)?
Question 20 1 out of 1 points
What does the Excel =SUMPRODUCT(A1:A5,C6;C10) command do?
Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Fill in all the assignment paper details that are required in the order form with the standard information being the page count, deadline, academic level and type of paper. It is advisable to have this information at hand so that you can quickly fill in the necessary information needed in the form for the essay writer to be immediately assigned to your writing project. Make payment for the custom essay order to enable us to assign a suitable writer to your order. Payments are made through Paypal on a secured billing page. Finally, sit back and relax.
About Wridemy
We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.
How It Works
To make an Order you only need to click on “Order Now” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Are there Discounts?
All new clients are eligible for 20% off in their first Order. Our payment method is safe and secure.