QUANTECH Flashcards

(32 cards)

1
Q

mathematical technique for finding the best uses of an organization’s resources

A

Linear Programming

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

a limit on the availability of resources

A

Constraint

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

expression which shows the relationship between the variables in the problem and the firm’s goals

A

Objective Function

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

the area containing all possible solutions to the problem which are feasible- those solutions which satisfy all the constraints in the problem

A

Area of feasible solutions

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

an efficient method in solving Linear Programming problem

A

Simplex method

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

variable used in Linear Programming to convert an inequality into an equation

A

Slack Variable

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

column containing all the variables in a solution in the simplex tableau

A

Product Mix Column

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

column in the simplex tableau which contains the profit or cost per unit for the variable in the solution

A

Cj column

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

column in any solution to a maximizing problem which has the largest positive value in the Cj -Zj row or which has the largest negative value in a minimizing problem

A

Optimum Column

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

a row in the simplex tableau which is replaced by the variable entering the new solution

A

Replaced row

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

elements which are common to both the optimum column and the rows representing variables in the solution

A

Intersectional Elements

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

row containing the opportunity costs of bringing one unit of a variable into the solution of a linear programming problem

A

ZJ row

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

contains the net benefit or loss occasioned by bringing one unit of a variable into the solution of a linear programming problem

A

Cj-Zj row

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

computational device used in linear programming to achieve an initial solution to the problem

A

Artificial Variable

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

concerned with selecting optimal routes between sources and destinations

A

Transportation Problem

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

special purpose algorithm for solving the transportation problem

A

Stepping Stone Method

17
Q

demand equals supply

A

Balanced Condition

18
Q

capacity constraints at sources and destinations in a transportation problem

A

Rim Requirements

19
Q

systematic and logical procedure for setting up the initial solution to a transportation problem

A

Northwest corner rule

20
Q

represents routes where no quantity between a source and a destination

A

Unused Squares

21
Q

the net change in cost occasioned by a one-unit change in the quantity shipped

A

Improvement Index

22
Q

used squares containing circled values that are in the solution

A

Stone Squares

23
Q

inventory level at which it is appropriate to replenish stock

A

Reorder point

24
Q

time required for the inventory to arrive after ab order is placed

25
when available inventory is not sufficient to satisfy demand
Stock out
26
extra inventory held against the possibility of a stockout
Safety Stock
27
incurred each time an order is placed
Ordering Cost
28
referred to as holding cost; cost incurred in maintaining inventory
Carrying Cost
29
size of the order which minimizes the total annual cost of ordering and carrying inventory
Economic Order Quantity (EOQ)
30
a simplified special case of simplex method. This is a special procedure for transporting products from several sources to several destinations
Transportation Method
31
What are the the two common objectives of transportation Method
1. To Minimize the Cost of shipping n units to x to destinations 2. To Maximize Profit of shipping n units to x destinations
32
What are the steps in transportation method
STEPS: 1. Set up the Transportation Table 2. Develop an Initial Solution 3. Test the solution for improvement 4. Develop the Improved Solution