A geometric programming approach to profit maximization
type: Item
instance of: scholarly article
title: A geometric programming approach to profit maximization
zbMATH Open document ID: 1151.91596
author: N. E. Zubov
published in: Applied Mathematics and Computation
publication date: 2007-01-11T00:00:00Z
Mathematics Subject Classification ID: 91B38
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5115381
zbMATH Keywords: geometric programming
zbMATH Keywords: profit
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: optimization
MaRDI profile type: Publication
full work available at URL: j.amc.2006.04.061
OpenAlex ID: W2043933006
cites work: Computing the steady state of linear quadratic optimization models with rational expectations
cites work: Q4113605
cites work: Individual excess demands.
cites work: Innovations, improvements, and the optimal adoption of new technologies
cites work: Q5557595
cites work: Equilibrium selection in games: the mollifier method
cites work: Comparative statics without total differentiation of the first-order conditions
cites work: The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
cites work: Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
cites work: Solving posynomial geometric programming problems via generalized linear programming
DOI: 10.1016/J.AMC.2006.04.061
description: scientific article; zbMATH DE number 5115381