Pith. sign in

REVIEW

A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1705.06270 v2 pith:LSZMRW2Y submitted 2017-05-17 math.OC cs.NE

classification math.OCcs.NE
keywords optimizationbilevelevolutionaryproblemsapplicationsattentionclassicalcomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Bilevel optimization is defined as a mathematical program, where an optimization problem contains another optimization problem as a constraint. These problems have received significant attention from the mathematical programming community. Only limited work exists on bilevel problems using evolutionary computation techniques; however, recently there has been an increasing interest due to the proliferation of practical applications and the potential of evolutionary algorithms in tackling these problems. This paper provides a comprehensive review on bilevel optimization from the basic principles to solution strategies; both classical and evolutionary. A number of potential application problems are also discussed. To offer the readers insights on the prominent developments in the field of bilevel optimization, we have performed an automated text-analysis of an extended list of papers published on bilevel optimization to date. This paper should motivate evolutionary computation researchers to pay more attention to this practical yet challenging area.

Discussion (0). Continue with ORCID to comment.

Pith tools