Solution of Elastic contact problems
by
Silvanus Owuoth Magundho
Northeastern University.Box227,Shenyang 110006,P.R.China
Coauthors: Nie Yi Yong (No.2 Lab, Shenyang Institute of Automation, Academia Sinica,No.114 Nanta Avenue, Shenyang, 110016, P.R.China), Li Chang Jun (Department of mathematics, Northeastern University, Shenyang 110006, P.R.China)

Keywords: Quasi-simplex method; Quadratic programming; Polyhedron Abstract. In this paper we describe a new method of directly searching the optimum objective point for a strictly convex quadratic programming while no Kuhn-Tucker condition is applied. During the searching procedure the objective point is moved along a broken line on the boundary of the constraint polyhedron. This idea of moving the objective point may be considered a natural generalization of the Simplex method for linear programming where the objective point is moved from one vertex to another.

We also present an algorithm for the solution, which can be modeled to provide solutions for elastic contact problems like those that arise in gears. Some interesting examples illustrate the efficiency of the algorithm.

References 1.R. Fletcher. A general quadratic programming algorithm, J.Inst Math. Appl., Vol. 7 (1971), 76~91 2.D. Goldfard and A. Idnani, a numerically stable dual method for solving strictly convex quadratic programs. [j]Math. Programming, Vol.27 (1983), 1~33 3.E.Hang and J.S.Arora. Applied optimal design: Mechanical and structural systems [M] Johu Wiley and Sons. 1979 4.R.Hartley.Linear and nonlinear programming: an introduction to linear methods in mathematical programming. [M] Ellis horwood Ltd.,1985 5.Y.Y.Nie and S.R.Xu,Determination and correction of an inconsistent system of linear inequalities,[J].Comp.Math.,Vol.13(1995),211~217 7.Y.Ye and E.Tse. An extension of karmarkar¢s projective algorithm for convex quadratic programming.[J]Math.programming,Vol.44(1989),157~179

Date received: January 11, 2002

Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cago-23.