Linear Programming Flashcards

1
Q

How can management science be used for manufacturing?

A

Calculating how to allocate limited resources to give maximum profit

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

How can management science be used for transportation?

A

Minimising the transportation costs for e.g. delivery

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

How can management science be used for facilities planning?

A

Where things can be located so they’re in the best position for their use, e.g. where to locate student halls

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

To predict things organisations make decision based on several other factors but not all of them.. models are..

A

Simplified versions of the things they represent

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

The more aspects a model covers, the more:

A
  • Reliable it is

- The closer it is to reality

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

Why do we use models?

A
  • Less costly
  • Can test things that are impossible
  • Can give information quicker than real-world time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a mathematical model?

A

A representation of a problem by a system of symbols and quantitative relationships or expressions

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

In regards to maximising profit production what to these symbols mean: & ?

A

= for representing the number of bags to be produced

the total profit

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

In regards to maximising profit production what to these symbols mean: & ?

A

= the number of bags to be produced

= the total profit

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

How to work out profit?

A

P X Q

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

What are decision variables?

A

Variables whose values are under our control and influence the performance of the system

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

What is an objective function?

A

If the decision maker wants to maximise profit or minimise costs

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

What are constraints?

A

Restrictions on the values of the decision variables

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

In regards to maximising profit production what to these symbols mean: & ?

A

= the number of bags to be produced

= the total profit

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

What are constraints?

A

Restrictions on the values of the decision variables

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

What are the steps to constructing a linear programming model?

A
  1. Identify the decision variables
  2. Write the objectives
  3. Write the constraints in terms of decision variables
  4. Add the non-negativty constraints

e. g. Bag example
1) = number of bags to be produced
2) max⁡ = 10 ×
3) 5 × ≤ 40
4) ≥ 0

17
Q

In regards to maximising profit production what to these symbols mean: & ?

A

= the number of bags to be produced

= the total profit

18
Q

What are the steps to constructing a linear programming model?

A
  1. Identify the decision variables: how many of something are they making (1 = . More than one = 2)
  2. Write the objectives: max profit, min costs. Need to write: max P = (? the profit for the thing) x (, 1, 2). If more than one: max P = (?) x 1 + (?) x x2
  3. Write the constraints in terms of decision variables:
  4. Add the non-negativty constraints

e. g. Bag example
1) = number of bags to be produced
2) max⁡ = 10 ×
3) 5 × ≤ 40
4) ≥ 0

19
Q

What are the steps to constructing a linear programming model?

A
  1. Identify the decision variables:
    - X1 = Number of …….
    - X2 = Number of …….
  2. Write the objectives: max profit, min costs?
    - max P = (the profit for the thing) x (X1).
    - If more than one: z = (?) x X1 + (?) x X2 to maximise
  3. Write the constraints in terms of decision variables:
    - (?How long they need in a certain area) x X1
    - Repeat the same for other constraints
    - Then add them together, and remember to add it needs to be less than the amount of hours available: (?) x 1 + (?) x 2 ≤.
    Repeat for all different constraints
  4. Add the non-negativty constraints
    Whatever it is ≥0
    Have to do this for each :
    1 ≥ 0
    2 ≥ 0