2008•Journal of Jiamusi UniversityRequires access

A Globally Convergent Algorithm for Solving Bilevel Linear Programming Problem

Yigang Sun

Abstract

In this paper,bilevel linear programming is considered by analyzing the structural characteristics of the bilevel linear programming feasible domain,and the result that a global optional solution to bilinear programming occurs at an extreme point of its constraint region.A demarcation on the upper objection function of the bilevel linear programming was carried out by making use of the dichotomy principle.A bilinear programming to amend the current boundary was constructed until getting the global optimal solution to the bilevel linear programming.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Bilevel optimization, Bilinear interpolation, Linear programming, Mathematical optimization, Extreme point, Domain (mathematical analysis), Mathematics, Linear-fractional programming