Some directions and results of research in mathematical programming and system analysis
From MaRDI portal
Publication:1918737
DOI10.1007/BF02366513zbMath0849.90127OpenAlexW2053479232MaRDI QIDQ1918737
Publication date: 25 August 1996
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02366513
Development of contemporary mathematics (01A65) Schools of mathematics (01A72) Mathematical programming (90C99)
Related Items
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Mathematical simulation of the immunomodulating role of energy metabolism in support of synergism and antagonism of the compartments of an immune system
- Dual estimates in multiextremal problems
- More on conditions of local and global minima coincidence in discrete optimization problems
- Application of implicit enumeration to solve the packing problem
- Stability of discrete optimization problems
- Optimization of computations
- Mathematical models and methods of risk assessment in ecologically hazardous industries
- Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms
- Vector optimization problems: Stability in the decision space and in the space of alternatives
- Integral packing of trees and branchings
- Control problem for diffusion-type random fields
- Conflict controlled processes with discontinuous trajectories
- Large deviations of empirical estimates in stochastic programming problems
- Parallel organization of calculations in solving linear equations by projection-iteration methods
- Sequential Bayes Solutions and Optimal Methods of Statistical Acceptance Control
- Sequential approach to the solution of mixed linear programs
- An approach to the solution of the set-covering problem
- Dynamic decomposition method for linear programming problems with ceneralized upper bounds
- Class of global minimum bounds of polynomial functions
- An approach to obtaining global extremums in polynomial mathematical programming problems
- An approach to the construction of approximate solutions of Boolean linear programming problems
- Disnel: An application package for solving discrete and nonlinear optimization problems
- Sufficient conditions for extremum, penalty functions and regularity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
