Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T07:56:41.328Z Has data issue: false hasContentIssue false

Development of a Linear Programming Model for the Analysis of Merger/Acquisition Situations

Published online by Cambridge University Press:  19 October 2009

Extract

With the rapid growth in various types of corporate combinations, many opportunities arise in which increased internal efficiency in the allocation of capital budgeting resources may be obtained. Although the resource-transfer methodology proposed in this paper is discussed within the context of a merger/acquisition environment, the operational analysis conveivably could be applied to multiproduct, multifirm, or multinational situations. This study examines an application in which a linear programming model can be used operationally as an analytical planning device (1) to obtain efficient capital budgets for the merged companies, and (2) to quantify the monetary value of potential gains in efficiency produced by a merger. Conceptually, the model assists management in searching for excess capacity in each company, efficiently combines scarce resources, selects an optimal project list for the merged company, and indicates what the composition of the new capital budget should be. In addition, a variable step function provides for multiplicative adjustments in common resource constraints. These adjustments might be positive (negative) if the combination results in a more than proportionate increase (decrease) in the availability of a scarce resource.

Type
Financial Management
Copyright
Copyright © School of Business Administration, University of Washington 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alberts, William W., and Segall, Joel E., The Corporate Merger (Chicago: The University of Chicago Press, 1966).Google Scholar
[2]Bernhard, Richard H., “Mathematical Programming Models for Capital Budgeting — A Survey, Generalization, and Critique”, Journal of Financial and Quantitative Analysis, Vol. IV, No. 2 (June 1969), pp. 111158.Google Scholar
[3]Charnes, A. and Cooper, W. W., “Chance-Constrained Programming”, Management Science, Vol. IV, No. 1 (October 1959), pp. 7379.Google Scholar
[4]Donaldson, Gordon, “Financial Goals: Management vs. Stockholders”, Harvard Business Review, Vol. 41, No. 3 (June 1963), pp. 116129.Google Scholar
[5]Gomory, Ralph E., “Outline of an Alogorithm for Integer Solutions to Linear Programs”, Bulletin of the American Mathematical Society, Vol. LXIV (September 1958), pp. 275278.CrossRefGoogle Scholar
[6]Louis, Arthur M., “Ten Conglomerates and How They Grew,” Fortune (May 1969), pp. 152155.Google Scholar
[7]Pratt, John, “Risk Aversion in the Small and in the Large”, Econometric, Vol. 32, Nos. 1–2 (January–April 1964), pp. 122136.CrossRefGoogle Scholar
[8]Raiffa, Howard, Decision Analysis (Reading, Mass.: Addison-Wesley, 1968).Google Scholar
[9]Weingartner, H. Martin, Mathematical Programming and the Analysis of Capital Budgeting Problems (Englewood Cliffs, N.J.: Prentice-Hall, 1963).Google Scholar
[10]Weingartner, H.“Capital Budgeting of Interrelated Projects: Survey and Synthesis”, Management Science, Vol. 12, No. 7 (March 1966), pp. 485516.Google Scholar
[11]Weston, J.Fred, , and Brigham, Eugene F., Managerial Finance, 3rd ed. (New York: Holt, 1969).Google Scholar