scholarly journals Linear programming method to construct equated item sets for the implementation of periodical computer-based testing for the Korean Medical Licensing Examination

Author(s):  
Dong Gi Seo ◽  
Myeong Gi Kim ◽  
Na Hui Kim ◽  
Hye Sook Shin ◽  
Hyun Jung Kim

Purpose: This study aimed to identify the best way of developing equivalent item sets and to propose a stable and effective management plan for periodical licensing examinations. Methods: Five pre-equated item sets were developed based on the predicted correct answer rate of each item using linear programming. These pre-equated item sets were compared to the ones that were developed with a random item selection method based on the actual correct answer rate (ACAR) and difficulty from item response theory (IRT). The results with and without common items were also compared in the same way. ACAR and the IRT difficulty were used to determine whether there was a significant difference between the pre-equating conditions. Results: There was a statistically significant difference in IRT difficulty among the results from different pre-equated conditions. The predicted correct answer rate was divided using 2 or 3 difficulty categories, and the ACAR and IRT difficulty parameters of the 5 item sets were equally constructed. Comparing the item set conditions with and without common items, including common items did not make a significant contribution to the equating of the 5 item sets. Conclusion: This study suggested that the linear programming method is applicable to construct equated-item sets that reflect each content area. The suggested best method to construct equated item sets is to divide the predicted correct answer rate using 2 or 3 difficulty categories, regardless of common items. If pre-equated item sets are required to construct a test based on the actual data, several methods should be considered by simulation studies to determine which is optimal before administering a real test.

2019 ◽  
Vol 6 (04) ◽  
Author(s):  
ASHUTOSH UPADHYAYA

A study was undertaken in Bhagwanpur distributary of Vaishali Branch Canal in Gandak Canal Command Area, Bihar to optimally allocate land area under different crops (rice and maize in kharif, wheat, lentil, potato in rabi and green gram in summer) in such a manner that maximizes net return, maximizes crop production and minimizes labour requirement employing simplex linear programming method and Multi-Objective Fuzzy Linear Programming (MOFLP) method. Maximum net return, maximum agricultural production, and minimum labour required under defined constraints (including 10% affinity level of farmers to rice and wheat crops) as obtained employing Simplex method were ` 3.7 × 108, 5.06 × 107 Kg and 66,092 man-days, respectively, whereas Multi-Objective Fuzzy Linear Programming (MOFLP) method yielded compromised solution with net return, crop production and labour required as ` 2.4 × 108, 3.3 × 107Kg and 1,79,313 man-days, respectively. As the affinity level of farmers to rice and wheat crops increased from 10% to 40%, maximum net return and maximum production as obtained from simplex linear programming method and MOFLP followed a decreasing trend and minimum labour required followed an increasing trend. MOFLP may be considered as one of the best capable ways of providing a compromised solution, which can fulfill all the objectives at a time.


2017 ◽  
Vol 51 (22) ◽  
pp. 13086-13094 ◽  
Author(s):  
Hajime Ohno ◽  
Kazuyo Matsubae ◽  
Kenichi Nakajima ◽  
Yasushi Kondo ◽  
Shinichiro Nakamura ◽  
...  

Author(s):  
Tayisa Vozniuk ◽  
Olga Mazur

In this article reveals an example of forecasting the volumes of sales goods through ways of implement optimization analysis, that is by linear programming method. For example, volume of production goods for realization her consumers no must to exceed of determined out maximum or to be lower by minimum, what can to foreseeing in this task. For decision tasks of linear programming with a large number of variables and constraints, decomposition methods are used, which allow instead of the original problem to solve tasks of little volume. In general methodology of linear programming together with simplex-method is considered on the example Nemyriv bakery, where determined out profit on unit bakery products, obtained through the optimal ratio of material resources and costs incurred. In analysis and treatment of economic activities the each enterprises, particularly at composition forecast as to volumes of sales goods with aim of receiving profit, linear programming maybe successfully used out for decision tasks with optimization of development and organization trade processes upon regarding the sale of its products. With point of view management a tasks of linear programming – this tasks of optimal using resources. In each event planning of production goods necessity have on attention, which different productions resources (workforce, raw, materials, means of production) are limited, and also which known norm of costs these resources on different kinds goods, or possible are multiples variants to separating production resources. In our work, we ascertained that in analysis, compliance is checked of demand for bakery products to stocks of most-important kinds raw and materials together with costs as most important conditions for receive profit on enterprises and avoiding of excessive and unforeseen losses. With aim of rise efficiency of enterprises activities necessary and further to look at question of renewing assortment goods and increase quality her, increasing volumes of production, maximum of loading production powers equipment, efficiency using of available resources.


2010 ◽  
Vol 27 (5) ◽  
pp. 985 ◽  
Author(s):  
Changjun Li ◽  
M. Ronnier Luo ◽  
Maeng-Sub Cho ◽  
Jin-Seo Kim

Sign in / Sign up

Export Citation Format

Share Document