Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
40Activity
0 of .
Results for:
No results containing your search query
P. 1
Solution Manual, Managerial Accounting Hansen Mowen 8th Editions_ch 12

Solution Manual, Managerial Accounting Hansen Mowen 8th Editions_ch 12

Ratings: (0)|Views: 4,027 |Likes:
Published by jasperkennedy0

More info:

Published by: jasperkennedy0 on May 24, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

09/19/2013

pdf

text

original

 
339911 
CHAPTER 12TACTICAL DECISION MAKING
QUESTIONS FOR WRITING AND DISCUSSION
1.
A tactical decision is short-run in nature; itinvolves choosing among alternatives withan immediate or limited end in view. A stra-tegic decision involves selecting strategiesthat yield a long-term competitive advan-tage.
2.
Depreciation is an allocation of a sunk cost.This cost is a past cost and will never differ across alternatives.
3.
The salary of a supervisor in an accept or reject decision is an example of an irrelevantfuture cost.
4.
If one alternative is to be judged superior toanother alternative on the basis of cash-flowcomparisons, then cash flows must be ex-pressed as an annual amount (or periodicamount); otherwise, consideration must begiven to the time value of the nonperiodiccash flows.
5.
Disagree. Qualitative factors also have animportant bearing on the decision and may,at times, overrule the quantitative evidencefrom a relevant costing analysis.
6.
The purchase of equipment needed to pro-duce a special order is an example of a fixedcost that is relevant.
7.
Relevant costs are those costs that differ across alternatives. Differential costs are thedifferences between the costs of two alter-natives.
8.
Depreciation is a relevant cost whenever it isa future cost that differs across alternatives.Thus, it must involve a capital asset not yetacquired.
9.
Past costs can be used as information tohelp predict future costs.
10.
Yes. Suppose, for example, that sufficientmaterials are on hand for producing a partfor two years. After two years, the part willbe replaced by a newly engineered part. If there is no alternative use of the materials,then the cost of the materials is a sunk costand not relevant in a make-or-buy decision.
11.
Complementary effects may make it moreexpensive to drop a product, as the droppedproduct has a negative impact on other products.
12.
A manager can identify alternatives by usinghis or her own knowledge and experienceand by obtaining input from others who arefamiliar with the problem.
13.
No. Joint costs are irrelevant. They occur regardless of whether the product is sold atthe split-off point or processed further.
14.
Yes. The incremental revenue is $1,400,and the incremental cost is only $1,000,creating a net benefit of $400.
15.
Regardless of how many units are pro-duced, fixed costs remain the same. Thus,fixed costs do not change as product mixchanges.
16.
No. If a scarce resource is used in producingthe two products, then the product providingthe greatest contribution per unit of scarceresource should be selected. For more thanone scarce resource, linear programmingmay be used to select the optimal mix.
17.
If a firm is operating below capacity, then aprice that is above variable costs will in-crease profits. A firm may sell a product be-low cost as a loss leader, hoping that manycustomers will purchase additional itemswith greater contribution margins. Grocerystores often use this strategy.
18.
Different prices can be quoted to customersin markets not normally served, to noncom-peting customers, and in a competitive bid-ding setting.
19.
Linear programming is used to select theoptimal product mix whenever there are mul-tiple constrained scarce resources.
20.
An objective function is the one to be max-imized (or minimized) subject to a set of constraints. A constraint restricts the possi-ble values of variables appearing in the ob- jective function. Usually, a constraint is con-
 
339922 
cerned with a scarce resource. A constraintset is the collection of all constraints for agiven problem.
21.
A feasible solution is a solution to a linear programming problem that satisfies theproblem’s constraints. The feasible set of solutions is the collection of all feasible solu-tions.
22.
To solve a linear programming problemgraphically, use the following four steps: (1)graph each constraint, (2) identify the feasi-ble set of solutions, (3) identify all corner points in the feasible set, and (4) select thecorner point that yields the optimal value for the objective function. Typically, when a li-near programming problem has more thantwo or three products, the simplex methodmust be used.
 
339933 
EXERCISES12–1
The correct order is: D, E, B, F, C, A.
12–2
Situation Flexible Resource Committed ResourceShort TermCommitted ResourceMultiple PeriodsA Forms & supplies Purchasing agentsTelephone/internetfeesOffice equipmentB Counter staff FoodUtilitiesPaper suppliesAdvertisingBuilding and parking lotleaseC Substitute helpGasolineLawn mower oil Power mower Weed eater Pickup truck
12–3
1. The two alternatives are to make the component in house or to buy it from theoutside supplier.2. Alternatives DifferentialMake Buy Cost to MakeDirect materials $ 2.95 $ 2.95Direct labor 0.40 0.40Variable overhead 1.80 1.80Purchase cost $6.50 (6.50
 
)Total relevant cost $ 5.15 $6.50 $ (1.35)Chesbrough should make the component in house because operating incomewill decrease by $27,000 ($1.35
×
20,000) if it is purchased from Berham Elec-tronics.

Activity (40)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
Juni Harta liked this
wakemeup143 liked this
18443 liked this
Tjhay Fang Lan liked this
notnull991 liked this
Tjhay Fang Lan liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->