A NEW APPROACH TO ZERO DUALITY GAP OF VECTOR OPTIMIZATION PROBLEMS USING CHARACTERIZING SETS

  • Dang Hai Long
  • Tran Hong Mo*
Keywords: Characterizing set, vector optimization problems, zero dualiy gap.

Abstract

In this paper we propose results on zero duality gap in vector optimization problems posed in a real locally convex Hausdorff topological vector space with a vector-valued objective function to be minimized under a set and a convex cone constraint. These results are then applied to  linear programming.

 Author Information

Dang Hai Long1 and  Tran Hong Mo2*

1Faculty of Natural Sciences, Tien Giang University

2Office of Academic Affairs, Tien Giang University

*Corresponding author: tranhongmo@tgu.edu.vn

Article history

Received: 25/08/2020; Received in revised form: 25/09/2020; Accepted: 28/09/2020

điểm /   đánh giá
Published
2020-10-19
Section
NGHIÊN CỨU