Decision 1 Unit 7 Flashcards

0
Q

What is the objective function?

A

Whether the total cost etc. of x and y things needs to be maximised or minimised.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
1
Q

How to formulate a linear programming problem?

A
  1. Define the decision variables.
  2. Write down the constraints.
  3. Find the objective function to maximise or minimise.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the decision variables?

A
x = number of...
y = number of...
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the constraints?

A

Inequalities using the equations, and the non-negativity such as x≥0, y≥0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How to draw a ≥ line and a > line on a graph

A

≥ Is a solid line, > is dotted.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a feasible region?

A

It is the region on the graph where a solution will be.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How to find the solution after formulating?

A
  1. Draw the inequalities on a graph (by setting x and y to 0).
  2. Pick a coordinate above or below the line (eg. (0,0) ) to find which bit to shade depending on whether it satisfies it.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly