Bisection search algorithm for optimizing over the efficient set
---Publisher, magazine: ,
Publication year: 2000
Lưu Trích dẫn Chia sẻAbstract
We are concerned with the problem of maximizing a linear function over the efficient set related to a multiple-objective linear programing problem. Mathematically, this problem is classified as a global optimization problem. We propose an implementable algorithm, which is hoped to be efficient when the number criteria is small relative to the number of variables.
Tags: efficient set; multiple-objective linear programing; global optimization
Các bài viết liên quan đến tác giả Hoang Quang Tuyen
Bisection search algorithm for optimizing over the efficient set
An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem