## Abstract

This paper presents a possible generalization of geometric programming problems. Such a generalization was proposed by Peterson [6], based on Rockafellar's [8] conjugate function theory. Using their results, we define a slightly different, more symmetric dual pair of general unconstrained geometric programming problems.

In the second chapter the conjugate function is defined and some of its properties are demonstrated. In the third chapter the general unconstrained geometric programming problem and its dual pair are introduced and some of its fundamental properties are proved. The primal optimality criteria is based on Peterson's papers [6,7] and the dual optimality criteria completes our examinations.

In the second chapter the conjugate function is defined and some of its properties are demonstrated. In the third chapter the general unconstrained geometric programming problem and its dual pair are introduced and some of its fundamental properties are proved. The primal optimality criteria is based on Peterson's papers [6,7] and the dual optimality criteria completes our examinations.

Original language | English |
---|---|

Pages (from-to) | 103-110 |

Number of pages | 8 |

Journal | Computers and Mathematics with Applications |

Volume | 21 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1 Jan 1991 |

## Keywords

- general geometric programming
- conjugate function
- optimality criteria
- stationary point