Skip to main content
SpringerLink
Log in

\({\cal K}\)-Convexity1 in \(\Re^{n}\)

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We generalize the concept of K-convexity to an n-dimensional Euclidean space. The resulting concept of \({\cal K}\)-convexity is useful in addressing production and inventory problems where there are individual product setup costs and/or joint setup costs. We derive some basic properties of \({\cal K}\)-convex functions. We conclude the paper with some suggestions for future research.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Scarf (1960) The Optimality of (s, S) Policies in the Dynamic Inventory Problem J. Arrow S. Karlin P. Suppes (Eds) Mathematical Methods in the Social Sciences Stanford University Press. Stanford California 196–202

    Google Scholar 

  2. A.F. Veinott SuffixJr. (1966) ArticleTitleOn the Optimality of (s, S) Inventory Policies: New Conditions and a New Proof SIAM Journal on Applied Mathematics 14 1067–1083 Occurrence Handle10.1137/0114086

    Article  Google Scholar 

  3. E.L. Johnson (1967) ArticleTitleOptimality and Computation of (σ, S) Policies in the Multi-Item Infinite-Horizon Inventory Problem Management Science 13 475–491

    Google Scholar 

  4. D. Kalin (1980) ArticleTitleOn the Optimality of. (σ, S) Policies Mathematics of Operations Research 5 293–307

    Google Scholar 

  5. K. Ohno T. Ishigaki (2001) ArticleTitleMulti-Item Continuous Review Inventory System with Compound Poisson Demands Mathematical Methods in Operations Research 53 147–165 Occurrence Handle10.1007/s001860000101

    Article  Google Scholar 

  6. B. Liu A.O. Esogbue (1999) Decision Criteria and Optimal Inventory Processes Kluwer Boston, Massachusetts

    Google Scholar 

  7. E.V. Denardo (1982) Dynamic Programming: Models and Appllications Prentice Hall Englewood Cliffs, New Jersey

    Google Scholar 

  8. E. Portues (1971) ArticleTitleOn the Optimality of Generalized. (s, S) Policies Management Science 17 411–426

    Google Scholar 

  9. A.N. Kolmogorov S.V. Fomin (1970) Introduction to Real Analysis Dover Publications New York, NY

    Google Scholar 

  10. D.M. Topkis (1978) ArticleTitleMinimizing a Submodular Function on a Lattice Operations Research 26 305–321

    Google Scholar 

  11. A.F.JR. Veinott (1975) Teaching Notes in Inventory Theory Stanford University Stanford, california

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Professor, Department of Industrial Engineering and Operations Research, Columbia University, New York City, NY, USA

    G. Gallego

  2. Ashbel Smith Professor, School of Management, University of Texas at Dallas, Richardson, Texas, USA

    S. P. Sethi

Authors
  1. G. Gallego
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. P. Sethi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Support from Columbia University and University of Texas at Dallas is gratefully acknowledged. Helpful comments from Qi Feng are appreciated.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gallego, G., Sethi, S.P. \({\cal K}\)-Convexity1 in \(\Re^{n}\). J Optim Theory Appl 127, 71–88 (2005). https://doi.org/10.1007/s10957-005-6393-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-005-6393-4

Keywords

Search

Navigation