Concept explainers
Explanation of Solution
a.
New copies of the book sold by the publisher each year:
Let,
The transition probability matrix “P” for the given problem is shown below:
NB | B1 | B2 | B3 | NSB | |
NB | 0 | 0.9 | 0 | 0 | 0.1 |
B1 | 0 | 0 | 0.8 | 0 | 0.2 |
B2 | 0 | 0 | 0 | 0.6 | 0.4 |
B3 | 0 | 0 | 0 | 0 | 1 |
For an organization in which each book is classified into one of “s” groups (here s= 4).
Let,
To determine
Here,
This implies,
Let steady state census for
Explanation of Solution
b.
Average profit per book:
The bookstore’s profit on each type of book is as given below:
If the steady-state census is the representative of the bookstore’s sales, the total profit on books is as follows:
Trending nowThis is a popular solution!
Chapter 17 Solutions
Operations Research : Applications and Algorithms
- Scenario:One of the renowned supermarket in Dhaka City, “Shwapno” is celebrating their firstanniversary of opening. They have become very popular among people in a short amount oftime. As a method of celebration they have designed three interesting and exciting offer for theircustomers for that day only!! The offers are described as follows:Offer 1: This offer says, if the name of any customer starts with “S” OR ends with “o”, theywill receive a gift which contains 1 kg miniket rice and 1 litre soyabean oil. This offer isdedicated from their name, Shwapno.Offer 2: This offer says, if one customer have taken products and his/her total product weightis less than 1.50 kg, then Shwapno will give all the products to the customer for free. If the totalweight is 1.50 kg or more, the customer will have to pay the full amount.Offer 3: This offer says, if a customer is aged less than 15, then he/she will receive chocolates.If aged 15 or more, then no gifts for the customer.Implementation:Create…arrow_forwardCorrect answer will be upvoted else downvoted. Computer science. street is developed as follows: the main line comprises of 1 tile; then, at that point, a1 lines follow; every one of these lines contains 1 tile more noteworthy than the past line; then, at that point, b1 columns follow; every one of these lines contains 1 tile not exactly the past line; then, at that point, a2 columns follow; every one of these lines contains 1 tile more noteworthy than the past line; then, at that point, b2 lines follow; every one of these columns contains 1 tile not exactly the past line; ... then, at that point, a lines follow; every one of these columns contains 1 tile more prominent than the past line; then, at that point, bn columns follow; every one of these lines contains 1 tile not exactly the past line. You start from the main tile in the primary line and need to arrive at the last line (any tile of it). From your present tile, you can move to any tile in the…arrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Computer science. player begins the game from the 1-st stage and should beat the stages in expanding request of the stage number. The player dominates the match in the wake of beating the n-th stage. There is all things considered one designated spot on each stage, and there is consistently a designated spot on the 1-st stage. Toward the start of the game, just the designated spot on the 1-st stage is initiated, and any remaining designated spots are deactivated. At the point when the player gets to the I-th stage that has a designated spot, that designated spot is initiated. For each attempt of a phase, the player can either beat the stage or bomb the stage. On the off chance that they beat the I-th stage, the player is moved to the i+1-st stage. On the off chance that they bomb the I-th stage, the player is moved to the latest designated spot they actuated, and they need to beat the stages after that designated spot once…arrow_forward
- You are given n users, and their times that they log in and out of a website: You are interested in which users are on the site at the same time. For example, you are given the following 5 users and their times: User 1- In: 1 Out: 4 User 2- In: 2 Out: 5 User 3- In: 7 Out: 8 User 4- In: 9 Out:10 User 5- In: 6 Out:10 This gives the distinct users that are on the site at the same time as (1,2), (4,5), and (3,5). Given n elements, write pseudocode for an algorithm that would take n^2 time to compute the number of pairs of users that are on the site at the same timearrow_forwardCorrect answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You found a new line of work as an advertiser in a pet shop, and your present errand is to support deals of feline food. One of the methodologies is to sell jars of food in loads with limits. Assume you chose to sell loads with a jars in a load with a rebate and some client needs to purchase x jars of feline food. Then, at that point, he follows a covetous methodology: he purchases ⌊xa⌋ loads with a markdown; then, at that point, he needs to purchase the leftover (xmoda) jars individually. ⌊xa⌋ is x separated by an adjusted down, xmoda is the remainer of x isolated by a. However, clients are insatiable as a rule, so assuming the client needs to purchase (xmoda) jars individually and it happens that (xmoda)≥a2 he chooses to purchase the entire bunch of a jars (rather than purchasing (xmoda) jars). It makes you, as an advertiser, cheerful since the client purchased more…arrow_forwardThe Monty Hall game is a statistical problem: there is a TV show (like the Monty Hall show) that allows contestants to choose between three doors, A, B, and C. Behind one of these doors is a new car (the winning door), and behind the other two are goats (the losing doors). After the contestant makes a choice, the game show host shows a goat behind one of the doors NOT chosen. The contestant is then given a choice to either switch to the other, non-opened door, or stick with their original guess. The interesting part of this “game" is the statistics involved –a person has a 1/3 chance of originally picking a winning door. The other door – that which is not revealed to have a goat but also was not originally chosen – actually has a 2/3 chance of being a winning door. Therefore, it is in the contestant's best interest to switch doors. You will create a program that simulates the Monty Hall game, where the computer plays the role of the host. The program must have no outputs, but 1) Ask…arrow_forward
- 6. The Jaccard coefficient between two sets {a, b, c, d, e, f, g} and {a, b, g, h, i, j} is: Group of answer choices 0.2 0.3 0.4 0.5arrow_forwardThe Monty Hall game is a statistical problem: there is a TV show (like the Monty Hall show) that allows contestants to choose between three doors, A, B, and C. Behind one of these doors is a new car (the winning door), and behind the other two are goats (the losing doors). After the contestant makes a choice, the game show host shows a goat behind one of the doors NOT chosen. The contestant is then given a choice to either switch to the other, non-opened door, or stick with their original guess. The interesting part of this “game" is the statistics involved-a person has a 1/3 chance of originally picking a winning door. The other door chosen – actually has a 2/3 chance of being a winning door. Therefore, it is in the contestant's best interest to switch doors. that which is not revealed to have a goat but also was not originally You will create a program that simulates the Monty Hall game, where the computer plays the role of the host. The program must have no outputs, but 1) Ask the…arrow_forwardA deck of cards contains 52 cards with four suits: club, diamond, heart and spade ranging in values from 2, ... to 10, Jack, Queen, King and Ace. Ace has the highest value in the same suit. Cards can be compared using the face value. A card with higher face value is bigger than a card with lower face value. If two cards have the same face value, then the suit determines the order. Club is smaller than diamond which is smaller than heart which is smaller than spade. For example: club 2 < diamond 2 < heart 2 < spade 2 if compared. Write an interactive Java program that allows a user to randomly pick a card from the deck of 52 cards (using a random number between 1 and 4 to represent the four suits: club, diamond, heart and spade and then another random number to represent the face value) to play. Show the suit and face value of the user card. Then the program acts as a card dealer which randomly draws another card and displays the card (again showing the suit and face value of…arrow_forward
- An arcade game player wants to climb to the top of the leaderboard and track their ranking. The game uses Dense Ranking, so its leaderboard works like this: The player with the highest score is ranked number on the leaderboard. Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number. Example The ranked players will have ranks , , , and , respectively. If the player's scores are , and , their rankings after each game are , and . Return . Function Description Complete the climbingLeaderboard function in the editor below. climbingLeaderboard has the following parameter(s): int ranked[n]: the leaderboard scores int player[m]: the player's scores Returns int[m]: the player's rank after each new score Input Format The first line contains an integer , the number of players on the leaderboard.The next line contains space-separated integers , the leaderboard scores in decreasing order.The next…arrow_forwardYou have a backpack that can carry at most 15 kg of stuff (following image). There are ten boxes of five types (A, B, C, D, and E), with two boxes of each type. The weights and values of the boxes are given in the figure. You want to select some of these boxes to put in your backpack in order to maximize their total value, but you cannot exceed the backpack’s weight capacity. Additionally,• if a type B box is selected, then no type C box can be selected• at least one box of either type A or type D must be selected Formulate an integer linear programming model to help you make the bag packing decision. To assist you, below are your decision variables.• yi: select (= 1) or not select (= 0) type i box, i = A, B, C, D, E.• xj: The number of type j boxes selected, j = A, B, C, D, E.arrow_forwardIn class this week, we will work on simulating the game of Yahtzee. In the game of Yahtzee, five dice are tossed, and various combinations of numbers, similar to poker hands, are assigned point values. In the game, dice can be selected and re-tossed, but we will focus on calculating the probabilities for the first toss only. We will also deal only with the "lower half" of the score card in the game. For the interested student, continuing this project to account for the complete rules of play would be an entertaining challenge. Anyone not familiar with Yahtzee should try a web search for the rules of the game. Some sites have applets that let you play online. All you really need to know for this lesson, though, is which combinations are counted. We will call these "hands," as the combinations in poker are called. The hands in Yahtzee are: Three of a Kind (three of one number and two others that are different) Full House (three of one number and two of another number) Four of a Kind…arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole