A multiobjective steepest descent method with applications to optimal well control |
| |
| Authors: | Xin Liu Albert C Reynolds |
| |
| Institution: | 1.McDougall School of Petroleum Engineering,University of Tulsa,Tulsa,USA |
| |
| Abstract: | Multiobjective optimization deals with mathematical optimization problems where two or more objective functions (cost functions) are to be optimized (maximized or minimized) simultaneously. In most cases of interest, the objective functions are in conflict, i.e., there does not exist a decision (design) vector (vector of optimization variables) at which every objective function takes on its optimal value. The solution of a multiobjective problem is commonly defined as a Pareto front, and any decision vector which maps to a point on the Pareto front is said to be Pareto optimal. We present an original derivation of an analytical expression for the steepest descent direction for multiobjective optimization for the case of two objectives. This leads to an algorithm which can be applied to obtain Pareto optimal points or, equivalently, points on the Pareto front when the problem is the minimization of two conflicting objectives. The method is in effect a generalization of the steepest descent algorithm for minimizing a single objective function. The steepest-descent multiobjective optimization algorithm is applied to obtain optimal well controls for two example problems where the two conflicting objectives are the maximization of the life-cycle (long-term) net-present-value (NPV) and the maximization of the short-term NPV. The results strongly suggest the multiobjective steepest-descent (MOSD) algorithm is more efficient than competing multiobjective optimization algorithms. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
