Nonparametric Maximum Likelihood Estimation of a Probability Density via Mathematical Programming.
Displaying 181 – 200 of 303
Note sur les -matrices d’Edmonds
J. Edmonds, J.-F. Maurras (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Note sur une application de la classification hiérarchique à la coloration des graphes
Jacques Thépot, Gérard Lechenault (1981)
RAIRO - Operations Research - Recherche Opérationnelle
O jednom důkazu principu duality v lineárním programování
Libuše Grygarová (1985)
Časopis pro pěstování matematiky
On a bicriteria optimal production plan
Dorota Kuchta (2007)
Control and Cybernetics
On cycling in the simplex method of the transportation problem
Włodzimierz Szwarc (2009)
Applicationes Mathematicae
This paper shows that cycling of the simplex method for the m × n transportation problem where k-1 zero basic variables are leaving and reentering the basis does not occur once it does not occur in the k × k assignment problem. A method to disprove cycling for a particular k is applied for k=2,3,4,5 and 6.
On Farkas-type theorems
Winfried Schirotzek (1981)
Commentationes Mathematicae Universitatis Carolinae
On Finite Termination in the Primal-Dual Method for Linear Programming
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
On first experiences with the implementation of a Newton based linear programming approach.
Wanka, A. (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
On gradient simplex methods for linear programs.
Vemuganti, R.R. (2004)
Journal of Applied Mathematics and Decision Sciences
On hardly linearly provable systems
Jaroslav Morávek (1984)
Aplikace matematiky
A well-known theorem of Rabin yields a dimensional lower bound on the width of complete polynomial proofs of a system of linear algebraic inequalities. In this note we investigate a practically motivated class of systems where the same lower bound can be obtained on the width of almost all (noncomplete) linear proofs. The proof of our result is based on the Helly Theorem.
On interior-point methods and simplex method in linear programming.
Szabó, Zsuzsanna, Kovács, Márta (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
On Khachian's Algorithm and Minimal Ellipsoids.
H. König, D. Pallaschke (1980/1981)
Numerische Mathematik
On Nonnegative Solutions of Random Systems of Linear Inequalities.
C. Buchta (1987)
Discrete & computational geometry
On polyhedral games
J. Stahl (1971)
Applicationes Mathematicae
On some Aspects of the Matrix Data Perturbation in Linear Program
Margita Kon-Popovska (2003)
The Yugoslav Journal of Operations Research
On some polynomial solvable cases of the generalized minimum spanning tree problem.
Pop, Petrică Claudiu (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
On stable least squares solution to the system of linear inequalities
Evald Übi (2007)
Open Mathematics
The system of inequalities is transformed to the least squares problem on the positive ortant. This problem is solved using orthogonal transformations which are memorized as products. Author’s previous paper presented a method where at each step all the coefficients of the system were transformed. This paper describes a method applicable also to large matrices. Like in revised simplex method, in this method an auxiliary matrix is used for the computations. The algorithm is suitable for unstable...
On the application of parallel architectures to a class of operations research problems
Amitava Dutta, Howard J. Siegel, Andrew B. Whinston (1983)
RAIRO - Operations Research - Recherche Opérationnelle
On the Complexity of Polyhedral Separability.
N. Megiddo (1988)
Discrete & computational geometry