solve this graph therory problem Draw an example of each of the following on at least 3 vertices, or state it cannot exist. Brieflyjustify your answers. Bonus points for interesting examples.(a) A pseudograph with both an eulerian circuit and a Hamilton cycle(b) A regular pseudograph with both an eulerian circuit and a Hamilton path, but no Hamiltoncycle(c) A pseudograph with both an eulerian trail and a Hamilton path, but no eulerian circuitor Hamilton cycle(d) A pseudograph with an eulerian trail and an odd number of edges(e) A graph (not a pseudograph) with two Hamilton cycles that don't share any edges

a)Example: A triangle with a loop on one of the vertices.Justification:Eulerian Circuit: All…

Answered: Draw an example of each of the…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter12: Queueing Models

Section12.5: Analytic Steady-state Queueing Models

Problem 13P

See similar textbooks

Similar questions

In this version of dice blackjack, you toss a single die repeatedly and add up the sum of your dice tosses. Your goal is to come as close as possible to a total of 7 without going over. You may stop at any time. If your total is 8 or more, you lose. If your total is 7 or less, the house then tosses the die repeatedly. The house stops as soon as its total is 4 or more. If the house totals 8 or more, you win. Otherwise, the higher total wins. If there is a tie, the house wins. Consider the following strategies: Keep tossing until your total is 3 or more. Keep tossing until your total is 4 or more. Keep tossing until your total is 5 or more. Keep tossing until your total is 6 or more. Keep tossing until your total is 7 or more. For example, suppose you keep tossing until your total is 4 or more. Here are some examples of how the game might go: You toss a 2 and then a 3 and stop for total of 5. The house tosses a 3 and then a 2. You lose because a tie goes to the house. You toss a 3 and then a 6. You lose. You toss a 6 and stop. The house tosses a 3 and then a 2. You win. You toss a 3 and then a 4 for total of 7. The house tosses a 3 and then a 5. You win. Note that only 4 tosses need to be generated for the house, but more tosses might need to be generated for you, depending on your strategy. Develop a simulation and run it for at least 1000 iterations for each of the strategies listed previously. For each strategy, what are the two values so that you are 95% sure that your probability of winning is between these two values? Which of the five strategies appears to be best?
The Tinkan Company produces one-pound cans for the Canadian salmon industry. Each year the salmon spawn during a 24-hour period and must be canned immediately. Tinkan has the following agreement with the salmon industry. The company can deliver as many cans as it chooses. Then the salmon are caught. For each can by which Tinkan falls short of the salmon industrys needs, the company pays the industry a 2 penalty. Cans cost Tinkan 1 to produce and are sold by Tinkan for 2 per can. If any cans are left over, they are returned to Tinkan and the company reimburses the industry 2 for each extra can. These extra cans are put in storage for next year. Each year a can is held in storage, a carrying cost equal to 20% of the cans production cost is incurred. It is well known that the number of salmon harvested during a year is strongly related to the number of salmon harvested the previous year. In fact, using past data, Tinkan estimates that the harvest size in year t, Ht (measured in the number of cans required), is related to the harvest size in the previous year, Ht1, by the equation Ht = Ht1et where et is normally distributed with mean 1.02 and standard deviation 0.10. Tinkan plans to use the following production strategy. For some value of x, it produces enough cans at the beginning of year t to bring its inventory up to x+Ht, where Ht is the predicted harvest size in year t. Then it delivers these cans to the salmon industry. For example, if it uses x = 100,000, the predicted harvest size is 500,000 cans, and 80,000 cans are already in inventory, then Tinkan produces and delivers 520,000 cans. Given that the harvest size for the previous year was 550,000 cans, use simulation to help Tinkan develop a production strategy that maximizes its expected profit over the next 20 years. Assume that the company begins year 1 with an initial inventory of 300,000 cans.

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS