Modified geometric programming problem and its applications

DOI10.1007/BF02936045MaRDI QIDQ1767375zbMATH OpenFDO

Authors Sahidul Islam, Tapan Kumar Roy

Publication date 10 March 2005

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02936045

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Integer programming (90C10)

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.

Recommendations

• A general alternative procedure for solving negative degree of difficulty problems in geometric programming
• On geometric programming problems having negative degrees of difficulty
• scientific article; zbMATH DE number 3876494
• Fuzzy unconstrained parametric geometric programming problem and its application
• A new linearization method for posynomial constrained generalized geometric programming

Cites work

• Geometric programming problems with negative degrees of difficulty
• Geometric Programming: Methods, Computations and Applications
• scientific article; zbMATH DE number 3499143 (Why is no real title available?)
• scientific article; zbMATH DE number 3537446 (Why is no real title available?)
• scientific article; zbMATH DE number 1240765 (Why is no real title available?)
• scientific article; zbMATH DE number 1779725 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)

Cited in

(14)

• On geometric programming problems having negative degrees of difficulty
• Optimization of \(c\)-orthogonal posynomials
• Multi-objective marketing planning inventory model: a geometric programming approach
• Fuzzy unconstrained parametric geometric programming problem and its application
• Two problems with GGP generalized geometric programming algorithm
• scientific article; zbMATH DE number 3876494 (Why is no real title available?)
• Fuzzy geometric programming approach in multi-objective multivariate stratified sample surveys in presence of non-response
• scientific article; zbMATH DE number 4029276 (Why is no real title available?)
• Optimal design modifications by geometric programming and constrained stochastic network models
• Geometric programming with multiplicative slack variables
• Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• Fuzzy multi-item economic production quantity model under space constraint: a geometric programming approach
• Fuzzy geometric programming approach in multivariate stratified sample surveys under two stage randomized response model

This page was built for publication: Modified geometric programming problem and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767375)