• Journal of applied mathematics & informatics
• /
• v.6 no.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.

• IE interfaces
• /
• v.24 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.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.

• Journal of the Korean Society of Safety
• /
• v.18 no.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
• /
• v.14 no.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.

• The Journal of Korean Association of Computer Education
• /
• v.21 no.4
• /
• pp.11-20
• /
• 2018

This study is to propose a problem bank of problem solving programming using Online Judge System as one of the ways to motivate learners and increase for immersion to students who take Data Structure lecture that is the basis of problem solving ability using information science. In order to do this, we developed a question bank for each major topic in the Data Structure, by developing 70 problem solving programming problems suitable for the main topics of the Data Structure. By mounting it on an Online Judge System and applying to actual classes, and by analyzing the motivation for learning and the degree of immersion according to the result after the application of the lesson, we propose a teaching-learning contents and usage for problem solving programming and Data Structure classes at the teacher training university which give motivation for learning and immerse in problem solving programming.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.6
• /
• pp.19-27
• /
• 2007

To help programming learning, we have designed a robot programming course that improves complex cognitive abilities. The developed course was implemented in college programming classes and educational effects were analysed. While students are learning through LEGO Mindstorms NXT and NXT-G software, the students' problem solving abilities have been enhanced. The developed robot programming course gives positive effects on learners' problem solving abilities. It means that the developed course helps a learner in a cognitive domain.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2009

Programming learning may help to enhance learners' complex problem solving abilities. However, it may cause excessive cognitive loads for learners. Therefore, selection of programming tools and design of teaching and learning strategies to minimize the learners' cognitive loads and to maximize the learning effects. A task centered Scratch programming learning program was developed to enhance problem solving abilities of middle school students. And then, we implemented the developed program in middle school programming classes and analysed the educational effects of the developed program. We found that the developed program was helpful in enhancing learners' problem solving abilities, especially in the element of 'troubleshooting', which explains ability of error detecting and correcting.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.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
• /
• v.17 no.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.