A Linear Programming Approximation for Network Capacity Control Problem with Customer Choice

Feng Liu (), Ying Qu () and Yanan Wang
Additional contact information
Feng Liu: The Central Institute for Correctional Police
Ying Qu: Hebei University of Science and Technology
Yanan Wang: Hebei University of Science and Technology

A chapter in LISS 2012, 2013, pp 1367-1373 from Springer

Abstract: Abstract By dividing customers into different segments according to origin destination (O-D) pairs, we consider a network capacity control problem where each customer chooses the open product within the segment he belongs to. Starting with a Markov decision process (MDP) formulation, we approximate the value function with an affine function of the state vector and develop our model based on the O-D demands. The affine function approximation results in a linear program (LP). We give a column generation procedure for solving the dual problem of the LP and provide the numerical results.

Keywords: Network revenue management; Choice behavior; Dynamic programming; Linear programming (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-32054-5_194

Ordering information: This item can be ordered from
http://www.springer.com/9783642320545

DOI: 10.1007/978-3-642-32054-5_194

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().