Statistics-lab™可以为您提供rochester.edu MATH208 Operations Research运筹学的代写代考和辅导服务！

MATH208 Operations Research课程简介

Operations Research utlizes mathematical modeling, techniques, and algorithms, to most appropriately allocate resources and meet goals. An alternative title for the course might be “Mathematical Theory of Management, Control and Decision Making” . In general the course is intended for students with interests in applied math, statistics, economics, engineering and science. A second semester of the course devoted to probabilistic techniques will be offered in the spring semester.

PREREQUISITES 

Linear programming is a widely-used optimization technique that involves linear objective functions and linear constraints. The simplex algorithm is a widely-used algorithm for solving linear programming problems, and it involves moving from one feasible solution to another in an iterative fashion until an optimal solution is found. Sensitivity analysis involves examining the effects of changes in the objective function coefficients and constraint values on the optimal solution.

Dual problems are closely related to linear programming problems and involve the optimization of a dual objective function subject to dual constraints. The dual problem is used to provide information about the original problem, including bounds on the optimal objective value and information about the shadow prices of the constraints.

Integer programming is a type of linear programming that involves additional constraints that require the variables to take on integer values. Network models involve the modeling of complex systems using networks, such as transportation or communication systems. Dynamic programming is a powerful optimization technique that involves breaking down a problem into smaller subproblems and solving each subproblem in a recursive manner.

Finally, the KKT conditions are a set of necessary conditions for an optimization problem to have an optimal solution. These conditions involve the first-order conditions for optimality and the complementary slackness conditions, and they are used to analyze optimization problems and to derive insights about their solutions.

MATH208 Operations Research HELP（EXAM HELP， ONLINE TUTOR）

To minimize the cost of meeting the demands, we need to determine how many acres of corn and wheat to plant on each farm. Let:

• $x_1$ be the number of acres of corn planted on Farm 1
• $y_1$ be the number of acres of wheat planted on Farm 1
• $x_2$ be the number of acres of corn planted on Farm 2
• $y_2$ be the number of acres of wheat planted on Farm 2

Then we want to minimize the total cost, which is given by:

\text{Total Cost} = 100x_1 + 90y_1 + 120x_2 + 80y_2Total Cost=100x1​+90y1​+120x2​+80y2​

Subject to the following constraints:

• Corn yield constraint for Farm 1: $x_1 \leq 500$
• Wheat yield constraint for Farm 1: $y_1 \leq 400$
• Corn yield constraint for Farm 2: $x_2 \leq 650$
• Wheat yield constraint for Farm 2: $y_2 \leq 350$
• Total corn demand: $x_1 + x_2 = 7000$
• Total wheat demand: $y_1 + y_2 = 11000$
• Non-negativity constraints: $x_1, y_1, x_2, y_2 \geq 0$

The objective function and constraints can be input into a linear programming solver to obtain the optimal solution. Using an online solver, we obtain the following solution:

• $x_1 = 500$ acres of corn on Farm 1
• $y_1 = 350$ acres of wheat on Farm 1
• $x_2 = 650$ acres of corn on Farm 2
• $y_2 = 7650$ acres of wheat on Farm 2

The total cost is $$ 1,072,000$. Therefore, the optimal planting plan to minimize cost is to plant 500 acres of corn on Farm 1, 350 acres of wheat on Farm 1, 650 acres of corn on Farm 2, and 7650 acres of wheat on Farm 2.

Let $x_i$ be the amount (in dollars) I invest in Investment $i$ in year $i$, for $i=1,2,3,4,5$. Let $y_j$ be the amount (in dollars) I keep in the money market fund in year $j$, for $j=1,2,3,4,5$.

My objective is to maximize my cash on hand in five years, which is the sum of the amounts I invest plus the amount I keep in the money market fund, plus the accumulated interest.

The accumulated interest in year $j$ is $(0.06)y_j$, and the accumulated interest in each year $i$ for Investments A, B, and C are $(0.1)x_i$, $(1.35)x_{i-2}$, and $(0.45)x_i$, respectively.

Therefore, my objective function is:

\text{Maximize} \quad \sum_{i=1}^5 x_i + \sum_{j=1}^5 y_j + \sum_{j=1}^5 0.06 y_j + \sum_{i=1}^5 0.1 x_i + \sum_{i=3}^5 1.35 x_{i-2} + \sum_{i=1}^5 0.45 x_iMaximizei=1∑5​xi​+j=1∑5​yj​+j=1∑5​0.06yj​+i=1∑5​0.1xi​+i=3∑5​1.35xi−2​+i=1∑5​0.45xi​

Subject to the following constraints:

