Teoria Flashcards

1
Q

Who developed the simplex method?

A

1947 by George Dantzig

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

What stage of studying operations research requires a high correlation between prediction and real life as part of the validation work of the model?

A

Formulation of a mathematical model

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

When was the operations research discipline invented?

A

During Second World War

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

The main objective of operations research discipline is related to…

A

Taking decisions

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

This is a disadvantage of mathematical models…

A

A manageable model requires simplifying assumptions (capable of being resolved)

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

This is the decision model where the probability of occurrence is totally unknown

A

Under Uncertainty

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

Once the decision is made, it cannot be changed after the state of nature has occurred.

A

VERDADERO

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

Decision Model where we know which state of nature is going to occur.

A

Under certainty

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

This is the decision model where we can estimate the probability of occurrence of every state of nature…

A

Under Low Risk

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

When it is not possible to estimate the probability of every state of nature, then the 100% of probability is distributed equally in all states of nature.

A

VERDADERO

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

Name of the area where all CPF’s enclose

A

Feasible Region

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

All CPF’s solve Z equation, but not maximizes Z equation

A

VERDADERO

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

The path to follow is selected by the bigger coefficient of the decision variables

A

FALSO

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

If 2 or more CPF’s maximize Z equation, those CPF’s are called Multiple Solutions

A

VERDADERO

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

Linear Programming (Graphic Solution or Simplex):
x1,x2,x3…,xn, in math models are called…

A

Decision Variables

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

Whenever possible, the initialization of the simplex method chooses the origin

A

Key Solution Concept 1

17
Q

This assumption states that every function in a linear programming model is the sum of the individual contribution.

A

Additivity

18
Q

The simplex method is an iterative algorithm

A

Key Solution Concept 2

19
Q

Into Algebraic Method, there are 2 iterations, How many steps have every iteration?

A

3

20
Q

It is added to the augmented version the same amount of slack variables or restrictions are

A

VERDADERO

21
Q

If table is number 2, how many iterations have been performed?

A

1

22
Q

The pivot cell indicates the BV that will become NBV

A

VERDADERO

23
Q

The pivot cell indicates the NBV that will become BV

A

VERDADERO

24
Q

There are the same amount of BV as slack variables

A

VERDADERO