{"id":14645,"date":"2019-09-02T08:46:43","date_gmt":"2019-09-02T08:46:43","guid":{"rendered":"http:\/\/cio.edu.umh.es\/?p=14645"},"modified":"2021-07-22T09:50:22","modified_gmt":"2021-07-22T07:50:22","slug":"lipschitz-modulus-of-the-optimal-value-in-linear-programming-2019-journal-of-optimization-theory-and-applications-182-133-152","status":"publish","type":"post","link":"https:\/\/cio.umh.es\/en\/2019\/09\/02\/lipschitz-modulus-of-the-optimal-value-in-linear-programming-2019-journal-of-optimization-theory-and-applications-182-133-152\/","title":{"rendered":"Lipschitz Modulus of the Optimal Value in Linear Programming (2019). Journal of Optimization Theory and Applications, 182, 133-152."},"content":{"rendered":"<p><strong>Mar\u00eda Jes\u00fas Gisbert\u00a0<\/strong>(<em>Miguel Hern\u00e1ndez University of Elche<\/em>), <strong>Mar\u00eda Josefa C\u00e1novas\u00a0<\/strong>(<em>Miguel Hern\u00e1ndez University of Elche<\/em>), <strong>Juan Parra <\/strong>(<em>Miguel Hern\u00e1ndez University of Elche<\/em>)\u00a0and\u00a0<strong>Fco. Javier Toledo <\/strong>(<em>Miguel Hern\u00e1ndez University of Elche<\/em>).<br \/>\n<strong>Abstract.<\/strong>\u00a0The present paper is devoted to the computation of the Lipschitz modulus of the optimal value function restricted to its domain in linear programming under different types of perturbations. In the first stage, we study separately perturbations of the right-hand side of the constraints and perturbations of the coefficients of the objective function. Secondly, we deal with canonical perturbations, i.e., right-hand side perturbations together with linear perturbations of the objective. We advance that an exact formula for the Lipschitz modulus in the context of right-hand side perturbations is provided, and lower and upper estimates for the corresponding moduli are also established in the other two perturbation frameworks. In both cases, the corresponding upper estimates are shown to provide the exact moduli when the nominal (original) optimal set is bounded. A key strategy here consists in taking advantage of the background on calmness in linear programming and providing the aimed Lipschitz modulus through the computation of a uniform calmness constant.<br \/>\n<strong>Keywords.\u00a0<\/strong>Lipschitz modulus; Optimal value; Linear programming; Variational analysis; Calmness<\/p>","protected":false},"excerpt":{"rendered":"<p>Mar\u00eda Jes\u00fas Gisbert\u00a0(Miguel Hern\u00e1ndez University of Elche), Mar\u00eda Josefa C\u00e1novas\u00a0(Miguel Hern\u00e1ndez University of Elche), Juan Parra (Miguel Hern\u00e1ndez University of Elche)\u00a0and\u00a0Fco. Javier Toledo (Miguel Hern\u00e1ndez University of Elche).<br \/>\nAbstract.\u00a0The present paper is devoted to the computation of the Lipschitz modulus of the optimal value function restricted to its domain in linear programming under different types of [&#8230;]<\/p>","protected":false},"author":3477,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[369888],"tags":[],"_links":{"self":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/14645"}],"collection":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/users\/3477"}],"replies":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/comments?post=14645"}],"version-history":[{"count":0,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/14645\/revisions"}],"wp:attachment":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/media?parent=14645"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/categories?post=14645"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/tags?post=14645"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}