• Title/Summary/Keyword: Linear Programming Model

Search Result 449, Processing Time 0.024 seconds

Primal-Dual Neural Network for Linear Programming (선형계획을 위한 쌍대신경망)

  • 최혁준;장수영
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.1
    • /
    • pp.3-16
    • /
    • 1992
  • We present a modified Tank and Hopfield's neural network model for solving Linear Programming problems. We have found the fact that the Tank and Hopfield's neural circuit for solving Linear Programming problems has some difficulties in guaranteeing convergence, and obtaining both the primal and dual optimum solutions from the output of the circuit. We have identified the exact conditions in which the circuit stops at an interior point of the feasible region, and therefore fails to converge. Also, proper scaling of the problem parameters is required, in order to obtain a feasible solution from the circuit. Even after one was successful in getting a primal optimum solution, the output of the circuit must be processed further to obtain a dual optimum solution. The modified model being proposed in the paper is designed to overcome such difficulties. We describe the modified model and summarize our computational experiment.

  • PDF

Three Mathematical Programming thhniques for Solving Transshipment Problems:a Wilcoxon Test

  • Kwak, N.K.;Hemaida, Ramadan S.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.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.

  • PDF

Support Vector Machine for Interval Regression

  • Hong Dug Hun;Hwang Changha
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2004.11a
    • /
    • pp.67-72
    • /
    • 2004
  • Support vector machine (SVM) has been very successful in pattern recognition and function estimation problems for crisp data. This paper proposes a new method to evaluate interval linear and nonlinear regression models combining the possibility and necessity estimation formulation with the principle of SVM. For data sets with crisp inputs and interval outputs, the possibility and necessity models have been recently utilized, which are based on quadratic programming approach giving more diverse spread coefficients than a linear programming one. SVM also uses quadratic programming approach whose another advantage in interval regression analysis is to be able to integrate both the property of central tendency in least squares and the possibilistic property In fuzzy regression. However this is not a computationally expensive way. SVM allows us to perform interval nonlinear regression analysis by constructing an interval linear regression function in a high dimensional feature space. In particular, SVM is a very attractive approach to model nonlinear interval data. The proposed algorithm here is model-free method in the sense that we do not have to assume the underlying model function for interval nonlinear regression model with crisp inputs and interval output. Experimental results are then presented which indicate the performance of this algorithm.

  • PDF

A Comparison of the Discrimination of Business Failure Prediction Models (부실기업예측모형의 판별력 비교)

  • 최태성;김형기;김성호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.2
    • /
    • pp.1-13
    • /
    • 2002
  • In this paper, we compares the business failure prediction accuracy among Linear Programming Discriminant Analysis(LPDA) model, Multivariate Discriminant Analysis (MDA) model and logit analysis model. The Data for 417 companies analyzed were gathered from KIS-FAS Published by Korea Information Service in 1999. The result of comparison for four time horizons shows that LPDA Is advantageous in prediction accuracy over the other two models when over all tilt ratio and business failure accuracy are considered simultaneously.

A CANONICAL REPRESENTATION FOR THE SOLUTION OF FUZZY LINEAR SYSTEM AND FUZZY LINEAR PROGRAMMING PROBLEM

  • NEHI HASSAN MISHMAST;MALEKI HAMID REZA;MASHINCHI MASHAALAH
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.345-354
    • /
    • 2006
  • In this paper first, we find a canonical symmetrical trapezoidal(triangular) for the solution of the fuzzy linear system $A\tilde{x}=\tilde{b}$, where the elements in A and $\tilde{b}$ are crisp and arbitrary fuzzy numbers, respectively. Then, a model for fuzzy linear programming problem with fuzzy variables (FLPFV), in which, the right hand side of constraints are arbitrary numbers, and coefficients of the objective function and constraint matrix are regarded as crisp numbers, is discussed. A numerical procedure for calculating a canonical symmetrical trapezoidal representation for the solution of fuzzy linear system and the optimal solution of FLPFV, (if there exist) is proposed. Several examples illustrate these ideas.

Nonlinear modeling of shear strength of SFRC beams using linear genetic programming

  • Gandomi, A.H.;Alavi, A.H.;Yun, G.J.
    • Structural Engineering and Mechanics
    • /
    • v.38 no.1
    • /
    • pp.1-25
    • /
    • 2011
  • A new nonlinear model was developed to evaluate the shear resistance of steel fiber-reinforced concrete beams (SFRCB) using linear genetic programming (LGP). The proposed model relates the shear strength to the geometrical and mechanical properties of SFRCB. The best model was selected after developing and controlling several models with different combinations of the influencing parameters. The models were developed using a comprehensive database containing 213 test results of SFRC beams without stirrups obtained through an extensive literature review. The database includes experimental results for normal and high-strength concrete beams. To verify the applicability of the proposed model, it was employed to estimate the shear strength of a part of test results that were not included in the modeling process. The external validation of the model was further verified using several statistical criteria recommended by researchers. The contributions of the parameters affecting the shear strength were evaluated through a sensitivity analysis. The results indicate that the LGP model gives precise estimates of the shear strength of SFRCB. The prediction performance of the model is significantly better than several solutions found in the literature. The LGP-based design equation is remarkably straightforward and useful for pre-design applications.

Optimizing delivery routing problem for logistics companies based on Integer Linear Programming method

  • Cao, Ngoc-Anh;Phan, Thanh-Hang;Chinh, Nguyen Thi;Tran, Duc-Quynh;Nguyen, Ha-Nam;Trang, Ngo-Thi-Thu;Choi, Gyoo-Seok
    • 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.

R&D Investment Model for the Information and Telecommunications Technology by Multiple Objective Linear Programming (다목적선형계획법을 이용한 한국 정보통신 기술분야별 R&D 투자규모결정 모형개발 및 사례연구)

  • 이동엽
    • Korean Management Science Review
    • /
    • v.16 no.1
    • /
    • pp.63-74
    • /
    • 1999
  • This paper presents a R&D investment model for the Information and telecommunications(l&T) technology using multiple objective linear programming(MOLP). The MOLP model involves the simultaneous maximization of three linear objective functions associated with three criteria, which are social, technological, and economic criterion. This model is different from the traditional one which only involves the maximization of economic criterion. It yields a suitable R&D investment ratio to each technology field. Its application to the National R&D Project in l&t Industry is also presented. In this application, the Analytic Hierarchy Process(AHP) is proposed to estimate the weights, which used as the coefficients in each objective function of the MOLP model. Then the problem is solved using the interactive method STEM. It is showed that with the aid of STEM, the MOLP model can be useful decision aid in formulation R&D investment plan in l&t industry. It is expected that the MOLP model works as the basis for planning R&D investment strategy in l&T industry.

  • PDF

An incremental convex programming model of the elastic frictional contact problems

  • Mohamed, S.A.;Helal, M.M.;Mahmoud, F.F.
    • Structural Engineering and Mechanics
    • /
    • v.23 no.4
    • /
    • pp.431-447
    • /
    • 2006
  • A new incremental finite element model is developed to simulate the frictional contact of elastic bodies. The incremental convex programming method is exploited, in the framework of finite element approach, to recast the variational inequality principle of contact problem in a discretized form. The non-classical friction model of Oden and Pires is adopted, however, the friction effect is represented by an equivalent non-linear stiffness rather than additional constraints. Different parametric studies are worked out to address the versatility of the proposed model.

Design of Mixed Integer Linear Programming Model for Transportation Planning (혼합 정수 선형 계획법을 이용한 수송 계획 모델 설계)

  • Park, Yong Kuk;Lee, Min Goo;Jung, Kyung Kwon;Won, Young-Jin
    • 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.