Accession Number : AD0780792

Title :   Monomial Programming.

Descriptive Note : Research rept.,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s) : Shaftel,T. L. ; Smeers,Y. ; Thompson,G. L.

Report Date : MAR 1974

Pagination or Media Count : 22

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)

Descriptors :   *Linear programming, Simplex method, Convex sets, Algorithms

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE