CA5103 PRELIMS

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/124

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

125 Terms

1
New cards

objective function

is the function that needs to be optimized (either maximized or minimized). Examples are profit functions and cost functions

2
New cards

constraint

is a limitation on the resources (such as materials and labor) or a requirement that must be complied (such as laws or material specification).

3
New cards

linear programming problem

consists of a linear objective function to be maximized or to be minimized subject to certain constraints in the form of linear equations or inequalities

4
New cards

sensitivity or post-optimality analysis

is the analysis of the effect of change in one or more parameters (change in the objective function coefficient or right-hand side) defining a linear programming model.

5
New cards

profit contribution

refers to the objective function coefficient c1 and c2 .

6
New cards

total profit contribution

refers to the objective function value Z

7
New cards

the optimal solution to the original linear programming problem has been obtained

analysis does not begin until

8
New cards

no effect on the feasible region, it only changes the slope of the objective function line

Changes in the OFC (c1 and c2) have

9
New cards

range of optimality

a range for each OFC (c1 and c2 ) where the current optimal corner point (or optimum solution) remains optimal is callled

10
New cards

a different corner point will become optimal

If the slope changes beyond the Range of Optimality and the OFC (c1 or c2) changes beyond that range

11
New cards

binding constraint

constraints where the left-hand side and the right-hand side are equal upon substituting the optimum solution (x1 , x2 ) to the constraint expression

12
New cards

slope of the objective function line is between the slope of the two binding constraints

the solution is kept optimal as long as the

13
New cards

less negative and the slope increases

Rotating the objective function line counterclockwise causes the slope to become

14
New cards

more negative and the slope decreases

Rotating the objective function line clockwise causes the slope to become

15
New cards

the extreme point to be nonoptimal

Any further counterclockwise or clockwise rotation of the objective function line will cause

16
New cards

non-binding constraint

a constraint where no optimal solution is on the line for the constraint.

17
New cards

binding constraint

if a constraint whose rhs or resources are fully consumed, it is a

18
New cards

nonbinding constraint

if a constraint whose rhs or resources are not fully consumed, it is a

19
New cards

positive

the shadow price/dual value of a maximization problem is generally assumed to be

20
New cards

negative

the shadow price/dual value of a minimization problem is generally assumed to be

21
New cards

Profit new - Profit old/Cost new - Cost old

formula for shadow price

22
New cards

shadow price/dual value

change in the value of the optimal solution per unit increase in the right-hand side of the constraint

23
New cards

range of feasability

the range over which the shadow price/dual value is applicable. (or allowable increase or decrease in the constraint)

24
New cards

worsen, improve

Tightening the binding constraints can _______ the objective function value & loosening it can __________ the objective function value.

25
New cards

non-zero, zero

a binding constraint always has a _________ value of shadow price while a non-binding constraint has a value of __________

26
New cards

negative shadow price

indicates that the objective function will not improve if the RHS is increased

27
New cards

only one coefficient changes assuming all other coefficients remain

sensitivity analysis information in computer output is based on the assumption that

28
New cards

summation of proposed change/allowable change of OFC or RHS

what is the formula of the 100% rule

29
New cards

simultaneous changes, changes in constraint coefficients, and non-intuitive dual values

three limitations of classical sensitivity analysis

30
New cards

vertex or corner point

If a linear programming problem has a solution then it must occur at a

31
New cards

optimized at every point on the line segment joining these vertices

if the objective function 𝑍 is optimized (either maximized or minimized) at two adjacent vertices of 𝑆, then it is

32
New cards

both maximum and minimum value on S

If S is bounded, then 𝑍 has

33
New cards

minimum value on S provided that constraint defining S include nonnegativity constraints

If S is unbounded and both 𝑎 and 𝑏 are nonnegative, then 𝑍 has

34
New cards

no solution

If S is the empty set, then the linear programming problem has

35
New cards

infinitely many solutions given by the points on the line segment

If two adjacent corner points satisfy the objective, then there are

36
New cards

right-most

For maximization problems, the ____________ corner point intersected by the isoprofit line is the optimal solution

37
New cards

left-most

For minimization problems, the ____________ corner point intersected by the isocost line is the optimal solution.

38
New cards

infinitely many solutions given by the points on the line segment

If an objective function line coincides with the rightmost (leftmost) line segment, not just a corner point, then there are

39
New cards

-c1/c2

Assuming an objective function Z=C1x+C2y, then the slope of the objective function is

40
New cards

Constraints

the uncontrollable restrictions, requirements, or regulations

41
New cards

input-output (technology) variables

indicate the rate at which a given resource is depleted or utilized

42
New cards

capacities (availability) of the various resources

usually expressed as some upper or lower limit, can also express minimum requirements

43
New cards

