Abstract
Bilevel optimzation is attracting scientists due to its scientific significance and wide applicability in practice. The bilevel programming in books and magazines is often related to hierarchies. The bilevel optimzation includes two optimal problems, in which a part of the data of the first problem is identified through the solution of the second problem. The decision maker at each level tries to optimize (minimum or maximum) the function of his own level without paying attention to the goal of the other level but the decision of each level affects the target value of both levels and the decision space in general. The math model of bilevel optimzation along with the convexificator tool used to establish optimal conditions for the problem is presented in this paper.
Keywords: Problem, bilevel programming, convexificator, solution, optimization.
JEL classification: C; C02
Để đọc toàn văn vui lòng nhấn vào xem chi tiết.
Ban biên tập Tạp chí Kinh tế & Quản trị Kinh doanh
Phòng 514, Nhà điều hành, trường Đại học Kinh tế & Quản trị Kinh doanh
Địa chỉ: Phường Tân Thịnh, thành phố Thái Nguyên
Email: tapchikt-qtkd@tueba.edu.vn; Điện thoại: 0208.3903373