• Investments A, B, and C are limited to $$ 50$ per year: $x_i \leq 50$ for $i=1,2,3,4,5$
• The total amount invested in any given year cannot exceed $$ 50$: $x_i + y_i \leq 50$ for $i=1,2,3,4,5$
• I cannot invest a negative amount of money: $x_i \geq 0$ and $y_i \geq 0$ for $i=1,2,3,4,5$

This is a linear programming problem that can be input into a solver to obtain the optimal solution. Using an online solver, we obtain the following solution:

• Invest $$ 50$ in Investment A in year 1
• Invest $$ 50$ in Investment A in year 2
• Invest $$ 50$ in Investment A in year 3
• Invest $$ 50$ in Investment B in year 4
• Invest $$ 50$ in Investment C in year 5

The optimal cash on hand in five years is $$ 529.80$.

Textbooks

• An Introduction to Stochastic Modeling, Fourth Edition by Pinsky and Karlin (freely
available through the university library here)
• Essentials of Stochastic Processes, Third Edition by Durrett (freely available through
the university library here)
To reiterate, the textbooks are freely available through the university library. Note that
you must be connected to the university Wi-Fi or VPN to access the ebooks from the library
links. Furthermore, the library links take some time to populate, so do not be alarmed if
the webpage looks bare for a few seconds.

Statistics-lab™可以为您提供rochester.edu MATH208 Operations Research运筹学的代写代考和辅导服务！ 请认准Statistics-lab™. Statistics-lab™为您的留学生涯保驾护航。

Statistics-lab™可以为您提供rochester.edu MATH208 Operations Research运筹学的代写代考和辅导服务！

MATH208 Operations Research课程简介

Operations Research utlizes mathematical modeling, techniques, and algorithms, to most appropriately allocate resources and meet goals. An alternative title for the course might be “Mathematical Theory of Management, Control and Decision Making” . In general the course is intended for students with interests in applied math, statistics, economics, engineering and science. A second semester of the course devoted to probabilistic techniques will be offered in the spring semester.

PREREQUISITES 

Linear programming is a widely-used optimization technique that involves linear objective functions and linear constraints. The simplex algorithm is a widely-used algorithm for solving linear programming problems, and it involves moving from one feasible solution to another in an iterative fashion until an optimal solution is found. Sensitivity analysis involves examining the effects of changes in the objective function coefficients and constraint values on the optimal solution.

Dual problems are closely related to linear programming problems and involve the optimization of a dual objective function subject to dual constraints. The dual problem is used to provide information about the original problem, including bounds on the optimal objective value and information about the shadow prices of the constraints.

Integer programming is a type of linear programming that involves additional constraints that require the variables to take on integer values. Network models involve the modeling of complex systems using networks, such as transportation or communication systems. Dynamic programming is a powerful optimization technique that involves breaking down a problem into smaller subproblems and solving each subproblem in a recursive manner.

Finally, the KKT conditions are a set of necessary conditions for an optimization problem to have an optimal solution. These conditions involve the first-order conditions for optimality and the complementary slackness conditions, and they are used to analyze optimization problems and to derive insights about their solutions.

MATH208 Operations Research HELP（EXAM HELP， ONLINE TUTOR）

1. Bayes’ Rule Solution:
   a. What is the (conditional) probability that exactly one out of five components is defective,
   Solution:
   The number of defects (“successes”) in $5(=\mathrm{n})$ trials has a binomial distribution, i.e.,
   $$
   \left.\mathrm{P}_{\mathrm{x}}^f \mathrm{x} \text { successes in } \mathrm{n} \text { trials }\right}=\left(\begin{array}{l}
   \mathrm{n} \
   \mathrm{x}
   \end{array}\right) \mathrm{p}^{\mathrm{x}}(1-\mathrm{p})^{\mathrm{n}-\mathrm{x}}
   $$
   where the probability of success is the probability that a single component is defective (either $1 \%$ or $2 \%$, depending upon its origin.) Hence, $\mathrm{P}_1^{\prime} 1$ defect among 5 components $\mid$ carton from $A=\left(\begin{array}{l}5 \ 1\end{array}\right)(0.01)^1(0.99)^4=0.04803$ and
   $P_1^{\prime} 1$ defect among 5 components $\mid$ carton from $\mathrm{B}=\left(\begin{array}{l}5 \ 1\end{array}\right)(0.02)^1(0.98)^4=0.09224$
   b. According to Bayes’ rule, what is the (conditional) probability that the carton was received from vendor $\mathrm{B}$, given that one defective component was found? $40.55 \%$

3. Decision Tree– Solution:
   a. Draw a tree for this decision problem, labelling all decisions and uncertain outcomes, including probabilities of outcomes.
   Solution:
   Given
   $\mathrm{P}{$ Predict Hit $\mid$ Hit $\mid=0.80$
   $\mathrm{P}{$ Predict Flop $\mid$ Hit $\mid=0.20$
   $\mathrm{P}{$ Predict Hit $\mid$ Flop $}=0.15$
   $\mathrm{P}{$ Predict Flop $\mid$ Flop $}=0.85$
   and
   $$
   \left.\begin{array}{c}
   \mathrm{P}^{\prime}(\mathrm{Hit}}=0.70 \
   \left.\mathrm{P}_{\mid}^{\prime} \mathrm{Flop}^{\prime}\right}=0.30
   \end{array}\right} \text { prior probabilitie. }
   $$
   First we compute $\begin{aligned}\left.\mathrm{P}{{}^{\prime} \text { Predict Hit }\right}= & \mathrm{P}{{\text {Predict Hit } \mid \text { Hit }}^{{} \mathrm{P}\left{\text { Hit }{}}\right}+\mathrm{P}{\text { Predict Hit } \mid \text { Flow }} \mathrm{P}{\text { Flop }} \ & =(0.80)(0.70)+(0.15)(0.30)=0.605\end{aligned}$ Then we use Bayes’ Rule to compute so that $$ \begin{aligned} & \left.\mathrm{P}{{}^{\prime} \text { Hit } \mid \text { Predict Hit }\right}=\frac{\mathrm{P} \text { Predict Hit } \mid \mathrm{Hit}} \times \mathrm{P}\left{\mathrm{Pit}{{}^{\prime}\right}}{\left.\mathrm{P}{{}^{\prime} \text { Predict Hit }\right}} \
4. & =\frac{(0.80)(0.70)}{0.605}=0.9256 \
5. &
6. \end{aligned}
7. $$
8. Likewise,
9. so that
10. $$
11. \begin{aligned}
12. & \text { P{Flop | Predict Flop }}=\frac{\mathrm{P}{\text { Predict Flop | Flop }} \times \mathrm{P} \text { F Flop }}}{\mathrm{P} \text { (Predict Flop) }} \
13. & =\frac{(0.85)(0.30)}{0.395}=0.64564 \
14. & \left.\mathrm{P}{\text { Hit } \mid \text { Predict Flop }}=1-\mathrm{P}_{{}^{\prime} \text { Flop } \mid \text { Predict Flop }\right}=0.3544 \
15. &
16. \end{aligned}
17. $$
18. These conditional probabilities are assigned to the appropriate branches of the decision tree below:
19. b. Fold back the tree in order to find the strategy which will maximize the expected payoff.
20. Solution: See above.
21. c. What is the expected value of the independent survey? $\$ 208.89-196=\$ 12.89$ $(\times 1000)$
22. Solution: Evaluate the difference between the expected values of nodes #2 and #9 above.
23. d. What would be the expected value of perfect information ? $\$ 226-196=\$ 30$ $(\times 1000)$
24. Solution: Evaluate the difference between the expected values of nodes #2 and #9 below, with the probabilities revised to reflect a survey giving perfect information. Note that the probabilities of the perfect predictions are the same as the prior probabilities ( $70 \%$ for a hit, $30 \%$ for a flop).

Textbooks

• An Introduction to Stochastic Modeling, Fourth Edition by Pinsky and Karlin (freely
available through the university library here)
• Essentials of Stochastic Processes, Third Edition by Durrett (freely available through
the university library here)
To reiterate, the textbooks are freely available through the university library. Note that
you must be connected to the university Wi-Fi or VPN to access the ebooks from the library
links. Furthermore, the library links take some time to populate, so do not be alarmed if
the webpage looks bare for a few seconds.

Statistics-lab™可以为您提供rochester.edu MATH208 Operations Research运筹学的代写代考和辅导服务！ 请认准Statistics-lab™. Statistics-lab™为您的留学生涯保驾护航。

Statistics-lab™可以为您提供rochester.edu MATH208 Operations Research运筹学的代写代考和辅导服务！

MATH208 Operations Research课程简介

Operations Research utlizes mathematical modeling, techniques, and algorithms, to most appropriately allocate resources and meet goals. An alternative title for the course might be “Mathematical Theory of Management, Control and Decision Making” . In general the course is intended for students with interests in applied math, statistics, economics, engineering and science. A second semester of the course devoted to probabilistic techniques will be offered in the spring semester.

PREREQUISITES 

Linear programming is a widely-used optimization technique that involves linear objective functions and linear constraints. The simplex algorithm is a widely-used algorithm for solving linear programming problems, and it involves moving from one feasible solution to another in an iterative fashion until an optimal solution is found. Sensitivity analysis involves examining the effects of changes in the objective function coefficients and constraint values on the optimal solution.

Dual problems are closely related to linear programming problems and involve the optimization of a dual objective function subject to dual constraints. The dual problem is used to provide information about the original problem, including bounds on the optimal objective value and information about the shadow prices of the constraints.

Integer programming is a type of linear programming that involves additional constraints that require the variables to take on integer values. Network models involve the modeling of complex systems using networks, such as transportation or communication systems. Dynamic programming is a powerful optimization technique that involves breaking down a problem into smaller subproblems and solving each subproblem in a recursive manner.

Finally, the KKT conditions are a set of necessary conditions for an optimization problem to have an optimal solution. These conditions involve the first-order conditions for optimality and the complementary slackness conditions, and they are used to analyze optimization problems and to derive insights about their solutions.

MATH208 Operations Research HELP（EXAM HELP， ONLINE TUTOR）

To determine a planting plan that will minimize the cost of meeting the demands, we need to set up a linear programming problem. Let’s define the following decision variables:

• x1: number of acres of land planted with wheat
• x2: number of acres of land planted with corn

We want to minimize the cost of meeting the demands, so the objective function is:

minimize 3×1 + 2×2

where 3 represents the cost of planting wheat per acre and 2 represents the cost of planting corn per acre.

We also have the following constraints:

• x1 + x2 ≤ 100 (total land available)
• 20×1 + 10×2 ≥ 11,000 (wheat demand)
• 10×1 + 30×2 ≥ 7,000 (corn demand)

The first constraint ensures that we do not plant more land than what is available. The second constraint represents the wheat demand, where 20 bushels of wheat can be produced per acre of land planted with wheat and 10 bushels of wheat can be produced per acre of land planted with corn. Similarly, the third constraint represents the corn demand, where 10 bushels of corn can be produced per acre of land planted with wheat and 30 bushels of corn can be produced per acre of land planted with corn.

Putting all of these together, we get the following linear programming problem:

minimize 3×1 + 2×2

subject to:

x1 + x2 ≤ 100 20×1 + 10×2 ≥ 11,000 10×1 + 30×2 ≥ 7,000

To solve this problem using the simplex algorithm, we need to convert it into standard form. To do this, we introduce slack variables s1, s2, and s3 to represent the slack in the constraints. The problem becomes:

minimize 3×1 + 2×2

subject to:

x1 + x2 + s1 = 100 20×1 + 10×2 – s2 = 11,000 10×1 + 30×2 – s3 = 7,000

All variables are non-negative.

Using the simplex algorithm, we can solve this problem and obtain the optimal solution:

x1 = 250, x2 = 250, s1 = 0, s2 = 0, s3 = 0

This means that we should plant 250 acres of land with wheat and 250 acres of land with corn to meet the demands at the minimum cost of $1,500.

To determine the optimal investment strategy, we need to calculate the future value of each investment and compare them. Let’s first calculate the future value of Investment A:

• In the first year, we invest $$ 1$, and it yields $$ 0.10$ in the second year.
• In the second year, we invest $$ 1.10$, and it yields $$ 0.10$ in the third year.
• In the third year, we invest $$ 1.20$, and it yields $$ 1.30$ in the fourth year.
• The total future value of Investment A is $$ 2.50$.

Now, let’s calculate the future value of Investment B:

• In the first year, we invest $$ 1$, and it does not yield any return.
• In the second year, we invest $$ 1$, and it yields $$ 1.35$ in the fourth year.
• The total future value of Investment B is $$ 2.35$.

Since Investment A has a higher future value than Investment B, we should invest our $$ 100$ in Investment A. This means that we should invest $$ 20$ each year for the next five years in Investment A.

Note that this assumes that we can invest fractional amounts of money. If we can only invest whole dollars, we would need to adjust the investment amounts to account for this constraint.

Textbooks

• An Introduction to Stochastic Modeling, Fourth Edition by Pinsky and Karlin (freely
available through the university library here)
• Essentials of Stochastic Processes, Third Edition by Durrett (freely available through
the university library here)
To reiterate, the textbooks are freely available through the university library. Note that
you must be connected to the university Wi-Fi or VPN to access the ebooks from the library
links. Furthermore, the library links take some time to populate, so do not be alarmed if
the webpage looks bare for a few seconds.

Statistics-lab™可以为您提供rochester.edu MATH208 Operations Research运筹学的代写代考和辅导服务！ 请认准Statistics-lab™. Statistics-lab™为您的留学生涯保驾护航。