MY-ASSIGNMENTEXPERT™可以为您提供 handbook MTH3330 Operations research运筹学的代写代考和辅导服务！
这是莫纳什大学 运筹学的代写成功案例。
MATH3330课程简介
This unit introduces some of the fundamental methods from operations research and computational mathematics for continuous optimisation problems. A range of such optimisation problems arise in economics, engineering, finance, business, data science and many other application areas. You will receive an introduction to the mathematical theory of continuous optimisation with a focus on linear programming methods and smooth non-linear programming. This will broadly include duality theory, the simplex method for linear programming, network optimisation and iterative methods for unconstrained nonlinear optimisation. You will also learn to implement the computational methods efficiently, how to test their implementations for accuracy and performance, and to interpret the results. You will work on optimisation models for applications in a variety of fields. Applications may include examples of supply chain optimisation, economic modelling (including shadow prices), product mix optimisation, portfolio optimisation, parameter estimation and machine learning.
Prerequisites
Enrolment Rule
keyboard_arrow_down
PREREQUISITE: You must have passed one of MTH2051 or MTH3051 or if you are enrolled in the Bachelor of Applied Data Science MTH2019 or both of (MTH2010 or MTH2015) and (MTH2021 or MTH2025) or if you are enrolled in the Honours of Econometrics, ETC2440 (this requires manual enrolment).
Alternatively you must be enrolled in the Master of Financial Mathematics, the Master of Mathematics, or receive special permission from the unit coordinator.
MTH3330 Operations research HELP（EXAM HELP， ONLINE TUTOR）
Solve the following knapsack problem:
$$
\begin{aligned}
& \operatorname{maximise} \quad 3 x_1+7 x_2+12 x_3 \
& \text { subject to } \
& 2 x_1+4 x_2+5 x_3 \leq 16 \
& x_1, x_2, x_3 \geq 0 \text { and integer. }
\end{aligned}
$$
Q2 A county chairwoman of a certain political party is making plans for an upcoming presidential election. She has received the services of 10 volunteer workers for precinct work and wants to assign them to five precincts in such a way as to maximize their effectiveness. She feels that it would be inefficient to assign a worker to more than one precinct, but she is willing to assign no workers to any one of the precincts if they can accomplish more in other precincts.
The following table gives the estimated increase in the number of votes for the party’s candidate in each precinct if it were allocated the various number of workers.
Use dynamic programming to find all solutions to the problem of maximising votes.
Q3 Give a recurrence to solve the one item production problem when orders can be delayed by at most two periods.
Q4 Consider the NLP
$$
\begin{array}{cl}
\max & x_1-x_2 \
\text { s.t. } & x_1^2+x_2^2 \leq 4 \
& x_1^2+\left(x_2+2\right)^2 \geq 4 .
\end{array}
$$
(a) Write down its KKT condition.
(b) Show that $(\sqrt{3},-1)$ satisfies the KKT condition.
(c) Show that $(2,0)$ violates the KKT condition.
MY-ASSIGNMENTEXPERT™可以为您提供 HANDBOOK MATH3202 OPERATIONS RESEARCH运筹学的代写代考和辅导服务！
