Error
There was an error loading the page.
Solving binary optimisation problems using Computational Packages
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
History
Musa Mammadov 1 year, 9 months ago
Published this.Musa Mammadov 4 years, 9 months ago
Created this as a copy of Musa's Duality 1.| Name | Status | Author | Last Modified | |
|---|---|---|---|---|
| Matrix Operations | draft | Marie Nicholson | 04/02/2021 15:44 | |
| Matrix Arithmetics | Ready to use | Timur Zaripov | 17/06/2022 09:37 | |
| Musa's copy of Matrix sum | draft | Musa Mammadov | 01/08/2022 08:15 | |
| Musa's copy of 3 Matrix sum | draft | Musa Mammadov | 27/06/2023 01:47 | |
| Musa's Duality 1 | draft | Musa Mammadov | 20/07/2023 01:49 | |
| Musa's Duality 2 | draft | Musa Mammadov | 20/07/2023 01:50 | |
| Musa's Duality 3 | draft | Musa Mammadov | 20/07/2023 01:50 | |
| Musa's Duality 4 | draft | Musa Mammadov | 20/07/2023 01:50 | |
| Musa's Duality 5 | draft | Musa Mammadov | 20/07/2023 01:51 | |
| Musa's Duality 6 | draft | Musa Mammadov | 20/07/2023 01:51 | |
| Musa's Duality 7 | draft | Musa Mammadov | 20/07/2023 01:51 | |
| Musa's Binary optimisation | draft | Musa Mammadov | 20/07/2023 01:53 | |
| Musa's Continuous optimisation | draft | Musa Mammadov | 20/07/2023 01:53 |
There are 34 other versions that do you not have access to.
| Name | Type | Generated Value |
|---|
| n | integer |
11
|
||||
| c1 | vector |
Vector with 11 components
|
||||
| A | matrix |
Matrix of size 5×11
|
||||
| li1 | vector |
Vector with 11 components
|
||||
| mm | string |
Minimize
|
||||
| li2 | vector |
vector(1,4,0,3,1,3,3,0,0,3,2)
|
||||
| li3 | vector |
vector(-2,5,2,5,5,5,5,4,5,2,2)
|
||||
| li4 | vector |
Vector with 11 components
|
||||
| li5 | vector |
Vector with 11 components
|
||||
| bb | vector |
Vector with 11 components
|
||||
| b1 | number |
10.2
|
||||
| x0 | vector |
vector(1,1,0,1,1,0,1,0,1,0,1)
|
||||
| b2 | number |
14.2
|
||||
| b3 | number |
25.3
|
||||
| b4 | number |
15.4
|
||||
| b5 | number |
18.1
|
||||
| fv | number |
11
|
||||
| c11 | matrix |
Matrix of size 1×11
|
||||
| bbb | matrix |
Matrix of size 1×5
|
||||
| code1 | number |
3
|
||||
| code2 | number |
1
|
||||
| code3 | number |
5
|
||||
| code4 | number |
4
|
||||
| code5 | number |
0
|
||||
| code6 | number |
1
|
||||
| code7 | number |
3
|
Generated value: integer
11
→ Used by:
- bb
- c1
- li1
- li2
- li3
- li4
- li5
- x0
This variable doesn't seem to be used anywhere.
Parts
Gap-fill
Ask the student a question, and give any hints about how they should answer this part.
P−{code1}{code2}{code3}{code4}{code5}{code6}{code7}
Solve the following binary optimisation problem using Computational Packages.
{mm}: cx
Subject to: Ax≤b, xi∈{0,1}
where
c = {c11}
b = {bbb}
A = {A}
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).
- Solve the problem by using any Computational Packages.
- Submit the above pdf, your code and your optimal solution (optimal x and objevtive function value cx that is expected to be ≤{fv}) as part of your related OnTrack task.
Use this tab to check that this question works as expected.
| Part | Test | Passed? |
|---|---|---|
| Gap-fill | ||
| Hasn't run yet |
This question is used in the following exam: