Pàgina inicial > Resultats de la cerca: Linear Programming
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 5 registres trobats en 0.02 segons.
Articles, 4 registres trobats
Materials acadèmics, 1 registres trobats
Articles 4 registres trobats  
1.
15 p, 623.1 KB Worst-case analyses, linear programming and the bin-packing problem / Chan, Lap Mui Ann (The Hong Kong Polytechnic University) ; Simchi-Levi, David (Northwestern University) ; Bramel, Julien (Columbia University)
In this paper we consider the familiar bin-packing problem and its associated set-partitioning formulation. We show that the optimal solution to the bin-packing problem can be no larger than 4/3 Z _LP where Z_LP is the optimal solution value of the linear programming relaxation of the set-partitioning formulation. [...]
1998
Mathematical Programming, vol. 83 n. 2 (1998) p. 213-227  
 Accés restringit a la UAB
Registre complet -
2.
17 p, 910.0 KB Linear programming, the simplex algorithm and simple polytopes / Kalai, Gil
In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 217-233  
 Accés restringit a la UAB
Registre complet -
3.
13 p, 551.2 KB On the worst case complexity of potential reduction algorithms for linear programming / Bertsimas, Dimitris ; Xiaodong, Luo
There are several classes of interior point algorithms that solve linear programming problems in O(V~nL) iterations. Among them, several potential reduction algorithms combine both theoretical (O(V~nL) iterations) and practical efficiency as they allow the flexibility of line searches in the potential function, and thus can lead to practical implementations. [...]
1997
Mathematical Programming, vol. 77 n. 3 (1997) p. 321-333  
 Accés restringit a la UAB
Registre complet -
4.
19 p, 866.9 KB Volumetric path following algorithms for linear programming / Anstreicher, Kurt M.
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 245-263  
 Accés restringit a la UAB
Registre complet -

Materials acadèmics 1 registres trobats  
1.
3 p, 73.4 KB Programació Lineal [103193] / Alabert, Aureli ; Camps Camprubí, Rosa ; Universitat Autònoma de Barcelona. Facultat de Ciències
Aprendre a modelar problemes de presa de decisions en termes de programes lineals. Resoldre programes lineals utilitzant el mètode del símplex i amb eines informàtiques.
2018-19
Grau en Estadística Aplicada [973]
2 documents
Registre complet - Creative Commons

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.
Dipòsit Digital de Documents de la UAB :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem