On the problem of probabilistic optimization of time-limited testing
- Authors: Naumov A.V.1, Mkhitaryan G.A.1
- 
							Affiliations: 
							- Moscow State Aviation Institute
 
- Issue: Vol 77, No 9 (2016)
- Pages: 1612-1621
- Section: Stochastic Systems, Queueing Systems
- URL: https://journals.rcsi.science/0005-1179/article/view/150437
- DOI: https://doi.org/10.1134/S0005117916090083
- ID: 150437
Cite item
Abstract
For the distance learning systems, consideration was given to generation of individual tasks with limited performance time, and an algorithm was suggested to solve it. Such problem comes to that of integer stochastic programming with probabilistic constraints. Considered were the distributions of the random student’s time of response to the task such as the Van der Linden lognormal model and the discrete model based on empirical data. It was assumed that task complexities are estimated either by an expert or by using corresponding algorithms. For the case of continuous distribution, an algorithm was proposed based on the branch-and-bound principle. Results of the numerical experiments were presented.
About the authors
A. V. Naumov
Moscow State Aviation Institute
							Author for correspondence.
							Email: naumovav@mail.ru
				                					                																			                												                	Russian Federation, 							Moscow						
G. A. Mkhitaryan
Moscow State Aviation Institute
														Email: naumovav@mail.ru
				                					                																			                												                	Russian Federation, 							Moscow						
Supplementary files
 
				
			 
					 
						 
						 
						 
						 
				 
  
  
  
  
  Email this article
			Email this article  Open Access
		                                Open Access Access granted
						Access granted Subscription Access
		                                		                                        Subscription Access
		                                					