IDEAS home Printed from https://ideas.repec.org/a/ids/ijisma/v2y2006i1-2p132-148.html
   My bibliography  Save this article

An integrated approach using utility theory and chance-constrained programming for supplier quota allocation

Author

Listed:
  • Manoj Kumar
  • Prem Vrat
  • Ravi Shankar

Abstract

In this paper, a solution procedure based on utility theory and chance-constrained programming is developed to solve a supplier quota allocation problem. The objectives of the problem incorporate maximisation of sales revenues, quality and on-time delivery. Some realistic constraints such as buyers' demand, budget allocation to individual vendors, etc. are also modelled in this problem. The proposed approach allows us to handle random aspects of input information. The effect of different levels of uncertainties is also analysed to understand how quota allocation to suppliers changes and how some of the suppliers lose their quota in an uncertain environment. A case illustration of a real automobile manufacturer is provided which shows the effectiveness and application of the model to suppliers' quota allocation problem in a supply chain.

Suggested Citation

  • Manoj Kumar & Prem Vrat & Ravi Shankar, 2006. "An integrated approach using utility theory and chance-constrained programming for supplier quota allocation," International Journal of Integrated Supply Management, Inderscience Enterprises Ltd, vol. 2(1/2), pages 132-148.
    • Handle: RePEc:ids:ijisma:v:2:y:2006:i:1/2:p:132-148
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=8342
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shiwei He & Sohail Chaudhry & Zhonglin Lei & Wang Baohua, 2009. "Stochastic vendor selection problem: chance-constrained model and genetic algorithms," Annals of Operations Research, Springer, vol. 168(1), pages 169-179, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisma:v:2:y:2006:i:1/2:p:132-148. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=81 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.