Analytic efficient solution set for multi-criteria quadratic programs

doi:10.1016/0377-2217(95)00040-2

1996-07-01

PRE

C.J. Goh

Xiaoqi Yang

DOI：10.1016/0377-2217(95)00040-2

原文链接

原文求助

摘要

En 中文

We present active set methods to evaluate the exact analytic efficient solution set for multi-criteria convex quadratic programming problems (MCQP) subject to linear constraints. The idea is based on the observations that a strictly convex programming problem admits a unique solution, and that the efficient solution set for a multi-criteria strictly convex quadratic programming problem with linear equality constraints can be parameterized. The case of bi-criteria quadratic programming (BCQP) is first discussed since many of the underlying ideas can be explained much more clearly in the case of two objectives. In particular we note that the efficient solution set of a BCQP problem is a curve on the surface of a polytope. The extension to problems with more than two objectives is straightforward albeit some slightly more complicated notation. Two numerical examples are given to illustrate the proposed methods.

Keyword:

quadratic programming

multiple criteria

active set methods

analytic solution