Rigorous Error Bounds for Finite Dimensional Linear Programming Problems / Nejlevnější knihy
Rigorous Error Bounds for Finite Dimensional Linear Programming Problems

Kód: 01794385

Rigorous Error Bounds for Finite Dimensional Linear Programming Problems

Autor Christian Keil

This dissertation treats the theory, implementation, and application of rigorous error bounds in the context of finite dimensional linear programming problems. Despite the theory of linear programming being well understood and hav ... celý popis

206


Skladem u dodavatele
Odesíláme za 8-11 dnů
Přidat mezi přání

Mohlo by se vám také líbit

Dárkový poukaz: Radost zaručena

Objednat dárkový poukazVíce informací

Více informací o knize Rigorous Error Bounds for Finite Dimensional Linear Programming Problems

Nákupem získáte 21 bodů

Anotace knihy

This dissertation treats the theory, implementation, and application of rigorous error bounds in the context of finite dimensional linear programming problems. Despite the theory of linear programming being well understood and having numerous applications, commercial solvers frequently produce erroneous results for these problems. In contrast, verification methods yield solutions proved to be correct. The thesis presents theorems that yield rigorous error bounds, a convergence analysis, and generalizations. The software package Lurupa is described, which offers the rigorous error bounds as a standalone software, a library, and from MATLAB. Extensive numerical experiments and a comparison with other software packages are presented. They demonstrate that exploiting the special structureof a problem is necessary when aiming for fast and reliable results.

Parametry knihy

206

Oblíbené z jiného soudku



Osobní odběr Praha, Brno a 47410 dalších

Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies


Můj účet: Přihlásit se
Všechny knihy světa na jednom místě. Navíc za skvělé ceny.

Nákupní košík ( prázdný )

Vyzvednutí v Balikovně a PPL
boxech
zdarma nad 1 499 Kč.

Nacházíte se: