Error
There was an error loading the page.
This question tests the student's ability to solve Linear Programming problems by hand using the Simplex 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 SIT316 MO-Simplex Method-2 1 year, 8 months ago
Musa Mammadov 1 year, 8 months ago
Published this.Musa Mammadov 3 years, 7 months ago
Created this as a copy of Musa's SIT316 MO-Simplex Method.There are 88 other versions that do you not have access to.
| Name | Type | Generated Value |
|---|
| a1 | integer |
1
|
||||
| b1 | integer |
1
|
||||
| a2 | integer |
10
|
||||
| b2 | integer |
13
|
||||
| a3 | integer |
16
|
||||
| b3 | integer |
9
|
||||
| c11 | integer |
12
|
||||
| c12 | integer |
-9
|
||||
| c1 | integer |
3
|
||||
| c2 | integer |
-118
|
||||
| c3 | integer |
-7
|
||||
| c21 | integer |
-4
|
||||
| c22 | integer |
-6
|
||||
| c31 | integer |
8
|
||||
| c32 | integer |
-15
|
||||
| i | integer |
1
|
||||
| x22 | list |
[ 1, 10, 16 ]
|
||||
| x2 | integer |
10
|
||||
| y22 | list |
[ 1, 13, 9 ]
|
||||
| y2 | integer |
13
|
||||
| x1 | integer |
9
|
||||
| y1 | integer |
8
|
||||
| ox | integer |
1
|
||||
| oy | integer |
5
|
||||
| f | list |
[ 6, 75, 61 ]
|
||||
| f1 | integer |
6
|
||||
| f0 | integer |
1
|
||||
| f2 | integer |
75
|
||||
| f3 | integer |
61
|
||||
| f4 | integer |
16
|
||||
| f_sorted | vector |
vector(6,61,75)
|
| Name | Type | Generated Value |
|---|
Generated value: integer
1
→ Used by:
- c1
- c12
- c3
- c32
- f0
- f1
- x1
- x22
Parts
Gap-fill
Ask the student a question, and give any hints about how they should answer this part.
Solve the following LP problem by hand using the Simplex Method.
Problem:
Minimize: {−{ox}x−{oy}y}
subject to:
{{c11}x+{c12}y≥{c1}}
{{c21}x+{c22}y≥{c2}}
{{c31}x+{c32}y≤{c3}}
x≥0, y≥0
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 your LP problem {y22[i]}{x22[i]}{f_sorted[2]}).
- Solve the problem "onpaper" by hand using the Simplex Method (do not use any Computational Packages).
- Submit the above pdf, your solution steps and optimal solution - optimal point (xsol,ysol) and objevtive function value fsol.
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: