A Smoothing Method for Solving Bilevel Multiobjective Programming Problems

Yibing Lü; Zhongping Wan

doi:10.1007/s40305-014-0059-6

ScienceGate Book Chapters

JOURNAL ARTICLE

A Smoothing Method for Solving Bilevel Multiobjective Programming Problems

Yibing Lü Zhongping Wan

Year: 2014 Journal: Journal of the Operations Research Society of China Vol: 2 (4)Pages: 511-525 Publisher: Springer Science+Business Media

DOI: 10.1007/s40305-014-0059-6

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematical optimization Karush–Kuhn–Tucker conditions Bilevel optimization Smoothing Mathematics Pareto principle Multi-objective optimization Pareto optimal Stationary point Multiobjective programming Optimization problem Computer science

Metrics

Cited By

1.00

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

Optimization and Mathematical Programming

Physical Sciences → Engineering → Control and Systems Engineering

Fiscal Policy and Economic Growth

Social Sciences → Economics, Econometrics and Finance → Economics and Econometrics

A Smoothing Method for Solving Bilevel Multiobjective Programming Problems

Metrics

Citation History

Topics

Related Documents

Solving Bilevel Linear Multiobjective Programming Problems

Solving quadratic convex bilevel programming problems using a smoothing method

A Smoothing Newton Method for Bilevel Programming Problems

Solving a class of multiobjective bilevel problems by DC programming

Solving a class of multiobjective bilevel problems by DC programming