Explicit Solutions in Convex Goal Programming

A. Charnes, W. W. Cooper, D. Klingman and R. J. Niehaus
Additional contact information
A. Charnes: University of Texas
W. W. Cooper: Carnegie-Mellon University
D. Klingman: University of Texas
R. J. Niehaus: Office of Civilian Manpower Management, Department of the Navy

Management Science, 1975, vol. 22, issue 4, 438-448

Abstract: Goal programming has now become an important tool in areas such as public management science. There is therefore a need for examining ways of securing improved computational efficiency, as is done in this paper, instead of resting only on the linear programming equivalences that were set forth when the original goal programming article was published in Vol. 1, No. 2 of Management Science. Based on lemmata which permit reduction of various important classes of convex goal programming models to problems of full row rank-interval programming type, explicit solutions to convex goal programming problems are exhibited. Some of the equivalences herein established are also useful in their own right and for other classes of problems--e.g., interval programming--as well as advanced start procedures and other such computational matters.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.4.438 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:22:y:1975:i:4:p:438-448

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().