A Non-Convex Goal Programming Model for Decentralizing a Firm.
Abstract
The paper presents a model which includes the salient features of decentralization problems and behavior by a two-level goal-programming approach. The fact that it turns out to be a non-convex programming problem is of interest, both for the managerial implications and the mathematical problems involved. The technique used to reach a solution, or some similar methods, seems to have a good potential for the solution of other non-convex problems, like those which arise from chance-constrained programming when zero-order decision rules are used, or other types of dynamic planning which involve decomposition of goals over time similar to the decomposition between units dealt with here. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1970
- Accession Number
- AD0721691
Entities
People
- Abraham Charnes
- B. Collomb
Organizations
- University of Texas at Austin