Journal: Alkalmazott Matematikai Lapok

Found 53 papers in total
A multivariate utility function
A multivariate utility function
2004,
A univariate utility function u(z ) is usually required to satisfy the conditions u...
New variants of the criss-cross method for linear complementarity problems with bisymmetric matrices
New variants of the criss-cross method for linear complementarity problems with bisymmetric matrices
2004,
In this paper, S. Zhang's new and more flexible criss-cross type pivot rule is...
Lower and upper bounds for the expected time to failure of systems
Lower and upper bounds for the expected time to failure of systems
2004,
In large series-parallel systems the exact calculation of the expected time to failure...
Some polynomial programming problems solving with a clustering algorithm
Some polynomial programming problems solving with a clustering algorithm
2000,
In my study I describe an optimum search clustering algorithm and I demonstrate its...
Probability bounds given by hypercherry trees
Probability bounds given by hypercherry trees
1999,
In the paper new bounds are given for the probability of the union of events. For this...
Probability bounds given by multitrees
Probability bounds given by multitrees
2000,
Upper bounds are presented for the probability of the union of finite number of...
Mathematical statistical characterization of high-speed computer network traffic data
Mathematical statistical characterization of high-speed computer network traffic data
1999,
The studying of high-speed networks is an actual problem in both fields of modeling of...
Gradient method in Sobolev spaces: Approximate solution of linear boundary value problems using polynomials
Gradient method in Sobolev spaces: Approximate solution of linear boundary value problems using polynomials
1999,
The subject of the paper is the application of the Hilbert space version of the...
A label-setting algorithm for calculating shortest path trees in sparse networks
A label-setting algorithm for calculating shortest path trees in sparse networks
1999,
Shortest path analysis is a major analytical component of numerous quantitative...
Heuristical methods for the relaxed two-dimensional rectangle scheduling problem
Heuristical methods for the relaxed two-dimensional rectangle scheduling problem
1999,
We are dealing with a problem of one-resource-constrained scheduling: How can a number...
Generalized multifit-type methods for scheduling parallel identical machines
Generalized multifit-type methods for scheduling parallel identical machines
1999,
We investigate a very well known NP-complete problem of the scheduling-theory:...
Generalized multifit-type methods II
Generalized multifit-type methods II
2000,
We investigate a well known NP-complete problem of the scheduling theory: scheduling...
Determination of densest ball packings under cubic crystallographic groups by computer
Determination of densest ball packings under cubic crystallographic groups by computer
1999,
The famous unsolved KEPLER conjecture about the densest ball packing of the whole...
The exponential barrier programming, as an analytical approximation of the linear programming
The exponential barrier programming, as an analytical approximation of the linear programming
1999,
We presented a special convex programming problem as an analytical approximation of...
Parallel movement of inflation, domestic and foreign equilibria
Parallel movement of inflation, domestic and foreign equilibria
2000,
The paper attempts to reveal the mechanism of the inflationary policy of the Hungarian...
Computation of elastic–plastic plane frames by mathematical programming in case of first, second and third order theory
Computation of elastic–plastic plane frames by mathematical programming in case of first, second and third order theory
1999,
Paper describes the analysis of the one parameter loading history of frames using a...
An asynchronous stochastic approximation theorem and some applications
An asynchronous stochastic approximation theorem and some applications
1999,
In the paper we are concerned with the adaptive optimal control of Markov decision...
Decomposable sets
Decomposable sets
2000,
Decomposability, a theory analogous to convexity, has recently achieved a major...
Iterations generated by tangential convex functions for solving equations
Iterations generated by tangential convex functions for solving equations
1998,
For solving nonlinear equations, Z. Szabó worked out the method based on always...
Equivalence of the linear alternative, existence and duality theorems
Equivalence of the linear alternative, existence and duality theorems
1998,
We prove in the paper that the classical linear alternative and existence theorems,...
Nonhomogeneous linear theorems of the alternative
Nonhomogeneous linear theorems of the alternative
1998,
Generalizing the classical theorems, theorems of the alternative of new, common forms...
New bounds on the reliability of the consecutive k-out-of-r-from-n:F system
New bounds on the reliability of the consecutive k-out-of-r-from-n:F system
1998,
In this paper we give new lower and upper bounds on the failing probability or...
Statistical characterization of defective section in a length of fiberglass
Statistical characterization of defective section in a length of fiberglass
1998,
Fiberglass may contain faulty sections in a random manner. For a given length of...
A new CPM time–cost trade-offs algorithm
A new CPM time–cost trade-offs algorithm
1993,
In this paper we give a fast, new algorithm for the Critical Path Method...
Papers per page: