IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v193y2022i1d10.1007_s10957-021-01959-z.html
   My bibliography  Save this article

Two Optimal Value Functions in Parametric Conic Linear Programming

Author

Listed:
  • Nguyen Ngoc Luan

    (Hanoi National University of Education)

  • Do Sang Kim

    (Pukyong National University)

  • Nguyen Dong Yen

    (Vietnam Academy of Science and Technology)

Abstract

We consider the conic linear program given by a closed convex cone in an Euclidean space and a matrix, where vector on the right-hand side of the inequality constraint and the vector defining the objective function are subject to change. Using the strict feasibility condition, we prove the locally Lipschitz continuity and obtain some differentiability properties of the optimal value function of the problem under right-hand-side perturbations. For the optimal value function under linear perturbations of the objective function, similar differentiability properties are obtained under the assumption saying that both primal problem and dual problem are strictly feasible.

Suggested Citation

  • Nguyen Ngoc Luan & Do Sang Kim & Nguyen Dong Yen, 2022. "Two Optimal Value Functions in Parametric Conic Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 574-597, June.
  • Handle: RePEc:spr:joptap:v:193:y:2022:i:1:d:10.1007_s10957-021-01959-z
    DOI: 10.1007/s10957-021-01959-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01959-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-021-01959-z?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. Bernhard Gollan, 1984. "On The Marginal Function in Nonlinear Programming," Mathematics of Operations Research, INFORMS, vol. 9(2), pages 208-221, May.
    2. Yoshiyuki Sekiguchi & Hayato Waki, 2021. "Perturbation Analysis of Singular Semidefinite Programs and Its Applications to Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 188(1), pages 52-72, January.
    3. David G. Luenberger & Yinyu Ye, 2016. "Linear and Nonlinear Programming," International Series in Operations Research and Management Science, Springer, edition 4, number 978-3-319-18842-3, April.
    4. N. D. Yen, 1997. "Stability of the Solution Set of Perturbed Nonsmooth Inequality Systems and Application," Journal of Optimization Theory and Applications, Springer, vol. 93(1), pages 199-225, April.
    5. E. A. Yildirim, 2004. "Unifying Optimal Partition Approach to Sensitivity Analysis in Conic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 405-423, August.
    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. Gui-Hua Lin & Mei-Ju Luo & Jin Zhang, 2016. "Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints," Journal of Global Optimization, Springer, vol. 66(3), pages 487-510, November.
    2. Sandra S. Y. Tan & Antonios Varvitsiotis & Vincent Y. F. Tan, 2021. "Analysis of Optimization Algorithms via Sum-of-Squares," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 56-81, July.
    3. Michael K. McWilliam & Antariksh C. Dicholkar & Frederik Zahle & Taeseong Kim, 2022. "Post-Optimum Sensitivity Analysis with Automatically Tuned Numerical Gradients Applied to Swept Wind Turbine Blades," Energies, MDPI, vol. 15(9), pages 1-19, April.
    4. Hedlund, Jonas, 2017. "Bayesian persuasion by a privately informed sender," Journal of Economic Theory, Elsevier, vol. 167(C), pages 229-268.
    5. Vu Thi Huong & Jen-Chih Yao & Nguyen Dong Yen, 2017. "On the Stability and Solution Sensitivity of a Consumer Problem," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 567-589, November.
    6. Hasui, Kohei & Kobayashi, Teruyoshi & Sugo, Tomohiro, 2021. "Optimal irreversible monetary policy," European Economic Review, Elsevier, vol. 134(C).
    7. Duong Thi Viet An & Jen-Chih Yao, 2016. "Further Results on Differential Stability of Convex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 28-42, July.
    8. Neculai Andrei, 2020. "Diagonal Approximation of the Hessian by Finite Differences for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 859-879, June.
    9. François Le Grand & Xavier Ragot, 2022. "Managing Inequality Over Business Cycles: Optimal Policies With Heterogeneous Agents And Aggregate Shocks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(1), pages 511-540, February.
    10. Jason Xu & Eric C. Chi & Meng Yang & Kenneth Lange, 2018. "A majorization–minimization algorithm for split feasibility problems," Computational Optimization and Applications, Springer, vol. 71(3), pages 795-828, December.
    11. 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.
    12. Qiang Fu & Tian‐Yi Zhou & Xin Guo, 2021. "Modified Poisson regression analysis of grouped and right‐censored counts," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 184(4), pages 1347-1367, October.
    13. A. F. Izmailov & M. V. Solodov, 2009. "Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method," Journal of Optimization Theory and Applications, Springer, vol. 142(3), pages 501-532, September.
    14. Oliver Stein & Nathan Sudermann-Merx, 2014. "On smoothness properties of optimal value functions at the boundary of their domain under complete convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(3), pages 327-352, June.
    15. François Le Grand & Xavier Ragot, 2022. "Managing Inequality Over Business Cycles: Optimal Policies With Heterogeneous Agents And Aggregate Shocks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(1), pages 511-540, February.
    16. Arash Asadpour & MohammadHossein Bateni & Kshipra Bhawalkar & Vahab Mirrokni, 2019. "Concise Bid Optimization Strategies with Multiple Budget Constraints," Management Science, INFORMS, vol. 65(12), pages 5785-5812, December.
    17. Nitish Das & P. Aruna Priya, 2019. "A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems," Complexity, Hindawi, vol. 2019, pages 1-13, July.
    18. Aram V. Arutyunov & Alexey F. Izmailov, 2006. "Directional Stability Theorem and Directional Metric Regularity," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 526-543, August.
    19. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 0. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    20. Kohei Hasui & Teruyoshi Kobayashi & Tomohiro Sugo, 2019. "Irreversible monetary policy at the zero lower bound," Discussion Papers 1906, Graduate School of Economics, Kobe University.

    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:193:y:2022:i:1:d:10.1007_s10957-021-01959-z. 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.