Explicit Solutions in Convex Goal Programming

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 Service. 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1974
Accession Number
AD0784417

Entities

People

  • Abraham Charnes
  • D. Klingman
  • R. J. Niehaus
  • William W. Cooper

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Algorithms
  • Commerce
  • Computer Programming
  • Contracts
  • Evolutionary Algorithms
  • Goal Programming
  • Intervals
  • Linear Programming
  • Manpower
  • Markov Processes
  • Military Research
  • Nonlinear Programming
  • Optimization
  • Personnel Management
  • United States
  • Universities

Readers

  • Defense Acquisition Program Management
  • Operations Research
  • Systems Analysis and Design