scispace - formally typeset
Search or ask a question
Topic

Goal programming

About: Goal programming is a research topic. Over the lifetime, 4330 publications have been published within this topic receiving 117758 citations.


Papers
More filters
01 Nov 1996
TL;DR: It can be rigorously proved that this method can be easily extended in case of more than two objectives while retaining the computational efficiency of continuation-type algorithms, which is an improvement over homotopy techniques for tracing the tradeoff curve.
Abstract: This paper proposes an alternate method for finding several Pareto optimal points for a general nonlinear multicriteria optimization problem, aimed at capturing the tradeoff among the various conflicting objectives. It can be rigorously proved that this method is completely independent of the relative scales of the functions and is quite successful in producing an evenly distributed set of points in the Pareto set given an evenly distributed set of `weights'', a property which the popular method of linear combinations lacks. Further, this method can be easily extended in case of more than two objectives while retaining the computational efficiency of continuation-type algorithms, which is an improvement over homotopy techniques for tracing the tradeoff curve.

198 citations

Journal ArticleDOI
TL;DR: In this paper, a goal programming/constrained regression model was used to compare the main findings of the econometric studies in every one of the 20 years covered, and the results showed that the results of these studies did not support the contention that Bell was a natural monopoly.
Abstract: The recently implemented court decision to break up Bell (=American Telephone & Telegraph Co.) to accord with U.S. anti-trust laws represents a highly significant policy decision which is proving to be influential in other countries as well as the U.S. The telecommunication industry is of such size and importance that even relatively small economies that might be lost with Bell's breakup as a “natural monopoly” could involve substantial welfare losses to consumers and producers. Studies commissioned by the U.S. Justice Department that approached this topic by econometric methods reported that the evidence failed to support the contention that Bell was a natural monopoly. Here a goal programming/constrained regression, as developed in the Management Science literature, uses the same functional form and the same data but nevertheless reverses the main findings of the econometric studies in every one of the 20 years covered. This kind of difference in results obtained by two different methods of analysis poi...

198 citations

Journal ArticleDOI
TL;DR: Goal programming (GP) model is proposed to address this multi-objective problem with the integration of non-relaxable constraints and relaxable constraints to show that this approach is a viable tool and offers good communication with decision-maker.

197 citations

Journal ArticleDOI
TL;DR: A Historical Sketch on Sensitivity Analysis and Parametric Programming T.J. Greenberg and the Optimal Set and Optimal Partition Approach.
Abstract: Foreword. Preface. 1. A Historical Sketch on Sensitivity Analysis and Parametric Programming T. Gal. 2. A Systems Perspective: Entity Set Graphs H. Muller-Merbach. 3. Linear Programming 1: Basic Principles H.J. Greenberg. 4. Linear Programming 2: Degeneracy Graphs T. Gal. 5. Linear Programming 3: The Tolerance Approach R.E. Wendell. 6. The Optimal Set and Optimal Partition Approach A.B. Berkelaar, et al. 7. Network Models G.L. Thompson. 8. Qualitative Sensitivity Analysis A. Gautier, et al. 9. Integer and Mixed-Integer Programming C. Blair. 10. Nonlinear Programming A.S. Drud, L. Lasdon. 11. Multi-Criteria and Goal Programming J. Dauer, Yi-Hsin Liu. 12. Stochastic Programming and Robust Optimization H. Vladimirou, S.A. Zenios. 13. Redundancy R.J. Caron, et al. 14. Feasibility and Viability J.W. Chinneck. 15. Fuzzy Mathematical Programming H.-J. Zimmermann. Subject Index.

195 citations

Journal ArticleDOI
TL;DR: In this paper, the authors extend the data envelopment analysis additive model using goal programming concepts, and derive optimal efficiency scores while taking into account non-volume related activities, that is those involving resources that cannot be assigned to a specific input or output.
Abstract: Studies of bank branch performance have, to date, concentrated on obtaining a single perspective of efficiency. As the financial services industry has intensified, banks have increasingly engated in a proactive, differentiated and customer-based strategy in retail banking in which the sales component of the bank branch activity is emphasized. With the emerging sales culture within banks, as discussed earlier, there is a need to evaluate both sales and service performance. Cook et al. [12] have proposed a model to evaluate simultaneously the sales, service, and aggregate efficiencies of a bank branch. This model accounted for the fact that inputs, in particular resources, are often shared among these functions. In this paper, we extend the data envelopment analysis additive model using goal programming concepts. We thereby derive optimal efficiency scores while taking into account non-volume related activities, that is those involving resources that cannot be assigned to a specific input or output. Again, the proposed model derives an optimal split of the shared resources that maximizes the aggregate efficiency.

191 citations


Network Information
Related Topics (5)
Supply chain
84.1K papers, 1.7M citations
84% related
Supply chain management
39K papers, 1M citations
82% related
Fuzzy set
44.4K papers, 1.1M citations
80% related
Scheduling (computing)
78.6K papers, 1.3M citations
80% related
Fuzzy logic
151.2K papers, 2.3M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202335
202271
2021151
2020138
2019160
2018145