Geodesic Convexity on R + n

Rapcsák, Tamás

doi:10.1007/978-1-4615-6357-0_10

Search citation statements

Order By: Relevance

Paper Sections

Select...

Appendix III1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2003

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A basic reference for geodesic convexity is Hicks (1965). Geodesic convexity is discussed in Rapcsak (1994). Now we propose a geodesic descent algorithm to solve the optimization problem min f ðnÞ subject to n 2 H ; whose Lagrangean is given by…”

Section: Appendix IIImentioning

confidence: 99%

Optimizing centralized inventory operations in a cooperative game theory setting

Hartman

Dror²

2003

IIE Transactions

View full text Add to dashboard Cite

For single period inventory models with normally distributed, correlated individual demands we examine the problem of minimizing the cost of inventory centralization as a function of the covariance matrix. In a stable centralized setting there are no incentives for any party to break-away -referred to as nonempty core conditions. For the allocated benefits in inventory centralization, nonempty core conditions are always satisfied. In this paper we discuss a step by step greedy optimization procedure which computes an optimal centralization solution. The procedure manipulates the correlations without changing the mean or the variance at each store. We do not just accept that in the centralized setting the parties are better-off, but for the first time provide the analysis of how to maximize their collective benefits.

show abstract

Section: Appendix IIImentioning

confidence: 99%