{"id":140000,"date":"2026-01-12T17:50:44","date_gmt":"2026-01-12T17:50:44","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/un-algoritmo-primal-para-el-problema-continuo-de-programacion-semi-infinita-lineal\/"},"modified":"2026-01-12T17:50:44","modified_gmt":"2026-01-12T17:50:44","slug":"un-algoritmo-primal-para-el-problema-continuo-de-programacion-semi-infinita-lineal","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/un-algoritmo-primal-para-el-problema-continuo-de-programacion-semi-infinita-lineal\/","title":{"rendered":"Un algoritmo primal para el problema continuo de programacion semi-infinita lineal."},"content":{"rendered":"<h2>Tesis doctoral de <strong>  Leon Mendoza M. Teresa <\/strong><\/h2>\n<p>Presentamos un metodo tipo simplex para el problema continuo de programacion semi-infinita lineal. El nucleo de dicho metodo es un algoritmo de purificacion que, en un numero finito de interaciones, conduce desde una solucion posible una solucion posible basica ala menos tan buena como la de partida o detecta la no acotacion del problema. Comprobamos la optimalidad de las soluciones candidatas aplicando un sencillo test basado en una caracterizacion de tipo kuhn-tucker.  tanto el algoritmo de purificacion como el test se basan en la resolucion de una sucesion de problemas de programacion lineal.  asimismo damos la regla para determinar direcciones de descenso tanto para el caso no degenerado comoa para el generado. Y tambien numerosos ejemplos numericos para ilustrar el procedimiento.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Un algoritmo primal para el problema continuo de programacion semi-infinita lineal.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Un algoritmo primal para el problema continuo de programacion semi-infinita lineal. <\/li>\n<li><strong>Autor:<\/strong>\u00a0  Leon Mendoza M. Teresa <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Universitat de val\u00e9ncia (estudi general)<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1992<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li>M\u00aa Enriqueta Vercher Gonz\u00e1lez<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Marco Antonio L\u00f3pez Cerd\u00e1 <\/li>\n<li>Miguel Angel Goberna Torrent (vocal)<\/li>\n<li>Jaume Barcel\u00f3 Bugeda (vocal)<\/li>\n<li>Ram\u00f3n Alvarez-vald\u00e9s Olagu\u00edbel (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Leon Mendoza M. Teresa Presentamos un metodo tipo simplex para el problema continuo de programacion semi-infinita lineal. [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[1191,16880,6264,126,8135],"tags":[15707,254554,11395,11397,73260,27418],"class_list":["post-140000","post","type-post","status-publish","format-standard","hentry","category-analisis-numerico","category-construccion-de-algoritmos","category-investigacion-operativa","category-matematicas","category-programacion-lineal","tag-jaume-barcelo-bugeda","tag-leon-mendoza-m-teresa","tag-marco-antonio-lopez-cerda","tag-miguel-angel-goberna-torrent","tag-ma-enriqueta-vercher-gonzalez","tag-ramon-alvarez-valdes-olaguibel"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/140000","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=140000"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/140000\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=140000"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=140000"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=140000"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}