Error
There was an error loading the page.
This question tests the student's ability to model and solve Integer Programming problems by Branch and bound method
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
History
Julien Ugon was given access to the Musa's copy SIT316 Week 7 - Branch and Bound for integer programming V2 1 year, 8 months ago
Musa Mammadov 1 year, 8 months ago
Published this.Musa Mammadov 3 years, 8 months ago
Created this as a copy of Musa's copy SIT316 Week 7 - Branch and Bound for integer programming.There are 88 other versions that do you not have access to.
| Name | Type | Generated Value |
|---|
| kx | number |
27
|
||||
| ky | integer |
20
|
||||
| k1 | number |
0.75
|
||||
| k22 | number |
0.75
|
||||
| k2 | number |
2.4
|
||||
| k11 | integer |
3
|
||||
| s | number |
33.15
|
||||
| a | integer |
9
|
||||
| b | integer |
13
|
||||
| ss | number |
48
|
||||
| fsol | number |
510
|
||||
| xsol | integer |
10
|
||||
| ysol | integer |
12
|
| Name | Type | Generated Value |
|---|
Generated value: number
27
→ Used by:
- fsol
- xsol
- ysol
- "Unnamed part" - prompt
- "Unnamed part" → "Unnamed gap" - Minimum accepted value
- "Unnamed part" → "Unnamed gap" - Maximum accepted value
Gap-fill
Ask the student a question, and give any hints about how they should answer this part.
Solve the following Integer Programming problem by Branch and Bound Maximization method.
Maximize: {{kx}x+{ky}y}
Subject to
{20{k2}x+20{k1}y}≤{20s}
{20{k22}x+20{k11}y}≤{20ss}
x,y≥0 and integers
Submitting your results:
- Click on "End Exam" and "Print this results summary" (your problem will be extracted as a pdf file with all the necessary information/data). Do not worry about the "Total 0/0 (0%)" score, this pdf is only for generating a LP problem {k1}{fsol}{xsol}{ysol}).
- Solve the problem by "Branch and Bound Maximization" method by hand, for example, as in the examples included in "Knowledge Reinforcement".
- This methods requires solving some Continuous optimisation problem at each step. You can use any Computational Packages for finding optimal solution to these continous optimisation problems and do not need to include your code (just use the output-solution); or alternatively, you can solve them by geometric method by hand.
Use this tab to check that this question works as expected.
| Part | Test | Passed? |
|---|---|---|
| Gap-fill | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet |
This question is used in the following exam: