Consider the following system of equations for all
problems.
The following system of equations is designed to determine
concentrations (the c’s in g/m3) in a series of coupled reactors as
a function of the amount of mass input to each reactor (the
right-hand sides in g/day).
8?1 − 4?2 − 2?3 = 2000
−3?1 + 18?2 − 6?3 = 1400
−4?1 − 2?2 + 12?3 = 3000
Calculate and interpret the condition number. Use the row-sum norm. Scale the coefficient matrix (A) so the absolute value of the maximum element in each row is 1 (max magnitude in each row = 1). You may use MATLAB’s inv to find the inverse of the scaled A matrix
In: Advanced Math
2. The following model has been formulated to describe the manufacture of two products X and Y.
maximize 4X +5Y
subject to:
X +2Y ≤ 10 (labour in hours)
6X +6Y ≤ 36 (materials used in kg)
8X +4Y ≤ 40 (storage space in m^3 )
X,Y ≥ 0
Using Excel to solve gives the following output and sensitivity report:
| X | Y | OFV | |||
| revenue | $4.00 | $5.00 | $28.00 | ||
| number | 2 | 4 | |||
| labour (hrs) | 1 | 2 | 10 | <= | 10 |
| material (kilo) | 6 | 6 | 36 | <= | 36 |
| space (m^2) | 8 | 4 | 32 | <= | 40 |
Variable Cells
| Cell | Name | Final Value | Reduced costs | Objective coefficient | Allowable Increase | Allowable Decrease |
| $C$3 | number x | 2 | 0 | 4 | 1 | 1.5 |
| $D$3 | number y | 4 | 0 | 5 | 3 | 1 |
Constraints
| Cell | Name | Final Value | Shadow Price | Constraint R.H Side | Allowable Increase | Allowable Decrease |
| $E$5 | labour (hrs) | 10 | 1 | 10 | 2 | 2 |
| $E$6 | materials (kilo) | 36 | 0.5 | 36 | 4 | 6 |
| $E$7 | space (m^2) | 32 | 0 | 40 | 1E+30 | 8 |
1) State the final recommendation as fully as you can.
2) Calculate and explain what happens to the optimal solution in each of the following situations:
(a) You acquire 2 additional kilos of material.
(b) You acquire an additional 1.5 hours of labour.
(c) You give up 1 hour of labour and get 1.5 kilos of material.
(d) The profits from X and Y are changed to $4.75 each.
(e) You introduce a new product that will sell for $2. Each unit of this item will use 1 hour of labour, 1 kilo of material and 2 m2 of space.
In: Operations Management
Garden Glory Project Questions Assume that Garden Glory designs a database with the following tables:
OWNER (OwnerID, OwnerName, OwnerEmail, OwnerType)
OWNED_PROPERTY (PropertyID, PropertyName, PropertyType, Street, City, State, Zip, OwnerID)
GG_SERVICE (ServiceID, ServiceDescription, CostPerHour);
EMPLOYEE (EmployeeID, LastName, FirstName, CellPhone, ExperienceLevel)
PROPERTY_SERVICE ( PropertyServiceID , PropertyID , ServiceID, ServiceDate , EmployeeID, HoursWorked)
The referential integrity constraints are:
OwnerID in OWNED_PROPERTY must exist in OwnerID in OWNER
PropertyID in PROPERTY_SERVICE must exist in PropertyID in OWNED_PROPERTY
ServiceID in PROPERTY_SERVICE must exist in ServiceID in GG_SERVICE
EmployeeID in PROPERTY_SERVICE must exist in EmployeeID in EMPLOYEE
Assume that OwnerID in OWNER, PropertyID in PROPERTY, and EmployeeID in EMPLOYEE are surrogate keys with values as follows:
OwnerID Start at 1 Increment by 1
PropertyID Start at 1 Increment by 1
ServiceID Start at 1 Increment by 1
EmployeeID Start at 1 Increment by 1
PropertyServiceID Start at 1 Increment by 1
Sample data are shown in Figure 3-38, Figure 3-39, Figure 3-40, Figure 3-41, and Figure 3-42. OwnerType is either Individual or Corporation. PropertyType is one of Office, Apartments, or Private Residence. ExperienceLevel is one of Unknown, Junior, Senior, Master or SuperMaster. These tables, referential integrity constraints, and data are used
Sample Data for Garden Glory OWNER Table OwnerID OwnerName OwnerEmailAddress OwnerType
1 Mary Jones [email protected] Individual
2 DT Enterprises [email protected] Corporation
3 Sam Douglas [email protected] Individual
4 UNY Enterprises [email protected] Corporation
5 Doug Samuels [email protected] Individual
Sample Data for Garden Glory OWNED_PROPERTY Table PropertyID PropertyName PropertyType Street City State ZIP OwnerID
1 Eastlake Building Office 123 Eastlake Seattle WA 98119 2
2 Elm St Apts Apartments 4 East Elm Lynwood WA 98223 1
3 Jefferson Hill Office 42 West 7th St Bellevue WA 98007 2
4 Lake View Apts Apartments 1265 32nd Avenue Redmond WA 98052 3
5 Kodak Heights Apts Apartments 65 32nd Avenue Redmond WA 98052 4
6 Jones House Private Residence 1456 48th St Bellevue WA 98007 1
7 Douglas House Private Residence 1567 51st St Bellevue WA 98007 3
8 Samuels House Private Residence 567 151st St Redmond WA 98052 5
as the basis for the SQL statements you will create in the exercises that follow. If possible, run these statements in an actual DBMS, as appropriate, to obtain your results. Name your database GARDEN_GLORY. Use data types consistent with the DBMS you are using. If you are not using an actual DBMS, consistently represent data types using either the MySQL, Microsoft SQL Server, or Oracle Database data types shown in Figure 3-5. For each SQL statement you write, show the results based on your data. Write SQL statements and answer questions for this database as follows:
FIGURE 3-40
Sample Data for Garden Glory EMPLOYEE Table EmployeeID LastName FirstName CellPhone ExperienceLevel
1 Smith Sam 206-254-1234 Master
2 Evanston John 206-254-2345 Senior
3 Murray Dale 206-254-3456 Junior
4 Murphy Jerry 585-545-8765 Master
5 Fontaine Joan 206-254-4567 Senior
FIGURE 3-41
Sample Data for Garden Glory GG_SERVICE Table ServiceID ServiceDescription CostPerHour
1 Mow Lawn 25.00
2 Plant Annuals 25.00
3 Weed Garden 30.00
4 Trim Hedge 45.00
5 Prune Small Tree 60.00
6 Trim Medium Tree 100.00
7 Trim Large Tree 125.00
FIGURE 3-42
Sample Data for Garden Glory PROPERTY_SERVICE Table PropertyServiceID PropertyID ServiceID ServiceDate EmployeeID HoursWorked
1 1 2 2019-05-05 1 4.50
2 3 2 2019-05-08 3 4.50
3 2 1 2019-05-08 2 2.75
4 6 1 2019-05-10 5 2.50
5 5 4 2019-05-12 4 7.50
6 8 1 2019-05-15 4 2.75
7 4 4 2019-05-19 1 1.00
8 7 1 2019-05-21 2 2.50
9 6 3 2019-06-03 5 2.50
10 5 7 2019-06-08 4 10.50
11 8 3 2019-06-12 4 2.75
12 4 5 2019-06-15 1 5.00
13 7 3 2019-06-19 2 4.00
F. Write an SQL statement to list LastName, FirstName, and CellPhone for all employees having an experience level of Master and FirstName that begins with the letter J
will you please explain thank you
In: Computer Science
Java Program
Sequential Search
You are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S. Do not use any import sort packages.
Input: In the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.
Output: Print C in a line.
Constraints
Sample Input 1
5 1 2 3 4 5 3 3 4 1
Sample Output 1
3
Sample Input 2
3 3 1 2 1 5
Sample Output 2
0
Sample Input 3
5 1 1 2 2 3 2 1 2
Sample Output 3
2
In: Computer Science
Please answer this two part question. Thank you!
For this assignment you must write the following functions in Scheme:
2.1 Write a recursive function called eval-poly
that takes a list of numbers representing the coefficients of a
polynomial and a value for ? and evaluates the polynomial for the
given value of ?. The list of coefficients should start with the
term of lowest degree and end with the term of highest degree. If
any term of intermediate degree is missing from the polynomial it
should have a coefficient of zero. For example, the polynomial
?3+4?2+2 would be represented by the list '(2 0 4 1). Hint: the
polynomial above can be rewritten as 2+?⋅(0+?⋅(4+?⋅1))
> (eval-poly '() 0)
0
> (eval-poly '(5) 0)
5
> (eval-poly '(4 3) 2)
10
> (eval-poly '(2 7 1) 3)
32
2.2 Write a tail-recursive version of the
previous problem called eval-poly-tail. It should call a helper
function called eval-poly-tail-helper that uses tail recursion to
keep a running sum of the terms evaluated so far. You might want to
use the expt function to take a number to a power.
> (eval-poly-tail '() 0)
0
> (eval-poly-tail '(5) 0)
5
> (eval-poly-tail '(4 3) 2)
10
> (eval-poly-tail '(2 7 1) 3)
32
In: Computer Science
Which of the following combinations of gates can be used to make a clocked SR flip-flop? Assume NOT gates have one input each, all other gates have two inputs each. (One or more is true. Your answer is considered correct only if all and only the true options are selected.)
A. 4 NAND gates,2 NOR gates
B. 2 AND gates,1 OR gates,1 NAND gates,1 NOR gates
C. 1 NAND gates,4 NOR gates
D. 1 OR gates,4 NAND gates,7 NOR gates
E. None of the above
In: Electrical Engineering
Calculate the 5-day and 50-day simple MA for the stock price from 28 Oct 2016 to 14 June 2017. Plot the MA5 and MA50. How many golden crosses (if any) are there?
| Date | Time | Closing Price | 5-day MA | 50-day MA |
| 2016/10/28 | 1 | 204 | ||
| 2016/10/31 | 2 | 205.399994 | ||
| 2016/11/1 | 3 | 206 | ||
| 2016/11/2 | 4 | 203 | ||
| 2016/11/3 | 5 | 200.199997 | ||
| 2016/11/4 | 6 | 199.699997 | ||
| 2016/11/7 | 7 | 202.600006 | ||
| 2016/11/8 | 8 | 203.600006 | ||
| 2016/11/9 | 9 | 202.399994 | ||
| 2016/11/10 | 10 | 204.800003 | ||
| 2016/11/11 | 11 | 206.199997 | ||
| 2016/11/14 | 12 | 204.199997 | ||
| 2016/11/15 | 13 | 203.399994 | ||
| 2016/11/16 | 14 | 203.399994 | ||
| 2016/11/17 | 15 | 204 | ||
| 2016/11/18 | 16 | 203 | ||
| 2016/11/21 | 17 | 202.399994 | ||
| 2016/11/22 | 18 | 203.800003 | ||
| 2016/11/23 | 19 | 203.600006 | ||
| 2016/11/24 | 20 | 203.800003 | ||
| 2016/11/25 | 21 | 205 | ||
| 2016/11/28 | 22 | 204.800003 | ||
| 2016/11/29 | 23 | 203.600006 | ||
| 2016/11/30 | 24 | 204 | ||
| 2016/12/1 | 25 | 204.199997 | ||
| 2016/12/2 | 26 | 202.800003 | ||
| 2016/12/5 | 27 | 197.399994 | ||
| 2016/12/6 | 28 | 196.399994 | ||
| 2016/12/7 | 29 | 193.600006 | ||
| 2016/12/8 | 30 | 195 | ||
| 2016/12/9 | 31 | 192.699997 | ||
| 2016/12/12 | 32 | 189.600006 | ||
| 2016/12/13 | 33 | 189.600006 | ||
| 2016/12/14 | 34 | 190 | ||
| 2016/12/15 | 35 | 186.899994 | ||
| 2016/12/16 | 36 | 185.100006 | ||
| 2016/12/19 | 37 | 182.600006 | ||
| 2016/12/20 | 38 | 182.100006 | ||
| 2016/12/21 | 39 | 182.100006 | ||
| 2016/12/22 | 40 | 181 | ||
| 2016/12/23 | 41 | 179.899994 | ||
| 2016/12/28 | 42 | 180.699997 | ||
| 2016/12/29 | 43 | 180.899994 | ||
| 2016/12/30 | 44 | 183.199997 | ||
| 2017/1/3 | 45 | 184.300003 | ||
| 2017/1/4 | 46 | 182.600006 | ||
| 2017/1/5 | 47 | 185.300003 | ||
| 2017/1/6 | 48 | 185.399994 | ||
| 2017/1/9 | 49 | 185.600006 | ||
| 2017/1/10 | 50 | 187.5 | ||
| 2017/1/11 | 51 | 188.300003 | ||
| 2017/1/12 | 52 | 186.600006 | ||
| 2017/1/13 | 53 | 186.5 | ||
| 2017/1/16 | 54 | 185 | ||
| 2017/1/17 | 55 | 185.899994 | ||
| 2017/1/18 | 56 | 187.899994 | ||
| 2017/1/19 | 57 | 187.199997 | ||
| 2017/1/20 | 58 | 185.5 | ||
| 2017/1/23 | 59 | 185.199997 | ||
| 2017/1/24 | 60 | 185.199997 | ||
| 2017/1/25 | 61 | 185.800003 | ||
| 2017/1/26 | 62 | 187.800003 | ||
| 2017/1/27 | 63 | 188.699997 | ||
| 2017/2/1 | 64 | 188.5 | ||
| 2017/2/2 | 65 | 187.300003 | ||
| 2017/2/3 | 66 | 186.399994 | ||
| 2017/2/6 | 67 | 187.199997 | ||
| 2017/2/7 | 68 | 186.699997 | ||
| 2017/2/8 | 69 | 195.5 | ||
| 2017/2/9 | 70 | 195.5 | ||
| 2017/2/10 | 71 | 195.800003 | ||
| 2017/2/13 | 72 | 198.699997 | ||
| 2017/2/14 | 73 | 197.800003 | ||
| 2017/2/15 | 74 | 202 | ||
| 2017/2/16 | 75 | 202.399994 | ||
| 2017/2/17 | 76 | 200.199997 | ||
| 2017/2/20 | 77 | 200.800003 | ||
| 2017/2/21 | 78 | 199 | ||
| 2017/2/22 | 79 | 200 | ||
| 2017/2/23 | 80 | 200.399994 | ||
| 2017/2/24 | 81 | 198 | ||
| 2017/2/27 | 82 | 195.399994 | ||
| 2017/2/28 | 83 | 192.699997 | ||
| 2017/3/1 | 84 | 193.5 | ||
| 2017/3/2 | 85 | 192 | ||
| 2017/3/3 | 86 | 191.399994 | ||
| 2017/3/6 | 87 | 191.699997 | ||
| 2017/3/7 | 88 | 192.199997 | ||
| 2017/3/8 | 89 | 191.800003 | ||
| 2017/3/9 | 90 | 190.399994 | ||
| 2017/3/10 | 91 | 190.100006 | ||
| 2017/3/13 | 92 | 191.800003 | ||
| 2017/3/14 | 93 | 192 | ||
| 2017/3/15 | 94 | 194.699997 | ||
| 2017/3/16 | 95 | 197.399994 | ||
| 2017/3/17 | 96 | 196.5 | ||
| 2017/3/20 | 97 | 200.399994 | ||
| 2017/3/21 | 98 | 199.699997 | ||
| 2017/3/22 | 99 | 196.399994 | ||
| 2017/3/23 | 100 | 196.399994 | ||
| 2017/3/24 | 101 | 196.399994 | ||
| 2017/3/27 | 102 | 195 | ||
| 2017/3/28 | 103 | 195.399994 | ||
| 2017/3/29 | 104 | 194.600006 | ||
| 2017/3/30 | 105 | 194.399994 | ||
| 2017/3/31 | 106 | 195.600006 | ||
| 2017/4/3 | 107 | 196.100006 | ||
| 2017/4/5 | 108 | 197.399994 | ||
| 2017/4/6 | 109 | 196 | ||
| 2017/4/7 | 110 | 195.899994 | ||
| 2017/4/10 | 111 | 195.5 | ||
| 2017/4/11 | 112 | 193.800003 | ||
| 2017/4/12 | 113 | 195.199997 | ||
| 2017/4/13 | 114 | 194.199997 | ||
| 2017/4/18 | 115 | 191.699997 | ||
| 2017/4/19 | 116 | 190.800003 | ||
| 2017/4/20 | 117 | 191.5 | ||
| 2017/4/21 | 118 | 190.800003 | ||
| 2017/4/24 | 119 | 190.800003 | ||
| 2017/4/25 | 120 | 192 | ||
| 2017/4/26 | 121 | 193.699997 | ||
| 2017/4/27 | 122 | 194.100006 | ||
| 2017/4/28 | 123 | 191.600006 | ||
| 2017/5/2 | 124 | 191.600006 | ||
| 2017/5/4 | 125 | 190.600006 | ||
| 2017/5/5 | 126 | 189.300003 | ||
| 2017/5/8 | 127 | 189.600006 | ||
| 2017/5/9 | 128 | 194.399994 | ||
| 2017/5/10 | 129 | 194.199997 | ||
| 2017/5/11 | 130 | 195.699997 | ||
| 2017/5/12 | 131 | 195.5 | ||
| 2017/5/15 | 132 | 197.100006 | ||
| 2017/5/16 | 133 | 196.699997 | ||
| 2017/5/17 | 134 | 197.699997 | ||
| 2017/5/18 | 135 | 195.300003 | ||
| 2017/5/19 | 136 | 195.699997 | ||
| 2017/5/22 | 137 | 196.399994 | ||
| 2017/5/23 | 138 | 195.199997 | ||
| 2017/5/24 | 139 | 194.899994 | ||
| 2017/5/25 | 140 | 196.300003 | ||
| 2017/5/26 | 141 | 196 | ||
| 2017/5/29 | 142 | 197.199997 | ||
| 2017/5/31 | 143 | 196.699997 | ||
| 2017/6/1 | 144 | 196.800003 | ||
| 2017/6/2 | 145 | 205 | ||
| 2017/6/5 | 146 | 203.800003 | ||
| 2017/6/6 | 147 | 205 | ||
| 2017/6/7 | 148 | 204.199997 | ||
| 2017/6/8 | 149 | 205.600006 | ||
| 2017/6/9 | 150 | 205.399994 | ||
| 2017/6/12 | 151 | 199.699997 | ||
| 2017/6/13 | 152 | 201 | ||
| 2017/6/14 | 153 | 200.600006 |
In: Finance
(a) Prove that Sn is generated by the elements in the set {(i i+1) : 1≤i≤n}.
[Hint: Consider conjugates, for example (2 3) (1 2) (2 3)−1.]
(b) ProvethatSn isgeneratedbythetwoelements(12)and(123...n) for n ≥ 3.
(c) Prove that H = 〈(1 3), (1 2 3 4)〉 is a proper subgroup of S4.
In: Advanced Math
1.The algebraic minterm of F(A,B,C) = ABC + B’C is:
2.The digital minterm of F is:
3. The digital maxterm for F is:
4.The digital minterm of F’ is:
5.The digital maxterm of F’ is:
6.If the digital minterm of F(A,B,C,D) = Σ m(0, 2, 4, 6), the digital maxterm is:
7.The minimum sum of products for F(A,B,C) = Σ m(0, 1, 4) is:
In: Computer Science
PRICE | QUANTITY | TOTAL REVENUE (TR) | MARGINAL REVENUE (MR) |
| $10 | 1 | $10 | |
| $9 | 2 | $18 | $8 |
| $8 | 3 | $24 | $6 |
| $7 | 4 | $28 | $4 |
| $6 | 5 | $30 | $2 |
| $5 | 6 | $30 | $0 |
| $4 | 7 | $28 | $-2 |
| $3 | 8 | $24 | $-4 |
$2 $1 | 9 10 | $18 $10 | $-6 $-8 |
1. Now, draw (and label) a demand and MR curve, but add a marginal cost (MC) curve to the picture:
SHOW the profit-maximizing output for the monopolist, Q* (remember -- even though the market structure is different, all profit-maximizers follow the same rule . . . ).
At Q* (the profit-maximizing output), show the PRICE that the monopoly firm will be able to charge its customers for that level of output.
How does the monopolist's price compare to his/her MC?
In: Economics