The University of Southampton
University of Southampton Institutional Repository

Newton-type method for bilevel programs with linear lower level problem and application to toll optimization

Newton-type method for bilevel programs with linear lower level problem and application to toll optimization
Newton-type method for bilevel programs with linear lower level problem and application to toll optimization
We consider a bilevel program involving a linear lower level problem with left-hand-side perturbation. We then consider the Karush-Kuhn-Tucker reformulation of the problem and subsequently build a tractable optimization problem with linear constraints by means of a partial exact penalization. A semismooth system of equations is then generated from the later problem and a Newton-type method is developed to solve it. Finally, we illustrate the convergence and practical implementation of the algorithm on the optimal toll-setting problem in transportation networks.
math.OC
2331-8422
Kue, Floriane Mefo
c2971f52-f057-4549-ac12-8522e178d1a3
Raasch, Thorsten
d74c3a87-4327-4d17-b69a-3ca798d4ec05
Zemkoho, Alain B.
30c79e30-9879-48bd-8d0b-e2fbbc01269e
Kue, Floriane Mefo
c2971f52-f057-4549-ac12-8522e178d1a3
Raasch, Thorsten
d74c3a87-4327-4d17-b69a-3ca798d4ec05
Zemkoho, Alain B.
30c79e30-9879-48bd-8d0b-e2fbbc01269e

Kue, Floriane Mefo, Raasch, Thorsten and Zemkoho, Alain B. (2020) Newton-type method for bilevel programs with linear lower level problem and application to toll optimization. arXiv. (In Press)

Record type: Article

Abstract

We consider a bilevel program involving a linear lower level problem with left-hand-side perturbation. We then consider the Karush-Kuhn-Tucker reformulation of the problem and subsequently build a tractable optimization problem with linear constraints by means of a partial exact penalization. A semismooth system of equations is then generated from the later problem and a Newton-type method is developed to solve it. Finally, we illustrate the convergence and practical implementation of the algorithm on the optimal toll-setting problem in transportation networks.

Text
2010.11662v1 - Accepted Manuscript
Available under License Other.
Download (298kB)

More information

Accepted/In Press date: 22 October 2020
Keywords: math.OC

Identifiers

Local EPrints ID: 508443
URI: http://eprints.soton.ac.uk/id/eprint/508443
ISSN: 2331-8422
PURE UUID: 5b8e1ab7-42cd-4219-8f26-72dcd957d2ee
ORCID for Alain B. Zemkoho: ORCID iD orcid.org/0000-0003-1265-4178

Catalogue record

Date deposited: 21 Jan 2026 17:50
Last modified: 22 Jan 2026 02:46

Export record

Contributors

Author: Floriane Mefo Kue
Author: Thorsten Raasch

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×