IDEAS home Printed from https://ideas.repec.org/a/ibn/masjnl/v6y2012i12p22.html
   My bibliography  Save this article

Type II Sensitivity Analysis in Solid Assignment Problems

Author

Listed:
  • Kavitha K.
  • Pandian ponnaiah

Abstract

Type II sensitivity of the solid assignment problem is discussed in this paper. Parametric-bound method is proposed that determines the Type II sensitivity ranges of cost coefficients in the solid assignment problem. The procedure of the parametric-bound method is demonstrated with a numerical example. The result obtained by the proposed method will help the decision makers to take an appropriate action while handling various types of assignment problems having three parameters.

Suggested Citation

  • Kavitha K. & Pandian ponnaiah, 2012. "Type II Sensitivity Analysis in Solid Assignment Problems," Modern Applied Science, Canadian Center of Science and Education, vol. 6(12), pages 1-22, December.
    • Handle: RePEc:ibn:masjnl:v:6:y:2012:i:12:p:22
    as

    Download full text from publisher

    File URL: https://ccsenet.org/journal/index.php/mas/article/download/21214/14357
    Download Restriction: no
    File URL: https://ccsenet.org/journal/index.php/mas/article/view/21214
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hadigheh, Alireza Ghaffari & Terlaky, Tamas, 2006. "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1158-1175, March.
    2. Koltai, Tamas & Terlaky, Tamas, 2000. "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, Elsevier, vol. 65(3), pages 257-274, May.
    3. A. Ghaffari Hadigheh & K. Mirnia & T. Terlaky, 2007. "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 133(3), pages 303-315, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ma, Kang-Ting & Lin, Chi-Jen & Wen, Ue-Pyng, 2013. "Type II sensitivity analysis of cost coefficients in the degenerate transportation problem," European Journal of Operational Research, Elsevier, vol. 227(2), pages 293-300.
    2. A. Ghaffari Hadigheh & K. Mirnia & T. Terlaky, 2007. "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 133(3), pages 303-315, June.
    3. Koltai, Tamás & Tatay, Viola, 2011. "A practical approach to sensitivity analysis in linear programming under degeneracy for management decision making," International Journal of Production Economics, Elsevier, vol. 131(1), pages 392-398, May.
    4. Hladík, Milan, 2010. "Multiparametric linear programming: Support set and optimal partition invariancy," European Journal of Operational Research, Elsevier, vol. 202(1), pages 25-31, April.
    5. Illes, Tibor & Terlaky, Tamas, 2002. "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, Elsevier, vol. 140(2), pages 170-190, July.
    6. Borgonovo, E., 2010. "Sensitivity analysis with finite changes: An application to modified EOQ models," European Journal of Operational Research, Elsevier, vol. 200(1), pages 127-138, January.
    7. Borgonovo, E. & Peccati, L., 2004. "Sensitivity analysis in investment project evaluation," International Journal of Production Economics, Elsevier, vol. 90(1), pages 17-25, July.
    8. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    9. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    10. Hadigheh, Alireza Ghaffari & Terlaky, Tamas, 2006. "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, Elsevier, vol. 169(3), pages 1158-1175, March.
    11. Koltai, Tamás, 2009. "Robustness of a production schedule to inventory cost calculations," International Journal of Production Economics, Elsevier, vol. 121(2), pages 494-504, October.
    12. Ya Ping Fang & Nan Jing Huang & Xiao Qi Yang, 2012. "Local Smooth Representations of Parametric Semiclosed Polyhedra with Applications to Sensitivity in Piecewise Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 810-839, December.
    13. E. Borgonovo & L. Peccati, 2011. "Managerial insights from service industry models: a new scenario decomposition method," Annals of Operations Research, Springer, vol. 185(1), pages 161-179, May.
    14. Boris Defourny & Ilya O. Ryzhov & Warren B. Powell, 2015. "Optimal Information Blending with Measurements in the L 2 Sphere," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1060-1088, October.
    15. Marcel Klatt & Axel Munk & Yoav Zemel, 2022. "Limit laws for empirical optimal solutions in random linear programs," Annals of Operations Research, Springer, vol. 315(1), pages 251-278, August.
    16. Borgonovo, E. & Peccati, L., 2011. "Finite change comparative statics for risk-coherent inventories," International Journal of Production Economics, Elsevier, vol. 131(1), pages 52-62, May.
    17. Lin, Chi-Jen & Wen, Ue-Pyng, 2003. "Sensitivity analysis of the optimal assignment," European Journal of Operational Research, Elsevier, vol. 149(1), pages 35-46, August.
    18. M. A. Goberna & T. Terlaky & M. I. Todorov, 2010. "Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 14-26, February.
    19. Michael, Elad & Wood, Tony A. & Manzie, Chris & Shames, Iman, 2022. "Sensitivity analysis for bottleneck assignment problems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 159-167.
    20. Borgonovo, Emanuele & Buzzard, Gregery T. & Wendell, Richard E., 2018. "A global tolerance approach to sensitivity analysis in linear programming," European Journal of Operational Research, Elsevier, vol. 267(1), pages 321-337.

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    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:ibn:masjnl:v:6:y:2012:i:12:p:22. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    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.