end books from book bank only for two months, if it is blue he can lend books from Reference library only for a week. If it is yellow he can lend books from Circulation library for one day. If a student has green card and return book above two months so ask how many days are above from due date than charge rupees 30/ day. Calculate the total amount in the last. If a student has blue card and r

end books from book bank only for two months, if it is blue he can lend books from Reference library only for a week. If it is yellow he can lend books from Circulation library for one day. If a student has green card and return book above two months so ask how many days are above from due date than charge rupees 30/ day. Calculate the total amount in the last. If a student has blue card and r

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

Interest on a credit card’s unpaid balance is calculated using the average daily balance. Suppose that netBalance is the balance shown in the bill, payment is the payment made, d1 is the number of days in the billing cycle, and d2 is the number of days payment is made before billing cycle. Then, the average daily balance is: averageDailyBalance =netBalance x d1-payment x d2d1 If the interest rate per month is, say, 0.0152, then the interest on the unpaid balance is: Interest= averageDailyBalance * 0.0152 Write a program using c++ compiler that accepts as inputnetBalance, payment, d1,d2, and interest rate per month. The program outputs the interest. Format your output to two decimal places.
Computer Science Investing in stocks is a way to create assets that are supposed to provide financial security over time. In solving this problem, we assume that an investor buys several shares of stock at a certain price. These shares are going to be sold later on for a different price. Obviously, if the selling price is higher than the acquisition price, the investor makes a profit, registering capital gain. If the shares are sold at a lower price, the investor has a loss, which marks a negative capital gain. This whole process is done over a period of time, and you are required to create a scenario for buying and selling shares. The assumption is that the investor sells shares in the order in which they were purchased. The goal is to calculate the capital gain over time. Suppose that you buy n shares of stock or mutual fund for d dollars each. Later, you sell some of these shares. If the sale price exceeds the purchase price, you have made a profit—a capital gain. On the other…
Problem You have a fence post located at the point (x,y) where a goat is tethered by a rope. You also have a house, which is a rectangle with diagonally opposite corners at the points bottom-left: (x1,y1) and top-right: (x2,y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope. Recall that the distance formula is: (x2−x1)2+(y2−y1)2 The input consists of a single line containing six space-separated integer values: x, y, x1, y1, x2, and y2. You are guaranteed that x1<x2 and y1<y2, and that (x,y) is strictly outside the axis-aligned rectangle with corners at (x1,y1) and (x2,y2). Return the minimum distance from the goat’s post to the house as a floating-point value from main(). Learning Objectives Be able to create a program with a lesser template. Be able to calculate the min/max of integers. Be able to write a mathematical…
H.W: Consider about a washing machine equipped with fuzzy logic controller. There are two inputs applied in the machine and one output. The first input is amount of clothes and the second input is type of dirt. The rules applied in the system is shown 1.IF amount of clothes is LARGE and type of dirt is GREASY THEN wash time is LONG; below: 2.IF amount of clothes is MEDIUM and type of dirt is MEDIUM THEN wash time is MEDIUM; 3.IF amount of clothes is SMALL THEN wash time is SHORT. The membership of each input is as shown in Figure 1. The output of the system is as shown in Figure 2. If you have a 4.5 kg of cloths to be washed, and your clothes are in level 3 of greasiness, then calculate the washing time needed using Mamdani style inference. FXX XX XX 0.5 0.5 0.5 Not medium greasy small medium large greasy Short V medium O 1 2 3 4 5 6 2 4 6 8 10 Level of greasiness Dirty cloths, kg 60 Washing time, minutes (a) (b) Figure 1 Input of the system (a) dirty clothes (b) level of greasiness…
2. A safe has 5 locks v, w, y and z; all of which must be unlocked for the safe to open. The keys to the locks are distributed among five executives in the following manner.Mr. A has keys for locks v and x. Mr. B has keys for locks v and y. Mr. C has keys for locks w and y. Mr. D has keys for locks x and z. Mr. E has keys for locks v and z.a) Determine the minimal number of executives required to open the safe.b) Find all the combinations of executives that can open the safe; write and expression f(A, B, C, D, E) which specifies when the safe can be opened as a function of what executives are present.c) Who is the essential executive?
Conway's Game of Life: This is a zero person game with the following rules: (see Wikipedia for example) Any live cell with fewer than two live neighbours dies, as if by underpopulation. Any live cell with two or three live neighbours lives on to the next generation. Any live cell with more than three live neighbours dies, as if by overpopulation. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. Remember the oscillator or blinker of 3 cells. You can also find this blinker on Wikipedia. 1 21 1 2 1 21 3. 4 6 4. 6. 4 8. 9 8 9 #1 #2. #3 5. Consider now these 3 creatures at stage 1: Show how they look like in the next two stages: stage 2 and stage 3. Explain how you get the answers Creature 1 Creature 2 Creature 3 (here creature 1 is the blinker of 3 cells, horizontally; creature 2 consists of two adjacent cells, creature 3 consists of 4 adjacent cells horiztonally) ww (d) Creature 1 (10%), (e) Creature 2 (8%), (f) Creature 3 (20%)
Question 4: The ongoing Covid pandemic in the word has scared the authorities at Hazrat Shahjalal International Airport in Dhaka and they have asked the CSE department of BRACU to design a system that would help them to decide what to do with people coming in from African countries that are at risk. The Airport authorities has approved the following specifications for the system: Input (4 variables) F = 1 indicates the passenger HAS FEVER. H = 0 indicates the passenger DOES NOT HAVE a SEVERE HEADACHE. M = 1 indicates the passenger HAS MUSCLE PAIN. A = 0 indicates the passenger DOES NOT HAVE ABDONIMAL (STOMACH) PAIN. Output (3 variables)
8. Consider the following: An online trading company wants to offer discounts to new customers. The company has recently emailed discount code to the customers. New customer must have a discount code to be eligible but returning customer are not eligible for a discount. Let A = Returning Customer B = Discount Code (a) Draw a truth table to represent when a customer has a discount. (b) From your truth table in (a) produce a Boolean expression to represent discounted customer (Q) for the trading company.
Jin Mori is like any other student who loves sleeping. Jin Taejin, his grandfather, imposes a waking schedule that Jin Mori must follow to avoid tardiness at his school. The schedule stated that on weekdays, Mori must be awake at "7:00" and at "10:00" at weekends. Taejin added an exemption for their school vacation. If it is their school vacation, the schedule is "10:00" for weekdays and "off" for weekends. If Jin will not follow the schedule, he is not allowed to practice his favorite martial art, taekwondo. Your job is to create a program that will serve as the alarm clock for Jin Mori. Expected Output: Test Case 1: Vacation: False Day: Monday Alarm Time: 7:00 Awake: Yes Be ready for your practice Mori! Test Case 2: (input) (input) (auto generated) (input) Vacation: False Day: Saturday Alarm Time: 10:00 Awake: No (input) (input) (auto generated) (input) You are not allowed to practice your taekwondo!
Implement Thirsty problem using semaphore. Write the code in C/C++ Scenario: To drink, a thirsty person must have three things; water, ice and a glass. There are three thirsty people, each having a different one (and only one) of the three required items. A fourth person, a server has unlimited supply of all three items. If nobody is drinking, the server places two of the three items (chosen at random) onto table. Thirsty person who can make a drink from those two items will pick them up and drink a glass of ice water. When done, thirsty person will notify the server and the process will repeat.
INTRODUCTION: Heat conduction from a cylindrical solid wall of a pipe can be determined by the follow T1-T2 q = 2nLk R2 In R. where: q is the computed heat conduction in Watts. k is the thermal conductivity of the pipe material in Watts/°C/m. L is the length of the pipe in cm. Ri is the inner radius of the pipe in cm. R2 is the outer radius of the pipe in cm. Ti is the internal temperature in °C. T2 is the external temperature in °C. ASSIGNMENT: Write a C program that will allow the user to enter the inner and outer radii of the pipe, the the internal and external temperatures. Once the user enters the input values, the program
Bus timetables specify to the second the exact arrival and departure time of each bus on each stop. You need to pay for the full fare of every bus you ride and different bus lines charge different fees , but they are flat fees (independent of distance travelled on the line) A travel plan is a sequence of stop-time pairs where stop is a location of a bus stop and time is when we arrive at that stop. The plan is feasible if for any two consecutive pairs (a, t) and (b, t′) in the plan there exists a bus that departs after t and arrives at b at exactly t′. That is, a travel plan does not allow us to walk between stops. Assuming that no two buses arrive at the same time at the same stop, a feasible plan uniquely identifies the bus lines that we need to take to realize the plan. The cost of the plan is the sum of the fares we need to pay. Your task is to design an efficient algorithm that given a departure time t, an arrival time t′, an origin stop a and a destination stop b, finds the…