• Journal of applied mathematics & informatics
• /
• 제6권1호
• /
• pp.79-88
• /
• 1999

This work aims to establish an algorithm for solving the problem of convex programming with several objective-functions with linear constraints. Starting from the idea of Rosen's algorithm for solving the problem of convex programming with linear con-straints and taking into account the solution concept from multi-dimensional programming represented by a program which reaches "the best compromise" we are extending this method in the case of multidimensional programming. The concept of direction of min-imization is introduced and a necessary and sufficient condition is given for a s∈Rn direction to be a direction is min-imal. The two numerical examples presented at the end validate the algorithm.

• 산업공학
• /
• 제24권2호
• /
• pp.112-118
• /
• 2011

This paper introduces one type of prize collecting travelling salesman problem with time windows (PCTSPTW), proposes a mixed integer programming model for the problem, and shows that the problem can be reduced to the elementary shortest path problem with time windows and capacity constraints (ESPPTC). Then, a new dynamic programming algorithm is proposed to solve ESPPTC quickly. Computational results show the effectiveness of the proposed algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제24권4호
• /
• pp.27-34
• /
• 2019

The course timetabling problem is a kind of very complex combinatorial optimization problems, which is known as an NP-complete problem. Sometimes a given course timetabling problem can be accompanied by many constraints. At this time, even if only one constraint is violated, it can be an infeasible timetable. Therefore, it is very difficult to make an automated course timetabling system for a complex real-world course timetabling problem. This paper introduces an automated course timetabling system using constraint programming. The target problem has 26 constraints in total, and they are expressed as 24 constraints and an objective function in constraint programming. Currently, we are making a timetable through this system and applying the result to the actual class. Members' satisfaction is also much higher than manual results. We expect this paper can be a guide for making an automated course timetabling system.

• 한국안전학회지
• /
• 제18권1호
• /
• pp.94-100
• /
• 2003

Generally, cable-stayed bridges are both statically indeterminate structure with a high degree of redundancy and flexible structure. So it is very important to ensure precision control during both fabrication and construction. In precision control of cable-stayed bridges, precision control under multi-objective programming method is needed, because precision control problem of cable-stayed bridges is a multi-objective programming problem in which many objective functions are regard as variables. In previous studies, it was regarded as a single-objective problem, so it had many problems in respect of usefulness and rationalness. In this study, precision control under multi-objective programming method is proposed considering economy, efficiency, and safety at best in precision control of cable-stayed bridges. Precision control problem of cable-stayed bridges is formulated with satisfying trade-off method which is a kind of multi-objective programming method, then it is optimized with min-max method. A computer program is presented including above process.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권4호
• /
• pp.212-221
• /
• 2022

Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

• 컴퓨터교육학회논문지
• /
• 제21권4호
• /
• pp.11-20
• /
• 2018

본 연구에서는 교원양성 대학에서 정보과학적 문제 해결력의 기본이 되는 자료구조 강의를 수강하는 학생들에게 학습 동기를 부여하고 몰입도를 증가시킬 수 있는 방안의 하나로서, 문제해결 프로그래밍 자동평가 시스템을 적용하기 위해 자료구조의 주요 토픽별 문제 은행을 개발하였다. 자료구조의 주요 토픽에 적합한 프로그래밍 평가 문제은행 70여 문항을 개발하여, 이를 온라인 자동평가 시스템에 탑재하고, 실제 수업에 적용하였다. 수업 적용 후 결과에 따른 학습동기와 몰입도 등을 분석함으로써, 교원양성 대학에서 문제해결 프로그래밍, 자료구조 수업에서 활용할 수 있는 '학습 동기를 부여하며, 몰입하여 해결하는' 교수-학습 콘텐츠와 활용방법을 제시하였다.

• 컴퓨터교육학회논문지
• /
• 제10권6호
• /
• pp.19-27
• /
• 2007

본 연구에서는 프로그래밍 학습 과정에서 학습자가 겪는 인지적 어려움을 효과적으로 조력하기 위한 새로운 교육 방법으로 로봇 프로그래밍 학습의 가능성을 제시하고자 하였다. 로봇 프로그래밍 학습을 위한 교수 설계는 $Merri{\ddot{e}}nboer$의 4CID 모형을 기반으로 한 하향식 접근법을 사용하여 프로그래밍 과정을 통한 학습자의 복잡한 인지 능력 향상을 효과적으로 조력할 수 있도록 구성하였다. 설계된 학습 내용을 토대로 대학교 프로그래밍 관련 강좌에 적용한 결과, 레고 마인드스톰 NXT와 NXT-G 소프트웨어를 활용한 프로그래밍 학습은 학습자의 문제해결력 향상에 효과가 있는 것으로 나타났다. 이는 본 연구를 통해 설계된 교수 전략을 기반으로 한 로봇 프로그래밍 학습이 문제해결력과 같은 인지적 영역에 있어서 긍정적인 영향을 주는 것을 의미한다.

• 컴퓨터교육학회논문지
• /
• 제12권6호
• /
• pp.1-9
• /
• 2009

프로그래밍 학습은 현대사회가 요구하는 복잡한 문제해결력 향상에 도움이 되지만, 학습자에게 과도한 인지적 부담을 줄 수 있다. 따라서 인지적 부담을 감소시키기 위한 프로그래밍 도구의 선택 및 학습 효과를 최대화하기 교수 학습 전략이 요구된다. 본 연구에서는 중학생의 문제해결력 향상을 위한 과제 중심 스크래치 프로그래밍 학습 프로그램을 개발하고 해당 프로그램이 학습자의 문제해결력에 미치는 영향을 분석하였다. 연구결과, 과제 중심 스크래치 프로그래밍 학습을 수행한 집단이 일반적인 스크래치 프로그래밍 학습과 비주얼 베이식 프로그래밍 학습을 실시한 집단에 비해 문제해결력이 유의하게 향상되었다. 특히 오류를 발견하고 수정하는 능력인 문제점 해결 영역에서 유의한 차이를 더 크게 드러났다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권10호
• /
• pp.1799-1813
• /
• 2011

Many researches indicate that programming learning could help improve problem solving skills through algorithmic thinking. But in general, programming learning has been focused on programming language features and it also gave a heavy cognitive load to learners. Therefore, this paper proposes a programming activity process to improve novice programming learners' algorithmic thinking efficiently. An experiment was performed to measure the effectiveness of the proposed programming activity process. After the experiment, the learners' perception on programming was shown to be changed, to effective activity in improving problem solving.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.379-390
• /
• 2005

In this paper, optimality conditions for multiobjective programming problems having F-convex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function. Furthermore, an F-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of a saddle point are given.