limits to the decision variables

positive, negative, unrestricted

44
New cards

maximization of expected return or minimization of risk.

The objective function of financial problems usually is

45
New cards

conduct the survey so as to meet the client's needs at a minimum cost.

The marketing research firm's objective is to

46
New cards

Problem formulation or modeling

is the process of translating a verbal statement of a problem into a mathematical statement.

47
New cards

art

Formulating models is an _________ that can only be mastered with practice and experience.

48
New cards

unique features, but most problems also have common features.

Every LP problem has some

49
New cards

time-series

sequence of observations on a variable measured at successive points in time or over successive periods of time

50
New cards

horizontal, trend, seasonal, trend & seasonal, cyclical

types of patterns and trends in time series

51
New cards

horizontal pattern

data fluctuates around a constant mean

52
New cards

stationary time series

time series whose statistical properties are independent of time

53
New cards

horizontal pattern with a shift

changes in conditions that result in a shift to a new level

54
New cards

trends

show gradual shifts or movement over a long period of time

55
New cards

seasonal pattern

recognized by recurring patterns over successive periods of time

56
New cards

seasonal pattern

repeated behavior in the data that occurs at regular intervals

57
New cards

cyclical pattern

shows alternating sequence below or above the trend line of points that lasts more than a year

58
New cards

cyclical

the series follows an up-and-down movement with no regular intervals

59
New cards

random pattern

This pattern has no distinct crests and troughs. There could be a general trend but variation is __________

60
New cards

irregularities

strange dips or jumps that may occur due to a one-off event

61
New cards

naive forecasting method

simplest of all forecasting methods

62
New cards

naive forecasting method

uses the most recent observations in the time series as the forecast for the next period

63
New cards

forecast error

difference between the forecast and actual demand at the same time period

64
New cards

positive, negative, and forecast bias

types of forecast errors

65
New cards

positive forecast error

it indicates that forecasting method underestimated the actual value

66
New cards

negative forecast error

it indicates that forecasting method overestimated the actual value

67
New cards

forecast bias

it refers to the persistent tendency for forecasts to be greater or less than the actual values of the time series

68
New cards

mean absolute error (MAE), mean squared errors (MSE), and mean absolute percentage error (MAPE)

types of measures of forecast accuracy

69
New cards

mean absolute error (MAE)

obtained by getting the average of the absolute values of the forecast errors

70
New cards

mean squared error (MSE)

obtained by getting the average of the squared forecast errors

71
New cards

mean absolute percentage error (MAPE)

obtained by getting the average of the absolute value of the percentage forecast errors

72
New cards

demand, economic, and technology

major areas of forecasting

73
New cards

demand forecasting

predicts the timing and quantity of demand of a firm's commodities

74
New cards

technology forecasting

predicts possible technological advancements in the future

75
New cards

economic forecasting

predicts the future business condition with reference to economic factors

76
New cards

causal models

quantitative forecasting models wherein the variable forecasted is influenced by or correlated with other variables

77
New cards

regression analysis

the purpose of this analysis is to understand the relationship between two variables and to predict the value of one based on the other

78
New cards

correlation analysis

this analysis is used to measure the strength of the linear relationship between two variables

79
New cards

p<0.05

What should be the p-value in order to reject the null hypothesis H0?

80
New cards

time-series models

these are quantitative forecasting models that attempt to predict future values by using historical data

81
New cards

qualitative models

these are forecasting models based on judgmental or subjective factors

82
New cards

delphi method, jury of executive opinion, sales force composite, and consumer market survey

types of qualitative forecasting models

83
New cards

delphi method

this model allows experts in different places to make forecasts

84
New cards

jury of executive opinion

this forecasting method uses the opinions of a small group of high-level managers

85
New cards

sales force composite

it is a forecasting approach where salespersons estimate what sales will be in the district and national levels

86
New cards

consumer market survey

this forecasting method solicits ideas from customers or potential customers in order to modify or create products

87
New cards

demand, economic, and technology forecasting

major areas of forecasting

88
New cards

define the problem

89
New cards

determine the set of alternative solutions

90
New cards

determine the criteria for evaluating alternatives

91
New cards

evaluate the alternatives

92
New cards

choose an alternative

93
New cards

implement the decision

94
New cards

evaluate the results

seven steps in problem solving

95
New cards

decision making process

Steps 1-5 in problem solving are considered as __________

96
New cards

structuring the problem and analyzing the problem

two classifications of the decision making process

97
New cards

step 1-3

steps included in structuring the problem

98
New cards

4-5

steps included in analyzing the problem

99
New cards

single-criterion decision problems

refer to problems in which the object is to find the best solution with respect to one criterion

100
New cards

multicriteria decision problems

refer to problems that involve more than one criterion