• Structural Engineering and Mechanics
• /
• v.10 no.2
• /
• pp.181-195
• /
• 2000

A two-step procedure for the application of non linear constrained programming to the limit analysis of rigid brick-block systems with no-tension and frictional interface is implemented and applied to various masonry structures. In the first step, a linear problem of programming, obtained by applying the upper bound theorem of limit analysis to systems of blocks interacting through no-tension and dilatant interfaces, is solved. The solution of this linear program is then employed as initial guess for a non linear and non convex problem of programming, obtained applying both the 'mechanism' and the 'equilibrium' approaches to the same block system with no-tension and frictional interfaces. The optimiser used is based on the sequential quadratic programming. The gradients of the constraints required are provided directly in symbolic form. In this way the program easily converges to the optimal solution even for systems with many degrees of freedom. Various numerical analyses showed that the procedure allows a reliable investigation of the ultimate behaviour of jointed structures, such as stone masonry structures, under statical load conditions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.20
• /
• pp.97-104
• /
• 1989

In this thesis, each objective functions with hierarchical system Bi-level linear programming (BLPP) Problem applications to fuzzy set theory conducted multiple objective programming problem. Using linear fuzzy membership functions make a change typical BLPP and presents modified method turn to account established BLPP method, presents operation results lead to example. Fuzzy Bi-level linear programming problem (FBLPP) can be natural describe realities of life then BLPP.

• 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 the Korean Society for Railway
• /
• v.8 no.5
• /
• pp.391-397
• /
• 2005

In this paper we present a model for the maintenance routing construction and the trainset allocation (maintenance routing problem). The model solves the maintenance routing problem using column generation algorithm which was used to combine constraint programming and linear programming. Ilog-cplex was used to solve the linear programming model and Ilog-solver was used to solve the constraint programming model. The computational experience is also provided.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.287-296
• /
• 1995

Wets ([4],[5],[6]) considered single objective linear two-stage programming problem under uncertainty with complete recourse. Artstein, Dupacova, Romisch, Schultz and Wets studied stability of this problem id depth. But in many real world problems to make best decision, we need multiple objective functions. So we consider the following multiple objective two-stage programming problems with complete fixed recourse.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.113-125
• /
• 2006

Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

• Journal of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.259-268
• /
• 1998

In this paper the stochastic multiple objective programming problems where the right-hand-side of the constraints is stochastic are considered. We define the equivalent scalar-valued problem and study the stability of the equivalent scalar-valued problem with respect to the weight parameters and probability mesures under reasonable assumptions.

• Structural Engineering and Mechanics
• /
• v.26 no.1
• /
• pp.15-30
• /
• 2007

In the paper, one focuses on the problem of duality in non-linear programming, applied to the solution of no-tension problems by means of Limit Analysis (LA) theorems for Not Resisting Tension (NRT) models. In details, one demonstrates that, starting from the application of the duality theory to the non-linear program defined by the static theorem approach for a discrete NRT model, this procedure results in the definition of a dual problem that has a significant physical meaning: the formulation of the kinematic theorem.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.597-610
• /
• 2010

For a class of nonlinear bilevel programming problems in which the follower's problem is linear, the paper develops a genetic algorithm based on the optimality conditions of linear programming. At first, we denote an individual by selecting a base of the follower's linear programming, and use the optimality conditions given in the simplex method to denote the follower's solution functions. Then, the follower's problem and variables are replaced by these optimality conditions and the solution functions, which makes the original bilevel programming become a single-level one only including the leader's variables. At last, the single-level problem is solved by using some classical optimization techniques, and its objective value is regarded as the fitness of the individual. The numerical results illustrate that the proposed algorithm is efficient and stable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.