IDEAS home Printed from https://ideas.repec.org/p/gro/rugsom/00a22.html
   My bibliography  Save this paper

Complexity of determining exact tolerances for min-max combinatorial optimization problems

Author

Listed:
  • Ramaswamy, R.
  • Chakravarti, N.
  • Ghosh, D.

    (Groningen University)

Abstract

Suppose that we are given an instance of a combinatorial optimization problemwith min-max objective along with an optimal solution for it. Let the cost of asingle element be varied. We refer to the range of values of the element’s costfor which the given optimal solution remains optimal as its exact tolerance. Inthis paper we examine the problem of determining the exact tolerance of eachelement in combinatorial optimization problems with min-max objectives. Weshow that under very weak assumptions, the exact tolerance of each elementcan be determined in polynomial time if and only if the original optimizationproblem can be solved in polynomial time.

Suggested Citation

  • Ramaswamy, R. & Chakravarti, N. & Ghosh, D., 2000. "Complexity of determining exact tolerances for min-max combinatorial optimization problems," Research Report 00A22, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    • Handle: RePEc:gro:rugsom:00a22
    as

    Download full text from publisher

    File URL: http://irs.ub.rug.nl/ppn/24056653X
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sotskov, Y. & Sotskova, N. Y. & Werner, F., 1997. "Stability of an optimal schedule in a job shop," Omega, Elsevier, vol. 25(4), pages 397-414, August.
    2. T. Terpstra, 1989. "Asymptotically optimal nonparametric one- and two-way analysis of variance tests for the log linear model under censoring," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 36(1), pages 63-90, December.
    3. A. M. Geoffrion & R. Nauss, 1977. "Exceptional Paper--Parametric and Postoptimality Analysis in Integer Linear Programming," Management Science, INFORMS, vol. 23(5), pages 453-466, January.
    4. Jenkins, Larry, 1987. "Parametric-objective integer programming using knapsack facets and Gomory cutting planes," European Journal of Operational Research, Elsevier, vol. 31(1), pages 102-109, July.
    5. M. Libura, 1999. "On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function," Annals of Operations Research, Springer, vol. 86(0), pages 53-62, January.
    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. repec:dgr:rugsom:00a22 is not listed on IDEAS
    2. Crema, Alejandro, 2002. "An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program," European Journal of Operational Research, Elsevier, vol. 138(3), pages 484-494, May.
    3. Crema, Alejandro, 2002. "The multiparametric 0-1-integer linear programming problem: A unified approach," European Journal of Operational Research, Elsevier, vol. 139(3), pages 511-520, June.
    4. Crema, Alejandro, 2000. "An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function," European Journal of Operational Research, Elsevier, vol. 125(1), pages 18-24, August.
    5. Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
    6. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    7. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    8. Zhou, Feng & Huang, Gordon H. & Chen, Guo-Xian & Guo, Huai-Cheng, 2009. "Enhanced-interval linear programming," European Journal of Operational Research, Elsevier, vol. 199(2), pages 323-333, December.
    9. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Jenkins, Larry, 1996. "A comment on "Grey integer programming: an application to waste management planning under uncertainty" by Guo H. Huang, Brian W. Baetz, Gilles G. Patry : European Journal of Operational Rese," European Journal of Operational Research, Elsevier, vol. 89(3), pages 671-670, March.
    11. Constantin Waubert de Puiseau & Richard Meyes & Tobias Meisen, 2022. "On reliability of reinforcement learning based production scheduling systems: a comparative survey," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 911-927, April.
    12. George Kozanidis & Eftychia Kostarelou, 2023. "An Exact Solution Algorithm for Integer Bilevel Programming with Application in Energy Market Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 573-607, May.
    13. Tcha, Dong-wan & Myung, Young-soo & Chung, Ki-ho, 1995. "Parametric uncapacitated facility location," European Journal of Operational Research, Elsevier, vol. 86(3), pages 469-479, November.
    14. Wang, Yi & Yang, Zhifang & Yu, Juan & Liu, Sixu, 2023. "Pricing in non-convex electricity markets with flexible trade-off of pricing properties," Energy, Elsevier, vol. 274(C).
    15. Fritz Bökler & Sophie N. Parragh & Markus Sinnl & Fabien Tricoire, 2024. "An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 263-290, August.
    16. Huang, G. H. & Baetz, B. W. & Patry, G. G., 1997. "A response to "A comment on 'Grey integer programming: An application to waste management planning under uncertainty"' by Larry Jenkins," European Journal of Operational Research, Elsevier, vol. 100(3), pages 638-641, August.
    17. Yilmaz, Hasan Ümitcan & Kimbrough, Steven O. & van Dinther, Clemens & Keles, Dogan, 2022. "Power-to-gas: Decarbonization of the European electricity system with synthetic methane," Applied Energy, Elsevier, vol. 323(C).
    18. Sotskov, Y.N. & Wagelmans, A.P.M. & Werner, F., 1997. "On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule," Econometric Institute Research Papers EI 9718/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    19. Efstratios Pistikopoulos & Luis Dominguez & Christos Panos & Konstantinos Kouramas & Altannar Chinchuluun, 2012. "Theoretical and algorithmic advances in multi-parametric programming and control," Computational Management Science, Springer, vol. 9(2), pages 183-203, May.
    20. O'Neill, Richard P. & Sotkiewicz, Paul M. & Hobbs, Benjamin F. & Rothkopf, Michael H. & Stewart, William R., 2005. "Efficient market-clearing prices in markets with nonconvexities," European Journal of Operational Research, Elsevier, vol. 164(1), pages 269-285, July.
    21. Lai, Tsung-Chyan & Sotskov, Yuri N. & Sotskova, Nadezhda & Werner, Frank, 2004. "Mean flow time minimization with given bounds of processing times," European Journal of Operational Research, Elsevier, vol. 159(3), pages 558-573, December.

    More about this item

    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:gro:rugsom:00a22. 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: Hanneke Tamling (email available below). General contact details of provider: https://edirc.repec.org/data/ferugnl.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.