• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 춘계 학술발표회 논문집
• /
• pp.137-142
• /
• 2003

We discuss why sample design by mathematical programming can be beneficial to practical surveys. We illustrate some developments of software for sample design using mathematical programming in several statistical organizations. Also, we present certain restrictions on the use of mathematical programming.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.1044-1051
• /
• 2002

This paper proposes a two-phase mathematical programming approach by considering classification gap to solve the proposed credit scoring problem so as to complement any theoretical shortcomings. Specifically, by using the linear programming (LP) approach, phase 1 is to make the associated decisions such as issuing grant of credit or denial of credit to applicants. or to seek any additional information before making the final decision. Phase 2 is to find a cut-off value, which minimizes any misclassification penalty (cost) to be incurred due to granting credit to 'bad' loan applicant or denying credit to 'good' loan applicant by using the mixed-integer programming (MIP) approach. This approach is expected to and appropriate classification scores and a cut-off value with respect to deviation and misclassification cost, respectively. Statistical discriminant analysis methods have been commonly considered to deal with classification problems for credit scoring. In recent years, much theoretical research has focused on the application of mathematical programming techniques to the discriminant problems. It has been reported that mathematical programming techniques could outperform statistical discriminant techniques in some applications, while mathematical programming techniques may suffer from some theoretical shortcomings. The performance of the proposed two-phase approach is evaluated in this paper with line data and loan applicants data, by comparing with three other approaches including Fisher's linear discriminant function, logistic regression and some other existing mathematical programming approaches, which are considered as the performance benchmarks. The evaluation results show that the proposed two-phase mathematical programming approach outperforms the aforementioned statistical approaches. In some cases, two-phase mathematical programming approach marginally outperforms both the statistical approaches and the other existing mathematical programming approaches.

• 한국유기농업학회지
• /
• 제26권2호
• /
• pp.181-202
• /
• 2018

Most of eco-friendly agrifood processing enterprises in Korean rural area are small and medium-sized business. For this reason, it's hard for eco-friendly agrifood processing enterprises to neither analyze business performance for efficient business management nor establish their own business plan for rational decision-making. Therefore it's necessary to design effective mathematical programming model and to make practical application which can support rational management decision-making ensuring the stable business activity of eco-friendly agrifood processing enterprises. Accordingly this paper focuses on the designing and its application of multi-objective mathematical programming model using goal programming to support rational decision-making of eco-friendly agrifood processing enterprise. Hansalimanseongmachum Food Inc. which runs soy bean processing business making tofu based on regional-based soybean farms around Anseong City will be the specific case to apply multi-objective mathematical programming model in practice. And it will suggest measures to support rational management decision-making of other eco-friendly agrifood processing enterprises.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.307-312
• /
• 1994

The authors have been devoted to researches on fuzzy theories and their applications, especially control theory and application problems, for recent years. In this paper, the authors present results on a comparison of optimal solutions between ones of an ordinary-typed mathematical linear programming problem(O.M.I.P. problem) and ones of a Zimmerman-typed fuzzy mathematical linear programming problem (F.M.L.P. problem), and comment about the sensitivity (differences and fuzziness on between O.M.L.P. problem and F.M.L.P. problem) on optimal solutions of these mathematical linear programming problems.

• 대한수학회논문집
• /
• 제27권2호
• /
• pp.411-423
• /
• 2012

A nondifferentiable nonlinear semi-infinite programming problem is considered, where the functions involved are ${\eta}$-semidifferentiable type I-preinvex and related functions. Necessary and sufficient optimality conditions are obtained for a nondifferentiable nonlinear semi-in nite programming problem. Also, a Mond-Weir type dual and a general Mond-Weir type dual are formulated for the nondifferentiable semi-infinite programming problem and usual duality results are proved using the concepts of generalized semilocally type I-preinvex and related functions.

• 대한수학회지
• /
• 제35권2호
• /
• pp.259-268
• /
• 1998

In this paper the stochastic multiple objective programming problems where the right-hand-side of the constraints is stochastic are considered. We define the equivalent scalar-valued problem and study the stability of the equivalent scalar-valued problem with respect to the weight parameters and probability mesures under reasonable assumptions.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.169-186
• /
• 1994

This paper presents three mathematical programming approaches to solving transshipment problems with interval supply and demand requirements. A linear goal programming model was developed based on the data obtained from a nationwide retail firm. Three mathematical programming model results were compared and analyzed, and three separate hypotheses were examined by using the Wilcoxon signed-ranked test for the model applicability. The test results were analyzed and interpreted for decision making.

• 대한수학회논문집
• /
• 제20권4호
• /
• pp.837-847
• /
• 2005

We consider multiobjective fractional programming problems with generalized invexity. An equivalent multiobjective programming problem is formulated by using a modification of the objective function due to Antczak. We give relations between a multiobjective fractional programming problem and an equivalent multiobjective fractional problem which has a modified objective function. And we present modified vector saddle point theorems.

• 충청수학회지
• /
• 제27권1호
• /
• pp.145-149
• /
• 2014

I consider the optimal consumption and portfolio selection problem with nonnegative wealth constraints using the dynamic programming approach. I use the constant relative risk aversion (CRRA) utility function and disutility to derive the closed-form solutions.

• 대한수학회보
• /
• 제32권2호
• /
• pp.287-296
• /
• 1995

Wets ([4],[5],[6]) considered single objective linear two-stage programming problem under uncertainty with complete recourse. Artstein, Dupacova, Romisch, Schultz and Wets studied stability of this problem id depth. But in many real world problems to make best decision, we need multiple objective functions. So we consider the following multiple objective two-stage programming problems with complete fixed recourse.