• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.1
• /
• pp.11-16
• /
• 1982

A method is described for the solution of a linearly constrained program with parametric nonlinear objective function. The algorithm proposed in this paper may be regarded as an extension of the simplex method for parametric linear programming. Namely, it specifies the basis at each stage such that feasibility ana optimality of the original problem are satisfied by the optimal solution of the reduced parametric problem involving only nonbasic variables. It is shown that under appropriate assumptions the algorithm is finite. Parametric procedures are also indicated for solving each reduced parametric problem by maintaining the Kuhn-Tucker conditions as the parameter value varies.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.166-174
• /
• 2016

In this paper, we developed a mixed-integer linear programming model for transportation planning of athletes in sports events. The transportation planning of athletes involves finding the lowest-cost and fastest-time plan for distributing athletes from multiple accommodation to stadium. The decision variables associate with the number of driving events, and the total transportation cost is the objective function that needs to be minimized. The proposed method uses mixed integer linear programming to solve transportation problem, thus the global optimality is guaranteed. In order to verify the effectiveness of proposed method, we performed simulation and built the sports event management service platform (SEMSP) for transportation planning.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.62-72
• /
• 2003

This paper deals with a crosstalk minimization method by wire spacing. The suggested method uses linear programming method and consider crosstalk of both horizontal segments and vertical segments. In this paper, we suggest a method which can predict the coupling length between vertical segments in the final routing result using longest path algorithm. By the suggested method, we can make LP problem without integer variable. Therefore, it is much faster to solve the problem. In the case of crosstalk optimization, the suggested method optimized peak crosstalk 11.2%, and 3% total crosstalk more than wire perturbation method. The execution time of the suggested method is as fast as it takes 11 seconds when Deutsch is optimized.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.1-9
• /
• 2010

In this paper, we propose a methodology in which a power-delay product of a binary adder is optimized based on the heterogeneous adder architecture. We formulate the power-delay product of the heterogeneous adder by using integer linear programming(ILP). For the use of ILP optimization, we adopt a transformation technique in which the initial non-linear expression for the power-delay product is converted into linear expression. The experimental result shows the superiority of the suggested method compared to the cases in which only conventional adder is used.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3121-3142
• /
• 2017

We present a method for 3D shape reconstruction of inextensible deformable surfaces from a single image. The key of our approach is to represent the surface as a 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which are designed to retain original lengths of mesh edges. We use a closed-form method to generate an initial structure, then refine this structure by solving the LP problem iteratively. Compared with previous methods, ours neither involves smoothness constraints nor temporal consistency, which enables us to recover shapes of surfaces with various deformations from a single image. The robustness and accuracy of our approach are evaluated quantitatively on synthetic data and qualitatively on real data.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.2
• /
• pp.51-60
• /
• 2008

A solution method for fuzzy linear programs is proposed. A fuzzy linear program is converted to a crisp linear program with average indices being applied to the objective function and constraints. A comparative analysis between the proposed average index approach and the possibilistic approach is given. As an application example, the proposed method is applied to the linear programming model for fuzzy data envelopment analysis, and the result is compared with that of the possibilistic approach.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.7
• /
• pp.833-839
• /
• 2018

This paper presents an analysis and the methodology of optimal operation strategy of the ESS(Energy Storage System) for reduce electricity charges. Electricity charges consist of a basic charge based on the contract capacity and energy charge according to the power usage. In order to use electrical energy at minimal charge, these two factors are required to be reduced at the same time. QP(Quadratic Programming) is appropriate for minimization of the basic charge and LP(Linear Programmin) is adequate to minimize the energy charge. However, the integer variable have to be introduced for modelling of different charge and discharge efficiency of ESS PCS(Power Conversion System), where MILP(Mixed Integer Linear Programming) can be used. In this case, the extent to which the peak load savings is accomplished should be assumed before the energy charge is minimized. So, to minimize the electricity charge exactly, optimization is sequentially performed in this paper, so-called the Two Stage Hybird optimization, where the extent to which the peak load savings is firstly accomplished through optimization of basic charge and then the optimization of energy charge is performed with different charge and discharge efficiency of ESS PCS. Finally, the proposed method is analyzed quantitatively with other optimization methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.2
• /
• pp.21-23
• /
• 1981

It is known that two-person zero-sum game with vector payoff can be reduced to a multiple objective linear programming. However, in this case, solutions for the game nay not be one, but many, In many cases in reality, one may need only one solution rather than all solutions. This paper develops a method to find a practical solution for the game by linear programming.

• IE interfaces
• /
• v.1 no.1
• /
• pp.1-7
• /
• 1988

This paper discusses the applicability of the decomposition principle to an LP (Linear Programming) problem. Through a case study on product mix problems in a chemical process of Korean Steel Chemical Co., Ltd., the decomposition algorithm, LP Simplex method and a modified method are compared and evaluated in computation time and number of iterations.