Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3.6, Problem 3P
Explanation of Solution
Net Present Value (NPV) for the transaction:
Consider “r” is the variable which represents an annual interest rate. The annual interest rate is “r = 0.20” and it denotes that all money in the bank earns 20% interest each year.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
We have the following transactions with associated schedulesT1: R(A) R(B) W(A)T2: R(A) R(B) W(A) W(B)a) Give the schedule of transactions T1 and T2 that leads to a WR conflict.b) Give the schedule of transactions T1 and T2 that lead to RW conflict.c) Give the schedule of transactions T1 and T2 that leads to a WW conflict.d) For each of the given schedules, show how a strict 2FZ would prevent this.
Let c1, c2, and c3 be the confidence values of the rules {p} → {q}, {p} → {q, r}, and {p, r}→{q}, respectively. If we assume that c1, c2, and c3 have different values, what are the Customer ID Transaction ID Items Bought 1 0001 {a, d, e} 1 0024 {a, b, c, e} 2 0012 {a, b, d, e} 2 0031 {a, c, d, e} 3 0015 {b, c, e} 3 0022 {b, d, e} 4 0029 {c, d} 4 0040 {a, b, c} 5 0033 {a, d, e} 5 0038 {a, b, e} possible relationships that may exist among c1, c2, and c3? Which rule has the lowest confidence?
82.
Consider money is transferred from (1)account-A to account-B and (2) account-B to account-A. Which of the following form a transaction ?
a.
Only 1
b.
Only 2
c.
Both 1 and 2 individually
d.
Either 1 or 2
Chapter 3 Solutions
Introduction to mathematical programming
Ch. 3.1 - Prob. 1PCh. 3.1 - Prob. 2PCh. 3.1 - Prob. 3PCh. 3.1 - Prob. 4PCh. 3.1 - Prob. 5PCh. 3.2 - Prob. 1PCh. 3.2 - Prob. 2PCh. 3.2 - Prob. 3PCh. 3.2 - Prob. 4PCh. 3.2 - Prob. 5P
Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Fincos objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Prob. 31RPCh. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
Knowledge Booster
Similar questions
- Alice has a wallet with exactly 10 Ether in it, and sends 10 Ether to Bob. In order for this transaction to be mined, what must be true? The gas price was set to zero by Alice Alice already had gas in his account. The gas price was set to zero by Bob Bob already has gas in his accountarrow_forwardIn a POS system, a transaction is based on items purchased by the customer. The following is an example of a customer transaction receipt, where the prices shown in the receipt are GST inclusive.arrow_forwardIn a list there is cost price of n goods. On the most expensive thing there is a loss of x% and on the cheapest thing there is a gain of y% and on rest of things there is a gain of p%. Find loss or gain on whole transaction in Rupees.arrow_forward
- Pretend you have five employees who would like to know exactly how much their bi-weekly pay will be once all of their deductions are taken off. Their weekly pay is as follows: Emp #1. $1100 Emp #2. $1300 Emp #3. $1500 Emp #4. $1700 Emp #5. $2300 *Taxation *arrow_forwardGiven the following transaction database from a supermarket: Transaction ID items T1 I1, I2, I3 T2 I2, I3, I4 T3 I4, I5 T4 I1, I2, I4 T5 I1, I2, I3, I5 T6 I1, I2, I3, I4 What is the output of the Apriori algorithm run on the above transaction database with a minimum support of 50 % (i.e. 3 out of 6 transactions)? Calculate the following confidence: {I1, I2} => { I3} {I2} => {I1, I3} {I1, I3} => {I2} Calculate the following lift: {I2} => {I3} {I2} => {I4} {I1, I3} => {I2}arrow_forwardplease help me to solve this simple operation question of paython 7. s='a,b,c', s2=('x','y','z'), s3=':'s.split(','): s3.join('abc'): s3.join(s2)arrow_forward
- Consider the following cryptarithmetic problem where TWO and FOUR are three and four digit numbers respectively. Which of the following constraint(s) is/are correct for modeling this problem? Assume that X1, X2 & X3 are carry overs resulting from the additions at the unit, tens and the hundreds place. Also, all digits are distinct.arrow_forwardGiven: e-NFA M2 = ({A,B,C}, {0,1}, delta, A, {C}) where delta: (A,0) -> {C}, (A,1) -> {B}, (A,e) -> null, (B,0) -> {A}, (B,1) -> null, (B,e) -> {C}, (C,0) -> null, (C,1) -> {A}, (C,e) -> null. Get the equivalent DFA of the given e-NFA. How many accepting states in the equivalent DFA?arrow_forwardConsider the following parameters for RSA.P = 31 , q = 17. The value of Public (PU) and private key (PR) is:arrow_forward
- Draw a decision tree given problem below. A businessman must decide whether to open a new mini grocery branch or simply extend the number of hours of its operation on its existing branch with a payoff of Php150,000. According to his friend, demand at a new location can either be low or high, which he probabilities are estimated to be 35% and 65%, respectively. If a new branch is opened and demand proves to be high, the businessman may choose to operate 24hrs (payoff is Php350, 000) or to operate 12hrs (payoff is Php200,000). If a new branch is opened and demand proves to be low, there is no need to operate on a 24-hr basis but instead, they will just stick to 12-hr operation with payoff of Php100,000 or enhance marketing strategy through advertising. Projected response to advertising may either be favorable or not favorable, with estimated probabilities of 40% and 60%, respectively. If demand is favorable, the payoff grows to Php310,000 and if the response in unfavorable, the payoff is…arrow_forwardThe Manhattan Tourist Problem (1) Given setting in Figure 6.4, calculate exact number of different paths by dynamic programming. (2) For a general setting, i.e., from source(0,0) to sink (n, m), how many different paths by dynamic programming?1 4 3 3 4 1 0 4 3 N 5 1arrow_forwardComputer Science A blockchain could be considered as a state machine. Suppose a hospial with 100,000 patients, 500 physicians, 1000 nurses, and 100 adminsitrative staff is using a blockchain to keep track of its activities. Each patient has a patient ID. Each of the employees (physicians, nurses, and admins) have an employee ID. For simplicity let us assume that there are only five types of transactions: (i) New patient admitted and assignd an ID by an admin (ii) A patient is discharged by an admin (iii) A nurse takes a triage of the patient (temperature, blood pressure, etc.) and records the information(iv) A physician makes a diagnosis and prescribes medications (v) Patient is billed by an admin. Answer the following questions. What could be the state of the hospital? What would a transaction of type (iv) look like? (Hint: Show the type and its parameters) If a patient with ID A67567 has been discharged (type ii), show how this transaction results in a transition to a new state?…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole