• Structural Engineering and Mechanics
• /
• v.14 no.4
• /
• pp.473-489
• /
• 2002

A static linear programming formulation for minimum weight design of frames that is based on a matrix displacement method is presented in this paper. According to elementary theory of plasticity, minimum weight design of frames can be carried out by using only the equilibrium equations, because the system is statically determinate when at an incipient collapse state. In the present formulation, a statically determinate released frame is defined by introducing hinges into the real frame and the bending moments in yield constraints are expressed in terms of unit hinge rotations and the external loads respectively, by utilizing the matrix displacement method. Conventional Simplex algorithm with some modifications is utilized for the solution of linear programming problem. As the formulation is based on matrix displacement method, it may be easily adopted to the weight optimization of frames with displacement and deformation limitations. Four illustrative examples are also given for comparing the results to those obtained in previous studies.

• Korean Journal of Poultry Science
• /
• v.8 no.1
• /
• pp.31-36
• /
• 1981

This study was conducted to investigate how much total feed cost can be curtailed by the application of linear programming compared with the conventional hand calculating method in determining the feed formula in feed mill. Data were collected from a feed mill producing 19 different kinds of feed and having capacity of producing 5,000 tons of feed a month. According to the results of analysis, the least-cost feed formulation by linear programming showed a decrease of 4,793,172 won monthly in total feed cost as compared with the conventional hand calculating method. But, to confirm the results of this study, it is necessary to conduct further emperical studies.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.517-523
• /
• 2011

A lot of DSM (Demand Side Management) programs have been implemented to promote the effective utilization of resources and the rational development of power industry, and various economic analyses and policy-based studies on DSM have been executed to determine effective subsidy budget. In this paper, a new objective function for deciding an optimal incentive allocation among various programs is presented by introducing the maximization of the total saving power of the programs. For simplicity, the objective function and the constraints is linearized to apply LP(Linear Programming) method. LP program based on Simplex Method was developed by MATLAB. An optimal incentive allocation of 4 DSM programs is presented by the use of the developed MATLAB program.

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.429-439
• /
• 1995

The Interior point method in linear programming is classified into two categories the affine-scaling method and the logarithmic barrier method. In this paper, we integrate those methods and implement them in one shared module. First, we analyze the procedures of two interior point methods and then find a unified formula in finding directions to improve the current solution and conditions to terminate the procedure. Second, we build the shared modules which can be used in each interior point method. Then these modules are experimented in NETLIB problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.13 no.1
• /
• pp.53-60
• /
• 1987

Karmakar suggested two methods to transform the general linear programming into his specially structured linear programming problem. We show that there are bad cases that cause difficulties in the use of Karmakar's methods. We also develop a new transformation method which can handle those difficulties.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.293-303
• /
• 2006

This paper describes a numerical scheme for optimal control of a time-dependent linear system to a moving final state. Discretization of the corresponding differential equations gives rise to a linear algebraic system. Defining some binary variables, we approximate the original problem by a mixed integer linear programming (MILP) problem. Numerical examples show that the resulting method is highly efficient.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.166-173
• /
• 2013

As the number of IPs and the communication volume among them have constantly increased, on-chip crossbar network is now the most widely-used on-chip communication backbone of contemporary SoCs. The on-chip crossbar network consists of multiple crossbars and the connections among the IPs and the crossbars. As the complexity of SoCs increases, it has also become more and more complex to determine the topology of the crossbar network. To tackle this problem, this paper proposes an on-chip crossbar network topology method for application-specific systems. The proposed method uses mixed integer linear programming to solve the topology synthesis problem, thus the global optimality is guaranteed. Unlike the previous MILP-based methods which represent the topology with adjacency matrixes of IPs and crossbar switches, the proposed method uses the communication edges among IPs as the basic element of the representation. The experimental results show that the proposed MILP formulation outperforms the previous one by improving the synthesis speed by 77.1 times on average, for 4 realistic benchmarks.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2004.11a
• /
• pp.210-215
• /
• 2004

In can occur to many problems on progressing step without close scope definition, interrelation definition between activities, resource plan, and schedule plan on planning step. But it have not closely defined performance system on planning step because of many constraints of domestic construction industry. Therefore this paper intends to discuss a method of calculating optimal cost and duration using Linear Programming that solves maximing or minimizing problems among decision making methodology and Monte Carlo Simulation that decreases to probability errors. With outcoms applying Linear programming and Monte Carlo Simulation for calculating optimal cost and duration, follow as : With outcomes applying Monte Carlo Simulation, it could calculate reliable estimator about project duration through removing various constraints. With outcomes applying Linear programming, it could calculate optimal value about project cost through defining various variables and constraints on many activities.