Difference between revisions of "Exponential transformation"

From optimization
Jump to: navigation, search
Line 7: Line 7:
 
This article concerns the exponential transformation method for globally solving posynomial (or general geometric/signomial) optimization problems with nonconvex objective functions or constraints. A discussion of the method's development, use, and limitations will be presented.
 
This article concerns the exponential transformation method for globally solving posynomial (or general geometric/signomial) optimization problems with nonconvex objective functions or constraints. A discussion of the method's development, use, and limitations will be presented.
  
==History and Background==
+
==Background==
 
Before discussing methods to solve posynomial optimization problems, a brief review of posynomials is of use. A posynomial, as defined by Duffin, Peterson, and Zener (1967) as a function of the form
 
Before discussing methods to solve posynomial optimization problems, a brief review of posynomials is of use. A posynomial, as defined by Duffin, Peterson, and Zener (1967) as a function of the form
  
<math>f(x1,x2,...,xn)=sum_{k=1}^K c_{\text{k}}x_{\text{1}}^a_{\text{1k}}..x_{\text{n}}^a{\text{nk}}</math>
+
<math> f(x_1,x_2,...,x_n)=\sum_{k=1}^K c_kx_1^{a_{1k}}...x_n^{a_{nk}} </math>
===Original Development===
+
 
Content under subtitle 1.1.
+
where the variables <math> x_i </math> and the coefficients <math> c_k </math> are positive, real numbers, and all of the exponents <math> a_{ik} </math> are real numbers. For example,
 +
 
 +
<math> f(x_1,x_2)=14x_1^{3.2}x_2^{4}+x_1^2x_2^7 </math>
 +
 
 +
is a posynomial in two variables, and
 +
 
 +
<math> f(x_1)=1500x_1^{3/5} </math>
 +
 
 +
is a posynomial with one variable.
 +
 
 +
It is not difficult to imagine a posynomial that is nonconvext, such as the examples above. Unfortunately, this can cause some problems when attempting to find a globally optimal solution of a posynomial program, as it is known that only convex problems ''guarantee'' a global solution.
 +
 
 +
Posynomial or geometric programming has been applied to solve problems in varied fields, such as signal circuit design, engineering design, project management, and inventory management, just to name a few. Clearly, the solution of such problems are important to the chemical engineer, and being able to globally solve such problems will equip the engineer with a powerful tool to solve a myriad of problems.
 +
 
 +
===Development===
 +
To that end, many researchers attempted to solve such problems starting in the 1960's and 1970's. Methods used in the day aimed to find only locally optimal solutions, and employed methods such as successive approximation of posynomials (called "condensation").  
 
===Historical Use===
 
===Historical Use===
 
Give some examples here.
 
Give some examples here.

Revision as of 13:32, 25 May 2014

Author: Daniel Garcia (ChBE 345)

Stewards: Dajun Yue and Prof. Fengqi You

Date presented: May 25, 2014

This article concerns the exponential transformation method for globally solving posynomial (or general geometric/signomial) optimization problems with nonconvex objective functions or constraints. A discussion of the method's development, use, and limitations will be presented.

Contents

Background

Before discussing methods to solve posynomial optimization problems, a brief review of posynomials is of use. A posynomial, as defined by Duffin, Peterson, and Zener (1967) as a function of the form

 f(x_1,x_2,...,x_n)=\sum_{k=1}^K c_kx_1^{a_{1k}}...x_n^{a_{nk}}

where the variables  x_i and the coefficients  c_k are positive, real numbers, and all of the exponents  a_{ik} are real numbers. For example,

 f(x_1,x_2)=14x_1^{3.2}x_2^{4}+x_1^2x_2^7

is a posynomial in two variables, and

 f(x_1)=1500x_1^{3/5}

is a posynomial with one variable.

It is not difficult to imagine a posynomial that is nonconvext, such as the examples above. Unfortunately, this can cause some problems when attempting to find a globally optimal solution of a posynomial program, as it is known that only convex problems guarantee a global solution.

Posynomial or geometric programming has been applied to solve problems in varied fields, such as signal circuit design, engineering design, project management, and inventory management, just to name a few. Clearly, the solution of such problems are important to the chemical engineer, and being able to globally solve such problems will equip the engineer with a powerful tool to solve a myriad of problems.

Development

To that end, many researchers attempted to solve such problems starting in the 1960's and 1970's. Methods used in the day aimed to find only locally optimal solutions, and employed methods such as successive approximation of posynomials (called "condensation").

Historical Use

Give some examples here.

Limitations

Discuss limitations here

Conclusions

Content under conclusions S_{\text{new}} = S_{\text{old}} - \frac{ \left( 5-T \right) ^2} {2}