Professional Documents
Culture Documents
5b4b3sec B Inventory, Desision, Game
5b4b3sec B Inventory, Desision, Game
NUMERICALS 1-4
INVENTORY – ASSN. NUMERICALS
Q. NO. 1
THE INVENTORY MANAGER IN A LARGE RETAIL
STORE HAS TO DECIDE THE INVENTORY LEVELS FOR
1 KG PACKETS OF A PARTICULAR BRAND OF
DETERGENT POWDER. THE ANNUAL DEMAND IS
ESTIMATED TO BE 40,000 PACKETS. THE PRICE PER
PACKET IS RS 80. THE COST OF PROCUREMENT PER
ORDER IS RS 600. INVENTORY CARRYING COST IS 15
% PER ANNUM. THE STORE IS OPEN 300 DAYS IN A
YEAR. LEAD TIME IS 6 WORKING DAYS.
FIND THE ECONOMIC ORDER QUANTITY, REORDER
LEVEL, INVENTORY CYCLE TIME, ANNUAL TOTAL
COST, NUMBER OF ORDERS PER YEAR, VALUE OF
OPTIMAL ORDER QUANTITY, RUPEE VALUE OF
AVERAGE INVENTORY, QUANTITY TO BE STOCKED IN
THE MAIN IB AND THE AUXILIARY BIN AT THE
BEGINNING OF THE INVENTORY CYCLE IN THE TWO
BIN SYSTEM.
INVENTORY - ASSN. NUMERICALS
Q. NO. 2.
WHAT IS THE EFFECT ON
ANNUAL TOTAL COST IF THE
VENDOR OFFERS A DISCOUNT
OF Rs 5 PER PACKET, PROVIDED
THE QUANTITY ORDERED IS
MINIMUM 4000 Nos. SHOULD
THE OFFER BE ACCEPTED?
INVENTORY - ASSN. NUMERICALS
Q. NO.3
IF THE VENDOR AGREES TO
DELIVER 150 PACKETS PER DAY
AT NO EXTRA COST, WHAT
SHOULD BE THE ECONOMIC
ORDER QUANTITY? ALSO
DETERMINE THE ANNUAL TOTAL
COST.
INVENTORY - ASSN. NUMERICALS
Q. NO. 4
IF COST OF SHORTAGE PER ITEM
IS 25 PERCENT OF THE ANNUAL
INVENTORY CARRYING COST PER
ITEM, DETERMINE THE EOQ AND
THE ANNUAL TOTAL COST
DECISION THEORY - NUMERICAL 1
DAILY DEMAND 2 3 4 5 6
DOZ OF LOAVES PER
DAY
FREQUENCY 10 15 12 8 5
NO. OF DAYS
DECISION THEORY - NUMERICAL 3
NUMERICALS 1-15
ASSN NUMERICAL 1 SEC B
TWO PERSON, ZERO SUM, MIXED STRATEGY 2x2 GAME
A’S STRATEGIES
B’s STRATEGIES
b1 b2
a1 6 8
a2 10 4
ASSN NUMERICAL 2 SEC B
TWO PERSON, ZERO SUM mxn GAME
THE PAYOFF MATRIX (A’s GAIN) FOR A GAME INVOLVING TWO PLAYERS IS GIVEN
BELOW. SOLVE IT USING THE DOMINANCE RULE.
B’s
STRATEGIES
A’S STRATEGIES
b1 b2
b3
a1 1 6 5
a2 0 4 3
a3 4 6 0
a4 -2 3 4
ASSN NUMERICAL 3 SEC B
TWO PERSON, ZERO SUM 2xn GAME
THE PAYOFF MATRIX (A’s GAIN) FOR A GAME INVOLVING TWO PLAYERS IS GIVEN
BELOW. SOLVE IT USING THE SUB GAME RULE.
A’S STRATEGIES
B’s
STRATEGIES
b1 b2
b3
a1 -3 -1 6
a2 5 3 2
ASSN NUMERICAL 4 SEC B
TWO PERSON, ZERO SUM 2xn GAME
THE PAYOFF MATRIX (A’s GAIN) FOR A GAME INVOLVING TWO PLAYERS
IS GIVEN BELOW. SOLVE IT USING THE GRAPHICAL METHOD.
A’S STRATEGIES
B’s
STRATEGIES
b1 b2
b3
a1 2 5 6
a2 7 3 4
ASSN NUMERICAL 5 SEC B
TWO PERSON, ZERO SUM mxn GAME
THE PAYOFF MATRIX (A’s GAIN) FOR A GAME INVOLVING TWO PLAYERS IS GIVEN
BELOW. SOLVE IT USING BROWN’S ALGORITHM
B’s
STRATEGIES
b1 b2
A’S STRATEGIES
b3
a1 5 4 3
a2 8 9 7
a3 6 4 8
ASSN NUMERICAL 6 SEC B
TWO PERSON, ZERO SUM 2xn GAME
THE PAYOFF MATRIX (A’s GAIN) FOR A GAME INVOLVING TWO PLAYERS IS GIVEN
BELOW. REFORMULATE IT AS A LPP AND SOLVE IT USING THE GRAPHICAL
METHOD AND THE SIMPLEX METHOD
A’S STRATEGIES
B’s
STRATEGIES
b1 b2 b3
a1 4 -1 0
a2 -1 4 2