we want to find if we need to buy additional stock for each item in our inventory item list according to the following conditions: - if item stock for november and december was less than 100 , OR stock for septemper and october less than 200 then we will buy stock double the stock of december. -else, we will buy stock half december stock. example: the stock of pens for november and december is 95 which is less than 100 then we will buy double the stock of december which is (84 2)=168

we want to find if we need to buy additional stock for each item in our inventory item list according to the following conditions: - if item stock for november and december was less than 100 , OR stock for septemper and october less than 200 then we will buy stock double the stock of december. -else, we will buy stock half december stock. example: the stock of pens for november and december is 95 which is less than 100 then we will buy double the stock of december which is (84 2)=168

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.2: Modeling Arrival And Service Processes

Problem 3P

See similar textbooks

Similar questions

Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment. If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit of 4.5 dollar. For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100. Complete the RECURSIVE methods below that take an array of integers (investments) and an iterator (always sets to…
Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment. If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit of 4.5 dollar. For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% whereas for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. The investment will always be greater or equal to 25,000 and multiple of 100. Complete the RECURSIVE methods below that take an array of integers (investments) and an iterator (always sets to…
TID items_bought 100 {M, O, N, K, E, Y} 200 {D, O, N, K, E, Y} 300 {M, A, K, E} 400 {M, U, C, K, Y} 500 {C, O, K, I, E} Which of the following are maximal itemset in the table above, when minsup is 40%? a. {K, C} b. {M, K} c. {O, N, K, Y}
To cut an 'n' centimeter-long gold bar into 2 pieces costs $n. When a gold bar is cut into many pieces, the order in which the cuts occur can affect the total amount of costs. For example, to cut a 20 centimeter gold bar at length marks 2, 8, and 10 (numbering the length marks in ascending order from the left-hand end, starting from 1). If the cuts to occur in left-to-right order, then the first cut costs $20, the second cut costs $18 (cutting the remaining 18 centimeter bar at originally length mark 8), and the third cut costs $12, totaling $50. If the cuts to occur in right-to-left order, however, then the first cut costs $20 time, the second cut costs $10, and the third cut costs $8, totaling $38. In yet another order, the first cut is at 8 (costing $20), then the 2nd cut is at 2 (costing $8), and finally the third cut is at 10 (costing $12), for a total cost of $40. Given an 'n' centimeter-long gold bar G and an array C[1..m] containing the cutting points in ascending order): a.…
[Very Hard] Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment. If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit of 4.5 dollar. For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100. Complete the RECURSIVE methods below that take an array of integers (investments) and an iterator (always…
ProblemGiven a value `value`, if we want to make change for `value` cents, and we have infinitesupply of each of coins = {S1, S2, .. , Sm} valued `coins`, how many ways can we make the change?The order of `coins` doesn't matter.For example, for `value` = 4 and `coins` = [1, 2, 3], there are four solutions:[1, 1, 1, 1], [1, 1, 2], [2, 2], [1, 3].So output should be 4. For `value` = 10 and `coins` = [2, 5, 3, 6], there are five solutions: [2, 2, 2, 2, 2], [2, 2, 3, 3], [2, 2, 6], [2, 3, 5] and [5, 5].So the output should be 5. Time complexity: O(n * m) where n is the `value` and m is the number of `coins`Space complexity: O(n)""" def count(coins, value): """ Find number of combination of `coins` that adds upp to `value` Keyword arguments: coins -- int[] value -- int """ # initialize dp array and set base case as 1 dp_array = [1] + [0] * value) ++.
Problem1Given a value `value`, if we want to make change for `value` cents, and we have infinitesupply of each of coins = {S1, S2, .. , Sm} valued `coins`, how many ways can we make the change?The order of `coins` doesn't matter.For example, for `value` = 4 and `coins` = [1, 2, 3], there are four solutions:[1, 1, 1, 1], [1, 1, 2], [2, 2], [1, 3].So output should be 4. For `value` = 10 and `coins` = [2, 5, 3, 6], there are five solutions: [2, 2, 2, 2, 2], [2, 2, 3, 3], [2, 2, 6], [2, 3, 5] and [5, 5].So the output should be 5. Time complexity: O(n * m) where n is the `value` and m is the number of `coins`Space complexity: O(n)""" def count(coins, value): """ Find number of combination of `coins` that adds upp to `value` Keyword arguments: coins -- int[] value -- int """ # initialize dp array and set base case as 1 dp_array = [1] + [0] * value.. (+.
In the refrigerator example, suppose the warranty worksas follows. If a refrigerator fails at any time within 5 yearsof purchase, we give the consumer a prorated refund on the$500 purchase price. For example, if the refrigerator failsafter 4 years, we pay the customer $100. If the refrigeratorfails after 3 years, we pay the customer $200. Estimate ourexpected warranty expense per refrigerator sold.
Suppose that there are N events to be held this year. The ith event is scheduled from day si to day ti, and free food is to be served for that event every day from day si to ti (inclusive). Your task is to find out how many days there are in which free food is served by at least one event. For example, let N = 3 events. The first event is held from day 10 to 14, the second event is held from day 13 to 17, and the third event is held from day 25 to 26. The days in which free food is served by at least one event are 10, 11, 12, 13, 14, 15, 16, 17, 25, 26, for a total of 10 days. Note that both events serve free food on days 13 and 14, and therefore they are only counted once. The first line the user will supply you is an integer, N, denoting the number of events. Each of the next N lines contains two integers si and ti denoting that the ith event will be held from si to ti (inclusive), and free food is served for all of those days. The output contains a single integer which denotes the…
There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan. c++
Suppose we have a nice young couple who borrow $700000 from the bank, at an annual interest rate of3.124%. The mortgage is a 30 year loan, so they need to pay it off within 360 months total. Our happycouple decide to set their monthly mortgage payment at $2000 per month. Will they pay off the loan intime or not?Note that the monthly balance will be calculated asbalance = (im × previous balance) - monthly paymentwhere the convert annual interest to a monthly multiplier im is calculated as im = (1 +i)1/12 and i = annualinterest rate.Write a loop for track the total payment in 360 months so that we can evaluate if the couple can pay off theloan. Write in R Please and thank you.
In a fractional knapsack problem The first line of the input takes n, the number of items. In the next n lines, for each item (from 1 to n),you take the weight and the corresponding benefit. In the last line you take the knapsack capacity Wfrom the user.Output:In the output, you print out the items (in the increasing order) that has been selected, and for each itemhow much amount has been taken into consideration and what is the profit made from each item. Thelast line output the maximum profit that can be made.Sample Input54 128 322 406 301 5010Sample Output:Item 2 Amount 1 Profit 4Item 3 Amount 2 Profit 40Item 4 Amount 6 Profit 30Item 5 Amount 1 Profit 50Total Profit: 124