1) At the beginning of each week, a machine is either running or broken down. If the machine runs throughout the week, it earns a revenue of $100. If the machine breaks down during a week, it earns no revenue for that week. If the machine is running at the beginning of the week, it has a 75% chance of breaking down during that week. We may either do nothing or perform maintenance or replace the machine. If maintenance is performed the chances of a breakdown reduce to 25%. Maintenance costs is $20. Replacing the machine with a new one costs $80 but the new machine is guaranteed to run throughout the first week of its operation, If the machine breaks down during a week, it must be repaired or replaced at the beginning of the following week. Repairing a machine, costs $40 and the probability that a repaired machine will break down during the week is %25. Maintenance, repair, and replacement occur instantaneously, meaning that these actions take an instant and the machine starts working for the week immediately. Use dynamic programming to determine a repair, replacement, and maintenance policy that maximizes the expected net profit earned over a three-week period. Assume that the machine is running at the beginning of the first week. Write down how you define the stages, the states, and the decisions clearly. Express the optimal
1) At the beginning of each week, a machine is either running or broken down. If the machine runs throughout the week, it earns a revenue of $100. If the machine breaks down during a week, it earns no revenue for that week. If the machine is running at the beginning of the week, it has a 75% chance of breaking down during that week. We may either do nothing or perform maintenance or replace the machine. If maintenance is performed the chances of a breakdown reduce to 25%. Maintenance costs is $20. Replacing the machine with a new one costs $80 but the new machine is guaranteed to run throughout the first week of its operation, If the machine breaks down during a week, it must be repaired or replaced at the beginning of the following week. Repairing a machine, costs $40 and the probability that a repaired machine will break down during the week is %25. Maintenance, repair, and replacement occur instantaneously, meaning that these actions take an instant and the machine starts working for the week immediately. Use dynamic programming to determine a repair, replacement, and maintenance policy that maximizes the expected net profit earned over a three-week period. Assume that the machine is running at the beginning of the first week. Write down how you define the stages, the states, and the decisions clearly. Express the optimal
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![1) At the beginning of each week, a machine is either running or broken down. If the machine runs
throughout the week, it earns a revenue of $100. If the machine breaks down during a week, it
earns no revenue for that week.
If the machine is running at the beginning of the week, it has a 75% chance of breaking down during
that week. We may either do nothing or perform maintenance or replace the machine. If
maintenance is performed the chances of a breakdown reduce to 25%. Maintenance costs is $20.
Replacing the machine with a new one costs $80 but the new machine is guaranteed to run
throughout the first week of its operation.
If the machine breaks down during a week, it must be repaired or replaced at the beginning of the
following week. Repairing a machine, costs $40 and the probability that a repaired machine will
break down during the week is %25.
Maintenance, repair, and replacement occur instantaneously, meaning that these actions take an
instant and the machine starts working for the week immediately.
Use dynamic programming to determine a repair, replacement, and maintenance policy that
maximizes the expected net profit earned over a three-week period. Assume that the machine is
running at the beginning of the first week.
Write down how you define the stages, the states, and the decisions clearly. Express the optimal
strategy explicitly.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F83d1c182-9a08-4684-8a1a-1c08a44c5272%2F5cf99ba6-a55c-411e-9037-2e518f91446a%2Ftejuek_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1) At the beginning of each week, a machine is either running or broken down. If the machine runs
throughout the week, it earns a revenue of $100. If the machine breaks down during a week, it
earns no revenue for that week.
If the machine is running at the beginning of the week, it has a 75% chance of breaking down during
that week. We may either do nothing or perform maintenance or replace the machine. If
maintenance is performed the chances of a breakdown reduce to 25%. Maintenance costs is $20.
Replacing the machine with a new one costs $80 but the new machine is guaranteed to run
throughout the first week of its operation.
If the machine breaks down during a week, it must be repaired or replaced at the beginning of the
following week. Repairing a machine, costs $40 and the probability that a repaired machine will
break down during the week is %25.
Maintenance, repair, and replacement occur instantaneously, meaning that these actions take an
instant and the machine starts working for the week immediately.
Use dynamic programming to determine a repair, replacement, and maintenance policy that
maximizes the expected net profit earned over a three-week period. Assume that the machine is
running at the beginning of the first week.
Write down how you define the stages, the states, and the decisions clearly. Express the optimal
strategy explicitly.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 7 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education