• 한국경영과학회지
• /
• 제15권2호
• /
• pp.33-44
• /
• 1990

An efficient algorithm is developed for the linear programming relaxation of generalized multiple choice knaspack problem. The generalized multiple choice knaspack problem is an extension of the multiple choice knaspack problem whose relaxed LP problem has been studied extensively. In the worst case, the computational coimplexity of the proposed algorithm is of order 0(n. $n_{max}$)$^{2}$), where n is the total number of variables and $n_{max}$ denotes the cardinality of the largest multiple choice set. The algorithm can be easily embedded in a branch-and-bound procedure for the generalized multiple choice knapsack problem. A numerical example is presented and computational aspects are discussed.sed.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.661-667
• /
• 1997

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.365-375
• /
• 1996

We consider an extension of the multiple choice linear knapsack problem and develop a fast algorithm of order $O(r_{max}n^2)$ by exploiting some new properties, where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm has convenient structures for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.519-527
• /
• 1995

By finding some new properties, we develop an O($r_{max}n^2$) algorithm for the generalized multiple choice linear knapsack problem where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm can easily be embedded in a branch-and-bound procedure due to its convenient structure for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.291-299
• /
• 1998

We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.

• 한국초등과학교육학회지:초등과학교육
• /
• 제23권4호
• /
• pp.332-343
• /
• 2004

Multiple choice items have been widely used. However the difficulties in understanding and solving the items have not been known well. The purpose of this study is to analyze the difficulties and errors in the process of solving multiple choice items. Twelve multiple choice items were developed based on the Unit 5 Separation of Mixtures in the 4th grade. Four items which students had hardly given the correct answer were selected and six students were chosen for interview. Interview results were analyzed with regard to the errors in the process of solving the multiple choice items. The findings of this study are as follows: I) The students who misread and misunderstand the questions choose the incorrect answers. 2) Most of the students activate daily knowledge in the process of problem solving. 3) The students who have misconception with the daily knowledge or have no experiences choose incorrect answers, while students who activate both daily knowledge and school knowledge choose correct answer. 4) The students of high level commit errors mainly in the latter part of problem solving process, but the students of low level do from early.

• 대한산업공학회지
• /
• 제40권4호
• /
• pp.396-403
• /
• 2014

The multi-divisional knapsack problem is defined as a binary knapsack problem where each mutually exclusive division has its own capacity. In this paper, we present an extension of the multi-divisional knapsack problem that has generalized multiple-choice constraints. We explore the linear programming relaxation (P) of this extended problem and identify some properties of problem (P). Then, we develop a transformation which converts the problem (P) into an LP knapsack problem and derive the optimal solutions of problem (P) from those of the converted LP knapsack problem. The solution procedures have a worst case computational complexity of order $O(n^2{\log}\;n)$, where n is the total number of variables. We illustrate a numerical example and discuss some variations of problem (P).

• 대한산업공학회지
• /
• 제9권2호
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.31-41
• /
• 1992

An extension of generalized linear multiple choice knapsack problem [1] is presented and an algorithm of order 0([n .n$_{max}$]$_{2}$) is developed by exploiting its extended properties, where n and n$_{max}$ denote the total number of variables and the cardinality of the largest multiple choice set, respectively. A numerical example is presented and computational aspects are discussed.sed.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제22권4호
• /
• pp.489-503
• /
• 2008

대학수학에서 배우는 여러 가지 수학적 개념을 이해하는데 좋은 문제를 통해 도움을 주고 평가에서 공정성을 확보하기 위해 문제풀이에서 개념을 이용하는 능력과 개념에 대한 이해를 조사하는 문제의 예를 미분적분학 문제로 세 가지 유형을 다루었다. 잘못 만들어진 단답형문제와 선다형문제의 예를 제시하고 또 증명문제의 경우를 포함하여 선다형문제를 잘 만드는 방법에 대해 알아보고 최선의 문제가 되도록 노력을 하고 개념의 이해를 도와주며 최선의 문제가 될 수 있도록 더 많은 연구가 이루어지고 학생들에 대한 조사를 시도하여 그 결과를 분석하고 더 정선된 문제를 얻도록 노력을 한다.