49928: Design Optimisation for Manufacturing
Individual Assignment 2: Discrete Optimisation
Due: 11:59 pm Friday 12/06/2020
Solve the following two problems with both exhaustive enumeration and branch and
bound
The assignment is worth 20 marks in total (20% of your final mark for the subject)
| | Exhaustive enumeration is worth 4 marks for each problem, branch and bound is worth 6 marks for each problem. Problem 1 is a mixed integer linear optimisation problem (the problem has both discrete and continuous variables). Do not use intlinprog (from MATLAB) to solve this |
| |
problem, for exhaustive enumeration solve it by enumerating through the discrete
variables and then use linprog to find the continuous variables. For branch and
bound use linprog or Excel Solver (Simplex LP) to find the partial solutions.
| | Problem 2 is a discrete nonlinear optimisation problem. For branch and bound use fmincon or Excel Solver (GRG Nonlinear) to find the partial solutions. |
Write a report including all of the followings:
Describe the process of finding the solution: how many evaluations were
needed for exhaustive enumeration? What path did the search take for
branch and bound? How many partial and full evaluations were needed for
branch and bound?
Include your MATLAB code for exhaustive enumeration
Include any code or an image of any spreadsheets used for branch and
bound
Draw the trees for branch and bound. For each node state:
■ Which variables are constrained
■ The partial or full solution
■ Whether or not the solution is feasible
■ Whether or not the node has been pruned
Problem 1 (10 marks)
Minimise:
The post 49928: Design Optimisation for Manufacturing appeared first on My Assignment Online.
