OPTIMIZATION PROBLEMS IN MASS TRANSPORTATION THEORY ...

More documents

Recommendations

Info

The function B can be seen as a control variableand the corresponding transport planas a state variable, so that the optimizationproblem we consider:min { F (B) : B l.s.c. increasing, B(0) = 0 }can be seen as an optimal control problem.Theorem There exists an optimal pricingpolicy B opt solving the maximal incomeproblem above.Also in this case some necessary conditionsof optimality can be obtained. In particular,the function B opt turns out to be continuous,and its Lipschitz constant can bebounded by the one of A (the function measuringthe own means cost).33
Here is the case of a service pole at the origin,with a residence pole at (L, H), with anetwork Σ. We take A(t) = t.HΣLThe optimal pricing policy B(t) is given byB(t) = (H 2 + L 2 ) 1/2 − (H 2 + (L − t) 2 ) 1/2 .1.210.80.60.40.20.5 1 1.5 2The case L = 2 and H = 1.34
Page 1 and 2: OPTIMIZATION PROBLEMS INMASS TRANSP
Page 3 and 4: The Monge problem is thenmin{ ∫ d
Page 5 and 6: Then the class of admissible transp
Page 7 and 8: Monge-Kantorovich problem:{ ∫ }mi
Page 9 and 10: Shape optimization problemsThere is
Page 12 and 13: The shape optimization problem abov
Page 14 and 15: To overcome some of these difficult
Page 16 and 17: In the mass optimization problem th
Page 18 and 19: More precisely, we consider the geo
Page 20 and 21: produces an optimal µ which has a
Page 22 and 23: Variational integrals w.r.t. a meas
Page 24 and 25: Here are some cases where the optim
Page 26 and 27: -2 -1.5 -1 -0.5 0 0.5 1 1.5 21.510.
Page 28 and 29: Problem 1 - Optimal NetworksWe cons
Page 30 and 31: •Large town policy: several ticke
Page 32 and 33: It is interesting to study the opti
Page 36 and 37: Here is another case, with a single
Page 38 and 39: • there is a transportation cost
Page 40 and 41: We have then the optimization probl
Page 42 and 43: and so the value of the cost F (a).
Page 44 and 45: is a delicate matter. Indeed, maxim
Page 46 and 47: Some Numerical ComputationsHere are
Page 48 and 49: Optimal sets of length 0.5 and 1 in
Page 50 and 51: Now we give a model that takes into
Page 52 and 53: We also give a model where the oppo
Page 54 and 55: Theorem Assume:• J is lower semic
Page 56 and 57: ∫∫ ∫J(µ) = f(µ a )dm+ f ∞
Page 58 and 59: Concentration case. The following f
Page 60 and 61: Diffusion case. The following facts
Page 62 and 63: Theorem Let (X, d, d ′ ) be a met
Page 64 and 65: • if q < 1 + 1/N for every µ 0 a

OPTIMIZATION PROBLEMS IN MASS TRANSPORTATION THEORY ...

Create successful ePaper yourself

Delete template?

Save as template?