Error
There was an error loading the page.
This question tests the student's ability to solve Linear Programming problems by applying Geometric 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 SIT316 MO-Geometric Method-Q1 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 SIT316 MO-Geometric Method-Q2.There are 88 other versions that do you not have access to.
| Name | Type | Generated Value |
|---|
| a1 | integer |
5
|
||||
| b1 | integer |
3
|
||||
| a2 | integer |
10
|
||||
| b2 | integer |
12
|
||||
| a3 | integer |
18
|
||||
| b3 | integer |
9
|
||||
| c11 | integer |
9
|
||||
| c12 | integer |
-5
|
||||
| c1 | integer |
30
|
||||
| c2 | integer |
-126
|
||||
| c3 | integer |
-9
|
||||
| c21 | integer |
-3
|
||||
| c22 | integer |
-8
|
||||
| c31 | integer |
6
|
||||
| c32 | integer |
-13
|
||||
| i | integer |
2
|
||||
| x22 | list |
[ 5, 10, 18 ]
|
||||
| x2 | integer |
18
|
||||
| y22 | list |
[ 3, 12, 9 ]
|
||||
| y2 | integer |
9
|
||||
| x1 | integer |
11
|
||||
| y1 | integer |
8
|
||||
| ox | integer |
7
|
||||
| oy | integer |
1
|
||||
| f | list |
[ 38, 82, 135 ]
|
||||
| f1 | integer |
38
|
||||
| f0 | integer |
35
|
||||
| f2 | integer |
82
|
||||
| f3 | integer |
135
|
||||
| f4 | integer |
126
|
||||
| f_sorted | vector |
vector(38,82,135)
|
| Name | Type | Generated Value |
|---|
Generated value: integer
- c1
- c12
- c3
- c32
- f0
- f1
- x1
- x22
This variable doesn't seem to be used anywhere.
Gap-fill
Ask the student a question, and give any hints about how they should answer this part.
Solve the following Linear Programming problem by applying the geometric method.
Problem:
Maximize: {{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
The feasible region in this problem is a triangle. Calculate objective function values at vertices and arrange them in assending order from smallest to largest as f1,f2,f3:
f1=
f2=
f3=
The optimal solution is:
(xsol,ysol)= (
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 | ||
| Number entry | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet | ||
| Choose one from a list | ||
| Hasn't run yet |
This question is used in the following exams: