17 Result(s)

Article

Benders decomposition for variational inequalities

The partitioning technique of J.F. Benders, which was generalized to nonlinear programming by Geoffrion, is further generalized to linearly constrained variational inequality problems. The conditions under whi...

Siriphong Lawphongpanich, D. W. Hearn in Mathematical Programming (1990)

Article

Book reviews

Ding -Zhu Du, Siriphong Lawphongpanich in Journal of Global Optimization (1993)

Reference Work Entry In depth

Rosen's method, global convergence, and Powell's conjectureCost approximation algorithms; Simplicial decomposition; Stochastic transportation and location problems; Traffic network equilibriumFRANK–WOLFE ALGORITHM

Siriphong Lawphongpanich in Encyclopedia of Optimization (2001)

Reference Work Entry In depth

Convex-Simplex Algorithm

Siriphong Lawphongpanich in Encyclopedia of Optimization (2001)

Reference Work Entry In depth

Simplicial Decomposition

Siriphong Lawphongpanich in Encyclopedia of Optimization (2001)

Article

An MPEC approach to second-best toll pricing

This paper addresses two second-best toll pricing problems, one with fixed and the other with elastic travel demands, as mathematical programs with equilibrium constraints. Several equivalent nonlinear program...

Siriphong Lawphongpanich, Donald W. Hearn in Mathematical Programming (2004)

Chapter

Relaxed Toll Sets for Congestion Pricing Problems

Congestion or toll pricing problems in [HeR98] require a solution to the system problem (the traffic assignment problem that minimizes the total travel delay) to define the set of all valid tolls or the toll set....

Lihui Bai, Donald W. Hearn… in Mathematical and Computational Models for … (2006)

Article

Dynamic Slope Scaling Procedure and Lagrangian Relaxation with Subproblem Approximation

The dynamic slope scaling procedure (DSSP) is an efficient heuristic algorithm that provides good solutions to the fixed-charge transportation or network flow problem. However, the procedure is graphically mot...

Siriphong Lawphongpanich in Journal of Global Optimization (2006)

Article

Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum

This paper proposes a system optimal dynamic traffic assignment model that does not require the network to be empty at the beginning or at the end of the planning horizon. The model assumes that link travel ti...

Artyom Nahapetyan, Siriphong Lawphongpanich in Journal of Global Optimization (2007)

Reference Work Entry In depth

Convex-Simplex Algorithm

Keywords

Siriphong Lawphongpanich in Encyclopedia of Optimization (2009)

Reference Work Entry In depth

Simplicial Decomposition

Keywords

Siriphong Lawphongpanich in Encyclopedia of Optimization (2009)

Reference Work Entry In depth

Frank–Wolfe Algorithm

Keywords

Siriphong Lawphongpanich in Encyclopedia of Optimization (2009)

Chapter

An Active-set Algorithm for Discrete Network Design Problems

In this paper, we formulate a discrete network design problem as a mathematical program with complementarity constraints and propose an active set algorithm to solve the problem. Each complementarity constrain...

Lihui Zhang, Siriphong Lawphongpanich… in Transportation and Traffic Theory 2009: Go… (2009)

Article

Alternative marginal-cost pricing for road networks

In the literature, several studies have algebraically characterized the set of toll vectors or patterns that, when added to a user equilibrium problem, its solution would be system optimal. Toll vectors in thi...

Yafeng Yin, Siriphong Lawphongpanich in NETNOMICS: Economic Research and Electroni… (2009)

Article

A heuristic method for the minimum toll booth problem

This paper addresses the toll pricing problem in which the objective is to minimize the number of required toll facilities in a traffic network. The problem is shown to be NP-hard. To obtain a solution in a re...

Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich in Journal of Global Optimization (2010)