A NOTE ON THE PARETO OPTIMALITY OF SOLUTIONS TO THE LINEAR BILEVEL PROGRAMMING PROBLEM

被引：21

作者：

MARCOTTE, P

SAVARD, G

机构：

[1] COLL MIL ROYAL ST JEAN,DEPT MATH,RICHELIN J0J 1R0,QUEBEC,CANADA

[2] UNIV MONTREAL,CTR RECH TRANSPORTS,RICHELIN J0J 1R0,QUEBEC,CANADA

[3] ECOLE POLYTECH,GERAD,MONTREAL H3C 3A7,QUEBEC,CANADA

来源：

COMPUTERS & OPERATIONS RESEARCH | 1991年 / 18卷 / 04期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1016/0305-0548(91)90096-A

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this note it is shown that no general hypothesis on the cost functions can guarantee that a Pareto optimal solution to a linear bilevel programming problem exists. Indeed, whatever the leader's and follower's objectives, it is always possible to design constraints such that the resulting linear bilevel problem's solution is not Pareto optimal.

引用

页码：355 / 359

页数：5

共 12 条

[1] AN EFFICIENT POINT ALGORITHM FOR A LINEAR 2-STAGE OPTIMIZATION PROBLEM [J].