Monomial Programming.

Abstract

A monomial programming problem is one of minimizing a polynomial in several variables subject to monomial constraints. A log transformation changes it into a problem with non-linear objective and linear constraints which, under certain conditions can be solved by Zangwill's convex simplex method. The authors show a direct method, based on previous work, of solving the problem using a simplex-like tableau which (usually) requires less effort than the convex simplex method. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1974
Accession Number
AD0780792

Entities

People

  • Gerald L. Thompson
  • T. L. Shaftel
  • Y. Smeers

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Mathematics
  • Polynomials
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Operations Research