IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v107y2000i3d10.1023_a1026455401079.html
   My bibliography  Save this article

On Sensitivity in Linear Multiobjective Programming

Author

Listed:
  • L. V. Thuan

    (Hanoi Institute of Mathematics)

  • D. T. Luc

    (University of Avignon
    Hanoi Institute of Mathematics)

Abstract

In this paper, we prove that, if the data of a linear multiobjectiveprogramming problem are smooth functions of a parameter, then in theparameter space there is an open dense subset where the efficient solutionset of the problem can be locally represented as a union of some faces whosevertices and directions are smooth functions of the parameter.

Suggested Citation

  • L. V. Thuan & D. T. Luc, 2000. "On Sensitivity in Linear Multiobjective Programming," Journal of Optimization Theory and Applications, Springer, vol. 107(3), pages 615-626, December.
    • Handle: RePEc:spr:joptap:v:107:y:2000:i:3:d:10.1023_a:1026455401079
    DOI: 10.1023/A:1026455401079
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1026455401079
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1026455401079?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. J. V. Outrata, 1990. "On Generalized Gradients in Optimization Problems with Set-Valued Constraints," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 626-639, November.
    2. Stephen M. Robinson, 1991. "An Implicit-Function Theorem for a Class of Nonsmooth Functions," Mathematics of Operations Research, INFORMS, vol. 16(2), pages 292-309, May.
    3. Hedy Attouch & Hassan Riahi, 1993. "Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 173-201, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Xi Yin Zheng & Xiaoqi Yang, 2021. "Fully Piecewise Linear Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 461-490, August.
    2. Pubudu L. W. Jayasekara & Andrew C. Pangia & Margaret M. Wiecek, 2023. "On solving parametric multiobjective quadratic programs with parameters in general locations," Annals of Operations Research, Springer, vol. 320(1), pages 123-172, January.

    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. T. X. D. Ha, 2005. "Some Variants of the Ekeland Variational Principle for a Set-Valued Map," Journal of Optimization Theory and Applications, Springer, vol. 124(1), pages 187-206, January.
    2. C. S. Lalitha & Prashanto Chatterjee, 2012. "Stability for Properly Quasiconvex Vector Optimization Problem," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 492-506, November.
    3. Bolte, Jérôme & Le, Tam & Pauwels, Edouard & Silveti-Falls, Antonio, 2022. "Nonsmooth Implicit Differentiation for Machine Learning and Optimization," TSE Working Papers 22-1314, Toulouse School of Economics (TSE).
    4. C. S. Lalitha & Prashanto Chatterjee, 2012. "Stability and Scalarization of Weak Efficient, Efficient and Henig Proper Efficient Sets Using Generalized Quasiconvexities," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 941-961, December.
    5. Defeng Sun, 2006. "The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 761-776, November.
    6. Amos Uderzo, 2023. "Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions," Journal of Global Optimization, Springer, vol. 85(4), pages 917-940, April.
    7. Jong-Shi Pang & Defeng Sun & Jie Sun, 2003. "Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 39-63, February.
    8. Shu Lu & Amarjit Budhiraja, 2013. "Confidence Regions for Stochastic Variational Inequalities," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 545-568, August.
    9. Lu Xu & Yanhui Li & Jing Fu, 2019. "Cybersecurity Investment Allocation for a Multi-Branch Firm: Modeling and Optimization," Mathematics, MDPI, vol. 7(7), pages 1-20, July.
    10. repec:zbw:rwirep:0544 is not listed on IDEAS
    11. Metzger, Lars P., 2015. "Alliance Formation in Contests with Incomplete Information," Ruhr Economic Papers 544, RWI - Leibniz-Institut für Wirtschaftsforschung, Ruhr-University Bochum, TU Dortmund University, University of Duisburg-Essen.
    12. Christmann, Andreas & Hable, Robert, 2012. "Consistency of support vector machines using additive kernels for additive models," Computational Statistics & Data Analysis, Elsevier, vol. 56(4), pages 854-873.
    13. Shu Lu & Sudhanshu Singh, 2011. "Local Linear Convergence of an Outer Approximation Projection Method for Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 52-63, October.
    14. Shu Lu & Stephen M. Robinson, 2008. "Variational Inequalities over Perturbed Polyhedral Convex Sets," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 689-711, August.
    15. Wu Li & Ivan Singer, 1998. "Global Error Bounds for Convex Multifunctions and Applications," Mathematics of Operations Research, INFORMS, vol. 23(2), pages 443-462, May.
    16. Lars P. Metzger, 2015. "Alliance Formation in Contests with Incomplete Information," Ruhr Economic Papers 0544, Rheinisch-Westfälisches Institut für Wirtschaftsforschung, Ruhr-Universität Bochum, Universität Dortmund, Universität Duisburg-Essen.
    17. Y. Sonntag & C. Zalinescu, 2000. "Comparison of Existence Results for Efficient Points," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 161-188, April.
    18. Michael Patriksson, 2004. "Sensitivity Analysis of Traffic Equilibria," Transportation Science, INFORMS, vol. 38(3), pages 258-281, August.

    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:spr:joptap:v:107:y:2000:i:3:d:10.1023_a:1026455401079. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.