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.
|
|
|
Maximum |
|
Assembly |
Inspection |
|
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.
|
|
|
Maximum |
|
Assembly |
Inspection |
|
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.
|
|
|
Maximum |
|
Assembly |
Inspection |
|
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?
We value our customers and so we ensure that what we do is 100% original..
With us you are guaranteed of quality work done by our qualified experts.Your information and everything that you do with us is kept completely confidential.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.
Read moreThe Product ordered is guaranteed to be original. Orders are checked by the most advanced anti-plagiarism software in the market to assure that the Product is 100% original. The Company has a zero tolerance policy for plagiarism.
Read moreThe Free Revision policy is a courtesy service that the Company provides to help ensure Customer’s total satisfaction with the completed Order. To receive free revision the Company requires that the Customer provide the request within fourteen (14) days from the first completion date and within a period of thirty (30) days for dissertations.
Read moreThe Company is committed to protect the privacy of the Customer and it will never resell or share any of Customer’s personal information, including credit card data, with any third party. All the online transactions are processed through the secure and reliable online payment systems.
Read moreBy placing an order with us, you agree to the service we provide. We will endear to do all that it takes to deliver a comprehensive paper as per your requirements. We also count on your cooperation to ensure that we deliver on this mandate.
Read more