• 한국경영과학회지
• /
• 제7권1호
• /
• pp.45-50
• /
• 1982

The present paper provides a method for solving a complementary programming problem with quadratic objective function subject to linear constraints. The procedure developed is based on the simplex method for quadratic programming problem. An example is added to illustrate the procedure.

• 한국전자파학회:학술대회논문집
• /
• 한국전자파학회 2005년도 종합학술발표회 논문집 Vol.15 No.1
• /
• pp.57-62
• /
• 2005

In spite of many advantages of OFDM, a major drawback for implementation is a non-linear distortion in the HPA due to a high PAPR problem. In this paper, the Complementary Clipping Transform technique (CCT) for the PAPR reduction of OFDM system is analyzed for the QPSK and QAM mapping data. BER performance and PSD in front of HPA and after HPA are analytically demonstrated.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.51-58
• /
• 1998

In this paper a bimatrix game with imprecise values in its matrix of payoffs is considered. We propose a method for its solution based on the establishment of a linear complementary problems for two players. To solve the problems we use the auxiliary models resulting from the methods for ranking fuzzy numbers.

• 호남수학학술지
• /
• 제19권1호
• /
• pp.157-164
• /
• 1997

We are concerned with three classes of matrices that are relevant to the linear complementary problem. We prove that within the class of $P_0$-matrices, the Q-matrices are precisely the regular matrices and we show that the same characterizations hold for an L-matrix as well, and that the symmetric copositive-plus Q-matrices are precisely those which are strictly copositive.

• Structural Engineering and Mechanics
• /
• 제12권1호
• /
• pp.35-50
• /
• 2001

A numerical methodology is presented in this paper for the geometrically non-linear analysis of slender uni-dimensional structural elements under unilateral contact constraints. The finite element method together with an updated Lagrangian formulation is used to study the structural system. The unilateral constraints are imposed by tensionless supports or foundations. At each load step, in order to obtain the contact regions, the equilibrium equations are linearized and the contact problem is treated directly as a minimisation problem with inequality constraints, resulting in a linear complementarity problem (LCP). After the resulting LCP is solved by Lemke's pivoting algorithm, the contact regions are identified and the Newton-Raphson method is used together with path following methods to obtain the new contact forces and equilibrium configurations. The proposed methodology is illustrated by two examples and the results are compared with numerical and experimental results found in literature.

• 대한기계학회논문집
• /
• 제18권8호
• /
• pp.2026-2038
• /
• 1994

A numerical scheme is developed for the analysis of incipient sliding contact with orthotropic friction condition subjected to tangential load and twisting moment. The inherent nonlinearity in the orthotropic friction law has been treated by a polyhedral friction law. Then, a three-dimensional linear complementarity problem(LCP) formulation in an incremental form is obtained, and the existence of a solution is investigated. A Lemke's complementary pivoting algorithm is used for solving the LCP. The scheme is illustrated by spherical contact problems, and the effects of eccentricity of elliptical friction domain on the traction and stick region are discussed.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.85-97
• /
• 2003

An indefinite stochastic linear-quadratic(LQ) optimal control problem with cross term over an infinite time horizon is studied, allowing the weighting matrices to be indefinite. A systematic approach to the problem based on semidefinite programming (SDP) and .elated duality analysis is developed. Several implication relations among the SDP complementary duality, the existence of the solution to the generalized Riccati equation and the optimality of LQ problem are discussed. Based on these relations, a numerical procedure that provides a thorough treatment of the LQ problem via primal-dual SDP is given: it identifies a stabilizing optimal feedback control or determines the problem has no optimal solution. An example is provided to illustrate the results obtained.

• Steel and Composite Structures
• /
• 제20권5호
• /
• pp.1043-1066
• /
• 2016

A new analytical solution based on a third order shear deformation theory for the problem of static analysis of cross-ply doubly-curved shells is presented. The boundary-discontinuous generalized double Fourier series method is used to solve highly coupled linear partial differential equations with the mixed type simply supported boundary conditions prescribed on the edges. The complementary boundary constraints are introduced through boundary discontinuities generated by the selected boundary conditions for the derivation of the complementary solution. The numerical accuracy of the solution is compared by studying the comparisons of deflections, stresses and moments of symmetric and anti-symmetric laminated shells with finite element results using commercially available software under uniformly distributed load. Results are in good agreement with finite element counterparts. Additional results of the symmetric and anti-symmetric laminated and sandwich shells under single point load at the center and pressure load, are presented to provide data for the unsolved boundary conditions, benchmark comparisons and verifications.

• 산업경영시스템학회지
• /
• 제28권1호
• /
• pp.114-120
• /
• 2005

This paper studies procedures for bottleneck detection in closed queueing networks(CQN's) with multiple job classes. Bottlenecks refer to servers operating at $100\%$ utilization. For CQN's, this can occur as the population sizes approach infinity. Bottleneck detection reduces to a non-linear complementary problem which in important special cases may be interpreted as a Kuhn-Tucker set. Efficient computational procedures are provided.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.