Linear programming techniques have been used successfully in a variety of test assembly problems. It is, however, possible that no test can be found meeting all the constraints in the linear programming model. The problem of diagnosing and repairing infeasible linear programming models is discussed. It is demonstrated that it is possible to localize the causes of infeasibility
Executive Summary In automated test assembly (ATA), 0-1 linear programming (0-1 LP) methods are appl...
Linear programming models with 0-1 variables are useful for the construction of tests from an item b...
Constraint systems, problems defined by sets of variables and constraints affecting the allowed assi...
Linear programming techniques have been used successfully in a variety of test assembly problems. It...
In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very ...
As linear programs have grown larger and more complex, infeasible models are appearing more frequent...
This article shows how set covering with item sampling (SCIS) methods can be used in the analysis an...
When a linear programming problem is found to have no feasible solution, the model-builder generally...
Several techniques exist to automatically put together a test meeting a number of specifications. In...
Several techniques exist to automatically put together a test meeting a number of specifications. In...
Several techniques exist to automatically put together a test meeting a number of specifications. In...
Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been...
This paper presents methods to provide computer-assisted analysis to diagnose infeasible or unbounde...
In automated test assembly (ATA), 0-1 linear programming (0-1 LP) methods are applied to select ques...
This report contains a review of procedures for computerized assembly of linear, sequential, and ada...
Executive Summary In automated test assembly (ATA), 0-1 linear programming (0-1 LP) methods are appl...
Linear programming models with 0-1 variables are useful for the construction of tests from an item b...
Constraint systems, problems defined by sets of variables and constraints affecting the allowed assi...
Linear programming techniques have been used successfully in a variety of test assembly problems. It...
In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very ...
As linear programs have grown larger and more complex, infeasible models are appearing more frequent...
This article shows how set covering with item sampling (SCIS) methods can be used in the analysis an...
When a linear programming problem is found to have no feasible solution, the model-builder generally...
Several techniques exist to automatically put together a test meeting a number of specifications. In...
Several techniques exist to automatically put together a test meeting a number of specifications. In...
Several techniques exist to automatically put together a test meeting a number of specifications. In...
Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been...
This paper presents methods to provide computer-assisted analysis to diagnose infeasible or unbounde...
In automated test assembly (ATA), 0-1 linear programming (0-1 LP) methods are applied to select ques...
This report contains a review of procedures for computerized assembly of linear, sequential, and ada...
Executive Summary In automated test assembly (ATA), 0-1 linear programming (0-1 LP) methods are appl...
Linear programming models with 0-1 variables are useful for the construction of tests from an item b...
Constraint systems, problems defined by sets of variables and constraints affecting the allowed assi...
Add to ORKG