Abstract

Accounting managers of the multinational enterprise are responsible for budgeting and planning for a wide arrayof often conflicting objectives and constraints. Effective decision tools that support management inunderstanding tradeoffs between objectives of the budget process are invaluable. We explain the background ofand then illustrate an interactive search process for solving complex multiple objective problems. Themethodology we employ is a variant of multiple objective linear programming (MOLP) called the CombinedTchebycheff/Aspiration method. This method enables management to direct their search for a satisfactory oroptimal solution set as they discover what is feasible and tradeoffs among conflicting objectives. This is incontrast to goal programming where weights on objectives are determined beforehand. We illustrate the solutionmethod on the transfer pricing problem. The result is a search process that uses a mathematically rigorousprocedure to structure a complex problem, while including management feedback throughout the solutionprocess.

This work is licensed under a Creative Commons Attribution 4.0 License.