A smoothing method for solving bilevel multiobjective programming problems
From MaRDI portal
Publication:489158
DOI10.1007/S40305-014-0059-6zbMATH Open1308.90099OpenAlexW2049748902MaRDI QIDQ489158FDOQ489158
Authors: Yibing Lü, Zhongping Wan 
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0059-6
Recommendations
- A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
- A smoothing objective penalty function algorithm for bilevel programming problems
- Solving quadratic convex bilevel programming problems using a smoothing method
- A penalty function method for solving a class of weak linear bilevel multi-objective programming problems
- An objective penalty function algorithm for bilevel programming based on multi-parameters
Cites Work
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Foundations of bilevel programming
- New optimality conditions for the semivectorial bilevel optimization problem
- A solution method for semivectorial bilevel programming problem via penalty method
- Semivectorial bilevel optimization problem: penalty approach
- An overview of bilevel optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Multiobjective bilevel optimization
- A smoothing method for mathematical programs with equilibrium constraints
- A multi-level nonlinear multi-objective decision-making under fuzziness
- A bi-level non-linear multi-objective decision making under fuzziness.
- Model and interactive algorithm of bi-level multi-objective decision-making with multiple interconnected decision makers
- Necessary optimality conditions for multiobjective bilevel programs
- Interactive bilevel multi-objective decision making
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Title not available (Why is that?)
Cited In (11)
- Solving quadratic convex bilevel programming problems using a smoothing method
- Multiobjective optimal control of a non-smooth semilinear elliptic partial differential equation
- Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations
- Methods for Multiobjective Bilevel Optimization
- A new method for solving multiobjective bilevel programs
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Title not available (Why is that?)
- Improved smoothed analysis of multiobjective optimization
This page was built for publication: A smoothing method for solving bilevel multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489158)
