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

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1973
Accession Number
AD0780791

Entities

People

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

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

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

Fields of Study

  • Mathematics

Readers

  • Government and Public Administration Law.
  • Operations Research