QUANTECH

Question 1

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

Answer 1

LINEAR PROGRAMMING

Question 2

A limit on the availability of resources

Answer 2

CONSTRAINT

Question 3

Expression which shows the relationship between the variable in the problem and firms goals

Answer 3

Objective function

Question 4

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

Answer 4

Area of feasible solution

Question 5

an efficient method in solving linear programming problem

Answer 5

Simplex method

Question 6

Variable used in linear programming to convert an inequality into an equation

Answer 6

Slack variable

Question 7

Column containing all the variables in a solution in the simple tableau

Answer 7

Product mix column

Question 8

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

Answer 8

Cj column

Question 9

Column in any solution to a maximizing problem which has the largest positive value in the cj-zj row or which hast largest negative value in a minimizing problem

Answer 9

Optimum column

Question 10

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

Answer 10

Replaced row

Question 11

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

Answer 11

intersectional elements

Question 12

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

Answer 12

Zj row

Question 13

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

Answer 13

Cj-zj row

Question 14

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

Answer 14

artificial variable

Question 15

Concerned with the selecting optimal routes between sources and destinations

Answer 15

Transportation problem

Question 16

Special purpose algorithm for solving the transportation problem

Answer 16

Stepping stone method

Question 17

Demands equals supply

Answer 17

Balanced condition

Question 18

Capacity constraints at sources and destination in a transportation problem

Answer 18

Rim requirements

Question 19

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

Answer 19

Northwest corner rule

Question 20

represents routes where no quantity between a source and a destination

Answer 20

Unused sqaures

Question 21

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

Answer 21

Improvement index

Question 22

Used squares containing circled values that are in the solution

Answer 22

Stone squares

Question 23

Inventory level at which it is appropriate to replenish stock

Answer 23

Reorder point

Question 24

Time required for the inventory to arrive at order is placed

Answer 24

Lead time

Question 25

When available is not sufficient to satisfy demand

Answer 25

Stockout

Question 26

extra inventory held against the possibility of a stockout

Answer 26

Safety stock

Question 27

Incurred each time an order is placed

Answer 27

Ordering cost

Question 28

Referred to as holding cost; cost incurred in maintaining inventory

Answer 28

Carrying cost

Question 29

Size of the order which minimizes the total annual cost of ordering and carrying inventory

Answer 29

Economic order quantity (eoq)