English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this study, we research the problem of network revenue management with customer choice based on the Origin-Destination (O-D) demands. By dividing customers into different segments according to 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. The affine function approximation results in a new Linear Program (LP) which yields tighter bounds than the Choice-based Deterministic Linear Program (CDLP). We give a column generation procedure for solving the LP within a desired optimality tolerance and present numerical results which show the policy perform from our solution approach can outperform that from the CDLP.

On the Origin-Destination Demands Linear Programming Model for Network Revenue Management with Customer Choice