Modified geometric programming problem and its applications
type: Item
instance of: scholarly article
title: Modified geometric programming problem and its applications
zbMATH Open document ID: 1138.90321
DOI: 10.1007/BF02936045
author: Sahidul Islam
author: Tapan Kumar Roy
published in: Journal of Applied Mathematics and Computing
publication date: 2005-03-10T00:00:00Z
review text: We propose unconstrained and constrained polynomial Geometric Programming (GP) problem with negative or positive integral degree of difficulty. Conventional GP approach has been modified to solve some special type of GP problems. In specific case, when the degree of difficulty is negative, the normality and the orthogonality conditions of the dual program give a system of linear equations. No general solution vector exists for this system of linear equations. But an approximate solution can be determined by the least square and also max-min method. Here, modified form of geometric programming method has been demonstrated and for that purpose necessary theorems have been derived. Finally, these are illustrated by numerical examples and applications.
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 2143252
MaRDI profile type: Publication
cites work: Q4542926
cites work: Q4113605
cites work: Q5557595
cites work: Geometric Programming: Methods, Computations and Applications
cites work: Q4879581
cites work: Q4224451
cites work: Q4080636
cites work: Geometric programming problems with negative degrees of difficulty
description: scientific article; zbMATH DE number 2143252