The aim of the paper is to suggest a sequential method for generating the set E of all efficient points of a bicriteria problem P B where the feasible region is a polytope and whose criteria are a linear function and a concave function which is the sum of a linear and the reciprocal of an affine function. The connectedness of E and some theoretical properties of P B allow to give a finite simplex-like algorithm based on a suitable post-optimality analysis carried on a scalar parametric problem where the linear criteria plays the role of a parametric constraint.
A Sequential Method for a Class of Bicriteria Problems
MARTEIN, LAURA;
2006-01-01
Abstract
The aim of the paper is to suggest a sequential method for generating the set E of all efficient points of a bicriteria problem P B where the feasible region is a polytope and whose criteria are a linear function and a concave function which is the sum of a linear and the reciprocal of an affine function. The connectedness of E and some theoretical properties of P B allow to give a finite simplex-like algorithm based on a suitable post-optimality analysis carried on a scalar parametric problem where the linear criteria plays the role of a parametric constraint.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
