Robust Geometric Programming Approach to Profit Maximization with Interval Uncertainty release_tybnswc6ynbldbb5vygkszwbjm

by Hossein Aliabadi, Maziar Salahi

Published in Computer Science Journal of Moldova by Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova.

2013   Volume 21, Issue 1(61), p86-96

Abstract

Profit maximization is an important issue to the firms that pursue the largest economic profit possible. In this paper, we consider the profit-maximization problem with the known Cobb-Douglas production function. Its equivalent geometric programming form is given. Then due to the presence of uncertainties in real world modeling, we have assumed interval uncertainties on the model parameters. The robust counterpart is not known to be considered as a geometric program and efficiently solvable using interior point algorithms. Thus using piecewise convex linear approximations, an approximate equivalent of the robust counterpart is given, which is in the form of a geometric programming problem. Finally an example is presented showing the impact of uncertainties.
In text/plain format

Archived Files and Locations

application/pdf  160.2 kB
file_hazu2gly3jfrbcmhbfbpxteiue
www.math.md (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Year   2013
Language   en ?
Journal Metadata
Open Access Publication
In DOAJ
Not in Keepers Registry
ISSN-L:  1561-4042
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 157f3998-30e0-44c7-b783-0ca3275bd1a3
API URL: JSON