Vector-Valued Criteria in Geometric Programming

Published Online:https://doi.org/10.1287/opre.19.1.98

This paper derives, as optimal solutions of ordinary geometric programs, efficient and properly efficient solutions of geometric programming problems with vector-valued criteria.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.