An Improved Dynamic Programming Decomposition Approach for Network Revenue Management


 Leo Mason
 2 years ago
 Views:
Transcription
1 An Improved Dynamic Programming Decomposition Approach for Network Revenue Management Dan Zhang Leeds School of Business University of Colorado at Boulder May 21, 2012
2 Outline Background Network revenue management formulation Classical dynamic programming decomposition An improved dynamic programming decomposition Numerical results Summary
3 Network RM Formulation (Gallego and van Ryzin, 1997; Gallego et. al., 2004; Liu and van Ryzin, 2008) m resources with capacity c (an mvector) Capacity for resource i is c i. n products N = {1,..., n} Fare for product j is f j Product consumption matrix A = [a ij ] Finite time horizon with length τ In each period, there is one customer arrival with probability λ, and no customer arrival with probability 1 λ. Given a set of products S N, a customer chooses product j with probability P j (S). Nopurchase probability P 0 (S) = 1 j S P j (S). Objective: Maximize expected total revenue
4 Applications Industry Resources Products Airlines Scheduled flights OD itineraries at certain fare levels Hotels Roomdays Single(multi)day stays at certain rates Car rentals Cardays Single(multi)day rentals at certain rates Air Cargo Scheduled flights (weight) OD shipments at certain rates Scheduled flights (volume)
5 Dynamic Programming Formulation DP optimality equations: v t (x) = v τ+1 (x) = 0, max S N(x) { λ j S P j (S)(f j + v t+1 (x A j )) } + (λp 0 (S) + 1 λ)v t+1 (x), t, x, x. Notations v t (x): DP value function A j : resource incidence vector of product j N(x): {j N : x A j }
6 Dynamic Programming Formulation DP optimality equations: v t (x) = v τ+1 (x) = 0, max S N(x) { λ j S P j (S)(f j + v t+1 (x A j )) } + (λp 0 (S) + 1 λ)v t+1 (x), t, x, x. Notations v t (x): DP value function A j : resource incidence vector of product j N(x): {j N : x A j } Curse of dimensionality: state space grows exponentially with the number of resources
7 Choicebased Deterministic Linear Program (CDLP) z CDLP = max h S N λr(s)h(s) S N λq(s)h(s) c, h(s) τ, S N (Resource constraint) (Time constraint) h(s) 0, S N. (Nonnegativity) Replace stochastic demand with deterministic fluid with rate λ Given offer set S N Total time S is offered: h(s) Revenue from unit demand: R(S) = j S f jp j (S) Consumption of resource i from unit demand: Q i (S) = j S a ijp j (S)
8 CDLP (Gallego et. al, 2004; Liu and van Ryzin, 2008) CDLP can by efficiently solved for certain class of choice models. The vector of dual values π associated with resource constraints can be used as bidprices for resources z CDLP provides an upper bound on revenue Some recent references: Talluri (2010): Concave programming formulation Gallego, Ratliff, Shebalov (2011): Efficient reformulation
9 Classical Dynamic Programming Decomposition For each i, approximate the DP value function with v t(x) v t,i (x i ) + πk x k, } {{ } k i Value of the } {{ } ith resource Value of all other resources t, x.
10 Classical Dynamic Programming Decomposition For each i, approximate the DP value function with v t(x) v t,i (x i ) + πk x k, } {{ } k i Value of the } {{ } ith resource Value of all other resources t, x. Using the approximation in DP recursion leads to ( v t,i (x i ) = max λp j (S) f j ) a kj πk +v t+1,i (x i a ij ) S N(x i,c i ) j S k i } {{ } Fare proration + (λp 0(S) + 1 λ)v t+1(x i ), t, x i.
11 Classical Dynamic Programming Decomposition For each i, approximate the DP value function with v t(x) v t,i (x i ) + πk x k, } {{ } k i Value of the } {{ } ith resource Value of all other resources t, x. Using the approximation in DP recursion leads to ( v t,i (x i ) = max λp j (S) f j ) a kj πk +v t+1,i (x i a ij ) S N(x i,c i ) j S k i } {{ } Fare proration + (λp 0(S) + 1 λ)v t+1(x i ), t, x i. Compute offer sets dynamically using the approximate value function v t(x) i v t,i (x i ), t, i.
12 Classical Dynamic Programming Decomposition A DP with mdimensional state space is reduced to m onedimensional DPs, one for each resource states (Assume 100 seats per flight) states
13 Classical Dynamic Programming Decomposition A DP with mdimensional state space is reduced to m onedimensional DPs, one for each resource states (Assume 100 seats per flight) states Variants of the approach are widely used in practice. Review: Talluri and van Ryzin (2004a)
14 DP Decomposition Bounds Proposition (Zhang and Adelman, 2009) The following relationships hold: (i) v t (x) min l=1,...,m {v t,l (x l ) + } k l π k x k v t,i (x i ) + k i π k x k, i, t, x; (ii) v 1 (c) v 1,i (c i ) + k i π k c k z CDLP, i. Decomposition value for each leg provides an upper bound on revenue Decomposition bounds are tighter than the bound from CDLP
15 Linear Programming Formulation of DP (Adelman, 2007) min v 1 (c) {v t( )} t v t (x) j S λp j (S)(f j + v t+1 (x A j )) + (λp 0 (S) + 1 λ)v t+1 (x), t, x, S N(x).
16 Linear Programming Formulation of DP (Adelman, 2007) min v 1 (c) {v t( )} t v t (x) j S λp j (S)(f j + v t+1 (x A j )) + (λp 0 (S) + 1 λ)v t+1 (x), t, x, S N(x). Huge number of decision variables and constraints
17 Linear Programming Formulation of DP (Adelman, 2007) min v 1 (c) {v t( )} t v t (x) j S λp j (S)(f j + v t+1 (x A j )) + (λp 0 (S) + 1 λ)v t+1 (x), t, x, S N(x). Huge number of decision variables and constraints Functional approximation idea: use a parameterized representation of the value function to reduce the number of decision variables
18 The Affine Functional Approximation (Zhang and Adelman, 2009) Affine approximation is given by v t (x) θ t + i V t,i x i, t, x. (1)
19 The Affine Functional Approximation (Zhang and Adelman, 2009) Affine approximation is given by v t (x) θ t + i V t,i x i, t, x. (1) Using (1) in the linear programming formulation leads to min θ,v θ1 + i V 1,i c i ( θ t + V t,i x i λp j (S) f j + θ t+1 + V t+1,i (x i a ij ) i j S i ( + (λp 0(S) + 1 λ) θ t+1 + ) V t+1,i x i, t, x, S N(x). i )
20 The Affine Functional Approximation The dual program is given by z P1 = max λp j (S)f j Y t,x,s Y t,x,s N(x) j S { c i, if t = 1, x i Y t,x,s = x,s N(x) (x i ) j S λp j (S)a ij Y t 1,x,S, t = 2,..., τ x,s N(x) { Y t,x,s = 1, if t = 1, x,s N(x) Y t 1,x,S, t = 2,..., τ. x,s N(x) Y 0. i, t,
21 The Affine Functional Approximation The dual program is given by z P1 = max λp j (S)f j Y t,x,s Y t,x,s N(x) j S { c i, if t = 1, x i Y t,x,s = x,s N(x) (x i ) j S λp j (S)a ij Y t 1,x,S, t = 2,..., τ x,s N(x) { Y t,x,s = 1, if t = 1, x,s N(x) Y t 1,x,S, t = 2,..., τ. x,s N(x) Y 0. i, t, Due to the large number of columns, solving the linear program above still requires considerable computational effort.
22 Functional Approximation Approaches for Network RM Citation Choice Model Functional approximation Solution strategy Adelman (2007) Independent demand Affine Column generation Zhang and Adelman (2009) MNLD Affine Column generation Zhang (2011) MNLD Nonlinear nonseparable CDLP+Simultaneous DP Liu and van Ryzin (2008) MNLD Separable (fare proration) CDLP+DP Decomposition Miranda Bront et. al. (2009) MNLO Separable (fare proration) CDLP+DP Decomposition Farias and Van Roy (2008) Independent demand Separable concave Constraint sampling Meissner and Strauss (2012) MNLD Separable concave Column generation Kunnumkal and MNLD Separable (fare proration) Convex programming Topaloglu (2011) +DP Decomposition Tong and Topaloglu (2011) Independent demand Affine Reduction + Constraint generation Vossen and Zhang Independent demand Affine Reduction + MNLD + Dynamic disaggregation MNLD: Multinomial logit model with disjoint consideration sets MNLO: Multinomial logit model with overlapping consideration sets
23 Research Questions Computational cost: ADP (affine or separable concave approximation) classical DP decomposition
24 Research Questions Computational cost: ADP (affine or separable concave approximation) classical DP decomposition How can we balance solution quality with solution time? Can we improve the classical DP decomposition?
25 A Strong Functional Approximation (Zhang, 2011) v t (x) min ˆv t,i(x i ) + πk x k, t, x. i k i Nonlinear and nonseparable functional approximation Each value v t (x) is approximated by a single value across legs Motivated by the decomposition bounds (Zhang and Adelman, 2009)
26 A Nonlinear Optimization Problem Using the new functional approximation leads to z NLP = min min ˆv 1,i(c i ) + πk c k ˆv t,i ( ) t,i i k i min ˆv t,i(x i ) + πk x k i k i λp j (S) f j + min ˆv t+1,l(x l a lj ) + πk (x k a kj ) l j S k l + (λp 0(S) + 1 λ)min ˆv t+1,l(x l ) + πk x k l, t, x, S N(x). k l The problem is a nonlinear optimization problem with a huge number of nonlinear constraints.
27 A Restricted Optimization Problem Step 1: Writing each constraint as m equivalent constraints Step 2: Restricting the constraints so that each constraint only involves one resource The restricted problem provides a relaxed bound: Proposition The objective value of the restricted program, z NLP, is bigger than z NLP.
28 An Equivalent Simultaneous Dynamic Program ˆv t,i(x i ) = max S N(x i,c i ) { min l i ( { λp j (S) f j + min ˆv t+1,i(x i a ij ) πk a kj, j S k i max [ˆv t+1,l(y l ) y l πl ] } }) a kj πk + πi x i 0 y l c l a lj k + (λp 0(S) + 1 λ) min i, t, x i. { ˆv t+1,i(x i ), min l i { max 0 y l c l [ˆv t+1,l(y l ) π l y l ] + π i x i DP recursion for resource i involves values from all other resources }}
29 An Equivalent Simultaneous Dynamic Program ˆv t,i(x i ) = max S N(x i,c i ) { min l i ( { λp j (S) f j + min ˆv t+1,i(x i a ij ) πk a kj, j S k i max [ˆv t+1,l(y l ) y l πl ] } }) a kj πk + πi x i 0 y l c l a lj k + (λp 0(S) + 1 λ) min i, t, x i. { ˆv t+1,i(x i ), min l i { max 0 y l c l [ˆv t+1,l(y l ) π l y l ] + π i x i DP recursion for resource i involves values from all other resources The dynamic program is equivalent to the restricted nonlinear program can be solved efficiently via a simultaneous dynamic programming algorithm leads to tighter revenue bounds }}
30 New Bounds Proposition (Zhang, 2011) Let {ˆv t,i ( )} t,i,x i be the optimal solution from the simultaneous dynamic program. The following results hold: (i) ˆv t,i (x i) v t,i (x i ), i, x i ; (ii) v 1 (c) z NLP z NLP = min i {ˆv 1,i (c i) + } k i π k c k min i {v 1,i (c i ) + } k i π k c k z CDLP. The simultaneous dynamic program provides tighter bounds on revenue than the classical decomposition.
31 Recap High dimensional dynamic program
32 Recap High dimensional dynamic program Large scale linear program
33 Recap High dimensional dynamic program Large scale linear program Large scale nonlinear program with nonlinear constraints
34 Recap High dimensional dynamic program Large scale linear program Large scale nonlinear program with nonlinear constraints Restricted nonlinear program with nonlinear constraints
35 Recap High dimensional dynamic program Large scale linear program Large scale nonlinear program with nonlinear constraints Restricted nonlinear program with nonlinear constraints Simultaneous dynamic program
36 Comparison: Classical vs. Improved Approaches Classical dynamic programming decomposition: Solve m singleleg DPs Prorated fares Fare proration Static bidprices Solve CDLP
37 Comparison: Classical vs. Improved Approaches Classical dynamic programming decomposition: Solve m singleleg DPs Prorated fares Fare proration Static bidprices Solve CDLP Network effects only captured through fare proration
38 Comparison: Classical vs. Improved Approaches Classical dynamic programming decomposition: Solve m singleleg DPs Prorated fares Fare proration Static bidprices Solve CDLP Network effects only captured through fare proration Improved dynamic programming decomposition: Solve one simultaneous DP Static bidprices Solve CDLP
39 Comparison: Classical vs. Improved Approaches Classical dynamic programming decomposition: Solve m singleleg DPs Prorated fares Fare proration Static bidprices Solve CDLP Network effects only captured through fare proration Improved dynamic programming decomposition: Solve one simultaneous DP Static bidprices Solve CDLP Network effects captured during DP recursion!
40 Computational Study: Problem Instances Randomly generated hubandspoke instances Number of nonhub locations (flights) in the set {4, 8, 16, 24} Number of periods in the set {100, 200, 400, 800} Two products for each possible itinerary Multinomial Logit Choice Model with Disjoint Consideration Sets (MNLD) Largest problem instance: 24 nonhub locations (flights), 336 products, 800 periods
41 Numerical Study: Policies DCOMP1: the new decomposition approach where the approximation m v t (x) ˆv t,i(x i ), t, x i=1 is used to compute control policies. DCOMP: the classical dynamic programming decomposition CDLP: static bidprice policy based on the dual values of resource constraints in CDLP CDLP10: A version of CDLP that resolves 10 times with equally spaced resolving intervals Each policy is simulated times
42 Computational Time Case # Parameters Capacity Load CPU seconds DCOMP1 DCOMP per leg factor CDLP DCOMP DCOMP1 DCOMP A1 (100,4,4,16) % A2 (200,4,4,16) % A3 (400,4,4,16) % A4 (800,4,4,16) % A5 (100,8,8,48) % A6 (200,8,8,48) % A7 (400,8,8,48) % A8 (800,8,8,48) % A9 (100,16,16,160) % A10 (200,16,16,160) % A11 (400,16,16,160) % A12 (800,16,16,160) % A13 (100,24,24,336) % A14 (200,24,24,336) % A15 (400,24,24,336) % A16 (800,24,24,336) %
43 Bound Performance Case # CDLP DCOMP DCOMP1 Bound improvement %difference across legs bound bound bound %CDLP %DCOMP DCOMP DCOMP1 A % 4.74% 4.46% 0.00% A % 1.55% 1.87% 0.36% A % 0.98% 2.36% 0.00% A % 0.36% 0.58% 0.00% A % 0.99% 3.18% 0.05% A % 0.21% 2.18% 0.22% A % 0.18% 1.09% 0.00% A % 0.03% 1.49% 0.00% A % 0.76% 4.69% 0.00% A % 0.64% 2.95% 0.03% A % 0.30% 1.52% 0.01% A % 0.15% 0.94% 0.00% A % 14.05% 10.37% 0.00% A % 2.27% 5.50% 0.00% A % 0.66% 2.80% 0.03% A % 0.24% 1.44% 0.00%
44 Bounds from Individual Legs Bounds from individual Legs DCOMP DCOMP Leg
45 Bounds from Individual Legs Bounds from individual Legs DCOMP DCOMP Leg DCOMP1 bounds are more homogeneous across legs
46 A Hubandspoke Network with 2 NonHub Locations Case # τ Load Capacity DCOMP1 DCOMP1 Revenue Gains OPTGAP factor per leg REV %CDLP %CDLP10 %DCOMP B % % 8.56% 2.74% B % % 5.74% 4.11% B % 1.00% 0.33% 0.03% B % % 4.41% 7.17% B % 48.88% 3.00% 0.09% B % 13.42% 3.62% 5.77% B % % 4.78% 7.97% B % 42.16% 4.49% 0.00% B % 13.27% 1.33% 1.94% B % 15.05% 0.98% 4.65% B % 15.46% 1.70% 8.14% B % 15.47% 2.45% 5.52% B % 2.89% 0.47% 0.34% B % 4.84% 1.14% 0.11% B % 22.11% 2.22% 0.04% B % 7.92% 2.14% 0.01% B % 23.82% 1.46% 0.18% B % 2.61% 1.24% 0.04% B % 30.16% 2.48% 0.01% B % 31.46% 2.60% 0.00%
47 DCOMP1 Percentage Revenue Gain vs. Load Factor DCOMP1 percentage revenue gain % CDLP10 % DCOMP Load factor
48 DCOMP1 Percentage Revenue Gain vs. Load Factor DCOMP1 percentage revenue gain % CDLP10 % DCOMP Load factor Higher load factor Higher revenue gains
49 DCOMP1 Percentage Revenue Gain vs. Number of Periods DCOMP1 percentage revenue gain % CDLP10 % DCOMP Number of periods
50 DCOMP1 Percentage Revenue Gain vs. Number of Periods DCOMP1 percentage revenue gain % CDLP10 % DCOMP Number of periods Significant revenue gains for problems with long selling horizons!
51 A Hubandspoke Network with 4 NonHub Locations Case # τ Load Capacity DCOMP1 DCOMP1 Revenue Gains OPTGAP factor per leg REV %CDLP %CDLP10 %DCOMP C % 14.60% 0.46% 0.10% C % 52.79% 1.95% 1.32% C % 12.35% 0.11% 0.03% C % 52.31% 1.36% 0.66% C % 44.57% 1.71% 1.96% C % 14.18% 1.72% 2.67% C % 29.01% 2.27% 0.81% C % 1.02% 0.49% 0.18% C % 4.98% 1.46% 2.67% C % 4.18% 1.61% 4.11% C % 3.44% 1.51% 4.43% C % 57.07% 1.92% 3.08% C % 1.30% 0.90% 0.21% C % 2.18% 0.21% 0.08% C % 6.38% 0.74% 0.00% C % 2.66% 0.89% 0.06% C % 2.50% 0.81% 0.44% C % 3.05% 0.03% 0.20% C % 3.24% 0.26% 0.05% C % 3.21% 0.41% 0.02%
52 DCOMP1 Percentage Revenue Gain vs. Load Factor DCOMP1 percentage revenue gain % CDLP10 % DCOMP Load factor
53 DCOMP1 Percentage Revenue Gain vs. Number of Periods DCOMP1 percentage revenue gain % CDLP10 % DCOMP Number of periods
54 Summary and Future Directions Functional approximation approach is promising for solving large scale stochastic dynamic programs. However, implementations of the approach often require very high computational cost. The first nonlinear nonseparable functional approximation for network RM problem Novel approximation architecture Better revenue bounds Improved heuristic policies Moderate computational cost Current work Exploiting special structures of the LP formulations of dynamic programs in value function approximation (Vossen and Zhang, 2012) Applications with real data (Zhang and Weatherford, 2012)
55 Thank you! Questions? Comments?
Role of Stochastic Optimization in Revenue Management. Huseyin Topaloglu School of Operations Research and Information Engineering Cornell University
Role of Stochastic Optimization in Revenue Management Huseyin Topaloglu School of Operations Research and Information Engineering Cornell University Revenue Management Revenue management involves making
More informationRandomization Approaches for Network Revenue Management with Customer Choice Behavior
Randomization Approaches for Network Revenue Management with Customer Choice Behavior Sumit Kunnumkal Indian School of Business, Gachibowli, Hyderabad, 500032, India sumit kunnumkal@isb.edu March 9, 2011
More informationA Randomized Linear Programming Method for Network Revenue Management with ProductSpecific NoShows
A Randomized Linear Programming Method for Network Revenue Management with ProductSpecific NoShows Sumit Kunnumkal Indian School of Business, Gachibowli, Hyderabad, 500032, India sumit kunnumkal@isb.edu
More informationUpgrades, Upsells and Pricing in Revenue Management
Submitted to Management Science manuscript Upgrades, Upsells and Pricing in Revenue Management Guillermo Gallego IEOR Department, Columbia University, New York, NY 10027, gmg2@columbia.edu Catalina Stefanescu
More informationRobust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model
Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model Paat Rusmevichientong Huseyin Topaloglu May 9, 2011 Abstract We study robust formulations of assortment optimization
More informationReSolving Stochastic Programming Models for Airline Revenue Management
ReSolving Stochastic Programming Models for Airline Revenue Management Lijian Chen Department of Industrial, Welding and Systems Engineering The Ohio State University Columbus, OH 43210 chen.855@osu.edu
More informationAppointment Scheduling under Patient Preference and NoShow Behavior
Appointment Scheduling under Patient Preference and NoShow Behavior Jacob Feldman School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14853 jbf232@cornell.edu Nan
More informationRevenue Management for Transportation Problems
Revenue Management for Transportation Problems Francesca Guerriero Giovanna Miglionico Filomena Olivito Department of Electronic Informatics and Systems, University of Calabria Via P. Bucci, 87036 Rende
More informationA Lagrangian relaxation approach for network inventory control of stochastic revenue management with perishable commodities
Journal of the Operational Research Society (2006), 19 2006 Operational Research Society Ltd. All rights reserved. 01605682/06 $30.00 www.palgravejournals.com/jors A Lagrangian relaxation approach
More informationCargo Capacity Management with Allotments and Spot Market Demand
Submitted to Operations Research manuscript OPRE200808420.R3 Cargo Capacity Management with Allotments and Spot Market Demand Yuri Levin and Mikhail Nediak School of Business, Queen s University, Kingston,
More informationA Statistical Modeling Approach to Airline Revenue. Management
A Statistical Modeling Approach to Airline Revenue Management Sheela Siddappa 1, Dirk Günther 2, Jay M. Rosenberger 1, Victoria C. P. Chen 1, 1 Department of Industrial and Manufacturing Systems Engineering
More informationA central problem in network revenue management
A Randomized Linear Programming Method for Computing Network Bid Prices KALYAN TALLURI Universitat Pompeu Fabra, Barcelona, Spain GARRETT VAN RYZIN Columbia University, New York, New York We analyze a
More informationCargo Capacity Management with Allotments and Spot Market Demand
OPERATIONS RESEARCH Vol. 60, No. 2, March April 2012, pp. 351 365 ISSN 0030364X (print) ISSN 15265463 (online) http://dx.doi.org/10.1287/opre.1110.1023 2012 INFORMS Cargo Capacity Management with Allotments
More informationMath 407A: Linear Optimization
Math 407A: Linear Optimization Lecture 4: LP Standard Form 1 1 Author: James Burke, University of Washington LPs in Standard Form Minimization maximization Linear equations to linear inequalities Lower
More informationPrinciples of demand management Airline yield management Determining the booking limits. » A simple problem» Stochastic gradients for general problems
Demand Management Principles of demand management Airline yield management Determining the booking limits» A simple problem» Stochastic gradients for general problems Principles of demand management Issues:»
More informationAirline Revenue Management: An Overview of OR Techniques 19822001
Airline Revenue Management: An Overview of OR Techniques 19822001 Kevin Pak * Nanda Piersma January, 2002 Econometric Institute Report EI 200203 Abstract With the increasing interest in decision support
More informationA General Attraction Model and an Efficient Formulation for the Network Revenue Management Problem *** Working Paper ***
A General Attraction Model and an Efficient Formulation for the Network Revenue Management Problem *** Working Paper *** Guillermo Gallego Richard Ratliff Sergey Shebalov updated June 30, 2011 Abstract
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.14.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 20150331 Todays presentation Chapter 3 Transforms using
More informationArticle Using Dynamic Programming Decomposition for Revenue Management with Opaque Products
econstor www.econstor.eu Der OpenAccessPublikationsserver der ZBW LeibnizInformationszentrum Wirtschaft The Open Access Publication Server of the ZBW Leibniz Information Centre for Economics Gönsch,
More informationOnline Network Revenue Management using Thompson Sampling
Online Network Revenue Management using Thompson Sampling Kris Johnson Ferreira David SimchiLevi He Wang Working Paper 16031 Online Network Revenue Management using Thompson Sampling Kris Johnson Ferreira
More informationTwoStage Stochastic Linear Programs
TwoStage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 TwoStage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic
More informationTetris: Experiments with the LP Approach to Approximate DP
Tetris: Experiments with the LP Approach to Approximate DP Vivek F. Farias Electrical Engineering Stanford University Stanford, CA 94403 vivekf@stanford.edu Benjamin Van Roy Management Science and Engineering
More informationLecture 10 Scheduling 1
Lecture 10 Scheduling 1 Transportation Models 1 large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment and resources
More informationRevenue Management Through Dynamic Cross Selling in ECommerce Retailing
OPERATIONS RESEARCH Vol. 54, No. 5, September October 006, pp. 893 913 issn 0030364X eissn 1565463 06 5405 0893 informs doi 10.187/opre.1060.096 006 INFORMS Revenue Management Through Dynamic Cross Selling
More informationAirline Reservation Systems. Gerard Kindervater KLM AMS/RX
Airline Reservation Systems Gerard Kindervater KLM AMS/RX 2 Objective of the presentation To illustrate  what happens when passengers make a reservation  how airlines decide what fare to charge to passengers
More informationWe consider a cargo booking problem on a singleleg flight with the goal of maximizing expected contribution.
Vol. 41, No. 4, November 2007, pp. 457 469 issn 00411655 eissn 15265447 07 4104 0457 informs doi 10.1287/trsc.1060.0177 2007 INFORMS SingleLeg AirCargo Revenue Management Kannapha Amaruchkul, William
More informationOptimization of Mixed Fare Structures: Theory and Applications Received (in revised form): 7th April 2009
Original Article Optimization of Mixed Fare Structures: Theory and Applications Received (in revised form): 7th April 29 Thomas Fiig is Chief Scientist in the Revenue Management Development department
More informationThe Canonical and Dictionary Forms of Linear Programs
The Canonical and Dictionary Forms of Linear Programs Recall the general optimization problem: Minimize f(x) subect to x D (1) The real valued function f is called the obective function, and D the constraint
More informationSimulation in Revenue Management. Christine Currie christine.currie@soton.ac.uk
Simulation in Revenue Management Christine Currie christine.currie@soton.ac.uk Introduction Associate Professor of Operational Research at the University of Southampton ~ 10 years experience in RM and
More informationCyberSecurity Analysis of State Estimators in Power Systems
CyberSecurity Analysis of State Estimators in Electric Power Systems André Teixeira 1, Saurabh Amin 2, Henrik Sandberg 1, Karl H. Johansson 1, and Shankar Sastry 2 ACCESS Linnaeus Centre, KTHRoyal Institute
More informationEfficient and Robust Allocation Algorithms in Clouds under Memory Constraints
Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Olivier Beaumont,, Paul RenaudGoud Inria & University of Bordeaux Bordeaux, France 9th Scheduling for Large Scale Systems
More informationDecentralization and Private Information with Mutual Organizations
Decentralization and Private Information with Mutual Organizations Edward C. Prescott and Adam Blandin Arizona State University 09 April 2014 1 Motivation Invisible hand works in standard environments
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More informationRevenue Management & Insurance Cycle JB Crozet, FIA, CFA
JB Crozet, FIA, CFA Abstract: This paper investigates how an insurer s pricing strategy can be adapted to respond to market conditions, and in particular the insurance cycle. For this purpose, we explore
More informationDecentralized control of stochastic multiagent service system. J. George Shanthikumar Purdue University
Decentralized control of stochastic multiagent service system J. George Shanthikumar Purdue University Joint work with Huaning Cai, Peng Li and Andrew Lim 1 Many problems can be thought of as stochastic
More informationTOWARDS AN EFFICIENT DECISION POLICY FOR CLOUD SERVICE PROVIDERS
Association for Information Systems AIS Electronic Library (AISeL) ICIS 2010 Proceedings International Conference on Information Systems (ICIS) 112010 TOWARDS AN EFFICIENT DECISION POLICY FOR CLOUD SERVICE
More informationLecture 11: 01 Quadratic Program and Lower Bounds
Lecture :  Quadratic Program and Lower Bounds (3 units) Outline Problem formulations Reformulation: Linearization & continuous relaxation Branch & Bound Method framework Simple bounds, LP bound and semidefinite
More informationScheduling Home Health Care with Separating Benders Cuts in Decision Diagrams
Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery
More informationHETEROGENEOUS AGENTS AND AGGREGATE UNCERTAINTY. Daniel Harenberg daniel.harenberg@gmx.de. University of Mannheim. Econ 714, 28.11.
COMPUTING EQUILIBRIUM WITH HETEROGENEOUS AGENTS AND AGGREGATE UNCERTAINTY (BASED ON KRUEGER AND KUBLER, 2004) Daniel Harenberg daniel.harenberg@gmx.de University of Mannheim Econ 714, 28.11.06 Daniel Harenberg
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More information1 Polyhedra and Linear Programming
CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material
More informationModels in Transportation. Tim Nieberg
Models in Transportation Tim Nieberg Transportation Models large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment
More informationLinear Programming is the branch of applied mathematics that deals with solving
Chapter 2 LINEAR PROGRAMMING PROBLEMS 2.1 Introduction Linear Programming is the branch of applied mathematics that deals with solving optimization problems of a particular functional form. A linear programming
More informationPurposeful underestimation of demands for the airline seat allocation with incomplete information
34 Int. J. Revenue Management, Vol. 8, No. 1, 2014 Purposeful underestimation of demands for the airline seat allocation with incomplete information Lijian Chen* School of Business Administration, Department
More informationNeural Networks. CAP5610 Machine Learning Instructor: GuoJun Qi
Neural Networks CAP5610 Machine Learning Instructor: GuoJun Qi Recap: linear classifier Logistic regression Maximizing the posterior distribution of class Y conditional on the input vector X Support vector
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NPcomplete. Then one can conclude according to the present state of science that no
More informationA LogRobust Optimization Approach to Portfolio Management
A LogRobust Optimization Approach to Portfolio Management Dr. Aurélie Thiele Lehigh University Joint work with Ban Kawas Research partially supported by the National Science Foundation Grant CMMI0757983
More informationDefinition of a Linear Program
Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1
More informationYield Optimization of Display Advertising with Ad Exchange
Yield Optimization of Display Advertising with Ad Exchange Santiago R. Balseiro Fuqua School of Business, Duke University, 100 Fuqua Drive, NC 27708, srb43@duke.edu Jon Feldman, Vahab Mirrokni, S. Muthukrishnan
More informationDynamic Capacity Management with General Upgrading
Submitted to Operations Research manuscript (Please, provide the mansucript number!) Dynamic Capacity Management with General Upgrading Yueshan Yu Olin Business School, Washington University in St. Louis,
More informationSimulating the Multiple TimePeriod Arrival in Yield Management
Simulating the Multiple TimePeriod Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2
More informationCHAPTER 9. Integer Programming
CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationREVENUE MANAGEMENT: MODELS AND METHODS
Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. REVENUE MANAGEMENT: MODELS AND METHODS Kalyan T. Talluri ICREA and Universitat
More informationBig Data Optimization at SAS
Big Data Optimization at SAS Imre Pólik et al. SAS Institute Cary, NC, USA Edinburgh, 2013 Outline 1 Optimization at SAS 2 Big Data Optimization at SAS The SAS HPA architecture Support vector machines
More informationRobust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework
Robust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework Michelle Dunbar, Gary Froyland School of Mathematics and Statistics, University of New South
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More information36106 Managerial Decision Modeling Revenue Management
36106 Managerial Decision Modeling Revenue Management Kipp Martin University of Chicago Booth School of Business October 5, 2015 Reading and Excel Files 2 Reading (Powell and Baker): Section 9.5 Appendix
More informationOptimization under uncertainty: modeling and solution methods
Optimization under uncertainty: modeling and solution methods Paolo Brandimarte Dipartimento di Scienze Matematiche Politecnico di Torino email: paolo.brandimarte@polito.it URL: http://staff.polito.it/paolo.brandimarte
More informationNonlinear Optimization: Algorithms 3: Interiorpoint methods
Nonlinear Optimization: Algorithms 3: Interiorpoint methods INSEAD, Spring 2006 JeanPhilippe Vert Ecole des Mines de Paris JeanPhilippe.Vert@mines.org Nonlinear optimization c 2006 JeanPhilippe Vert,
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationBranchandPrice Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN BranchandPrice Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationPreliminary Draft. January 2006. Abstract
Assortment Planning and Inventory Management Under Dynamic Stockoutbased Substitution Preliminary Draft Dorothée Honhon, Vishal Gaur, Sridhar Seshadri January 2006 Abstract We consider the problem of
More informationDantzigWolfe bound and DantzigWolfe cookbook
DantzigWolfe bound and DantzigWolfe cookbook thst@man.dtu.dk DTUManagement Technical University of Denmark 1 Outline LP strength of the DantzigWolfe The exercise from last week... The DantzigWolfe
More informationSIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT
CHAPTER 8 SIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT In YM, one of the major problems in maximizing revenue is the number of cancellations. In industries implementing YM this is very
More informationScheduling and (Integer) Linear Programming
Scheduling and (Integer) Linear Programming Christian Artigues LAAS  CNRS & Université de Toulouse, France artigues@laas.fr Master Class CPAIOR 2012  Nantes Christian Artigues Scheduling and (Integer)
More informationMaximum Utility Product Pricing Models and Algorithms Based on Reservation Prices
Maximum Utility Product Pricing Models and Algorithms Based on Reservation Prices R. Shioda L. Tunçel T. G. J. Myklebust April 15, 2007 Abstract We consider a revenue management model for pricing a product
More informationPlanning in Artificial Intelligence
Logical Representations and Computational Methods for Marov Decision Processes Craig Boutilier Department of Computer Science University of Toronto Planning in Artificial Intelligence Planning has a long
More informationThe Simplex Method. yyye
Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #05 1 The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationManaging Revenue from Television Advertising Sales
Managing Revenue from Television Advertising ales Dana G. Popescu Department of Technology and Operations Management, INEAD ridhar eshadri Department of Information, Risk and Operations Management, University
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationMIT ICAT. Airline Revenue Management: Flight Leg and Network Optimization. 1.201 Transportation Systems Analysis: Demand & Economics
M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Airline Revenue Management: Flight Leg and Network Optimization 1.201 Transportation Systems Analysis: Demand & Economics
More informationAPPLICATIONS OF REVENUE MANAGEMENT IN HEALTHCARE. Alia Stanciu. BBA, Romanian Academy for Economic Studies, 1999. MBA, James Madison University, 2002
APPLICATIONS OF REVENUE MANAGEMENT IN HEALTHCARE by Alia Stanciu BBA, Romanian Academy for Economic Studies, 1999 MBA, James Madison University, 00 Submitted to the Graduate Faculty of Joseph M. Katz Graduate
More informationSpatial Decomposition/Coordination Methods for Stochastic Optimal Control Problems. Practical aspects and theoretical questions
Spatial Decomposition/Coordination Methods for Stochastic Optimal Control Problems Practical aspects and theoretical questions P. Carpentier, JPh. Chancelier, M. De Lara, V. Leclère École des Ponts ParisTech
More informationDemand Forecasting in a Railway Revenue Management System
Powered by TCPDF (www.tcpdf.org) Demand Forecasting in a Railway Revenue Management System Economics Master's thesis Valtteri Helve 2015 Department of Economics Aalto University School of Business Aalto
More informationmax cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x
Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study
More informationMonte Carlo Simulation
1 Monte Carlo Simulation Stefan Weber Leibniz Universität Hannover email: sweber@stochastik.unihannover.de web: www.stochastik.unihannover.de/ sweber Monte Carlo Simulation 2 Quantifying and Hedging
More informationKeywords: Beta distribution, Genetic algorithm, Normal distribution, Uniform distribution, Yield management.
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Simulating
More informationBy W.E. Diewert. July, Linear programming problems are important for a number of reasons:
APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More information6.231 Dynamic Programming and Stochastic Control Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.231 Dynamic Programming and Stochastic Control Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.231
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationFinal Report. to the. Center for Multimodal Solutions for Congestion Mitigation (CMS) CMS Project Number: 2010018
Final Report to the Center for Multimodal Solutions for Congestion Mitigation (CMS) CMS Project Number: 2010018 CMS Project Title: Impacts of Efficient Transportation Capacity Utilization via MultiProduct
More informationUnit 1. Today I am going to discuss about Transportation problem. First question that comes in our mind is what is a transportation problem?
Unit 1 Lesson 14: Transportation Models Learning Objective : What is a Transportation Problem? How can we convert a transportation problem into a linear programming problem? How to form a Transportation
More informationLAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION
LAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION Kartik Sivaramakrishnan Department of Mathematics NC State University kksivara@ncsu.edu http://www4.ncsu.edu/ kksivara SIAM/MGSA Brown Bag
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadowprice interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationAir Cargo Allotment Planning
Air Cargo Allotment Planning Chan Seng Pun 1 and Diego Klabjan 1 1 Industrial Engineering and Management Sciences, Northwestern University In the midterm capacity planning process for air cargo, a cargo
More informationWeek 5 Integral Polyhedra
Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory
More informationIntroduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multiclass classification.
More informationON THE APPROXIMATION OF INCONSISTENT INEQUALITY SYSTEMS
An. Şt. Univ. Ovidius Constanţa Vol. 11(), 003, 109 118 ON THE APPROXIMATION OF INCONSISTENT INEQUALITY SYSTEMS Elena Popescu Abstract In this paper is analyzed the minimal correction problem for an inconsistent
More informationRevenue Management and Capacity Planning
Revenue Management and Capacity Planning Douglas R. Bish, Ebru K. Bish, Bacel Maddah 3 INTRODUCTION Broadly defined, revenue management (RM) 4 is the process of maximizing revenue from a fixed amount of
More informationLogistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
More informationOptimizing Replenishment Intervals for TwoEchelon Distribution Systems with Fixed Order Costs
Optimizing Replenishment Intervals for TwoEchelon Distribution Systems with Fixed Order Costs Kevin H. Shang Sean X. Zhou Fuqua School of Business, Duke University, Durham, North Carolina 27708, USA Systems
More informationBranch and Cut for TSP
Branch and Cut for TSP jla,jc@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 1 BranchandCut for TSP BranchandCut is a general technique applicable e.g. to solve symmetric
More information3 Does the Simplex Algorithm Work?
Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances
More informationTransportation Polytopes: a Twenty year Update
Transportation Polytopes: a Twenty year Update Jesús Antonio De Loera University of California, Davis Based on various papers joint with R. Hemmecke, E.Kim, F. Liu, U. Rothblum, F. Santos, S. Onn, R. Yoshida,
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 WeiTa Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More information3y 1 + 5y 2. y 1 + y 2 20 y 1 0, y 2 0.
1 Linear Programming A linear programming problem is the problem of maximizing (or minimizing) a linear function subject to linear constraints. The constraints may be equalities or inequalities. 1.1 Example
More information