An Algebraic Elimination Method for the Linear Complementarity Problem
|
|
- Gwendoline Parrish
- 6 years ago
- Views:
Transcription
1 Volume-3, Issue-5, October-2013 ISSN No: Iteratioal Joural of Egieerig ad Maagemet Research Available at: wwwijemret Page Number: A Algebraic Elimiatio Method for the Liear Complemetarity Problem P Rajedra 1, P Padia 2 1,2 Departmet of Mathematics, School of Advaced Scieces, VIT Uiversity, Vellore-14, Tamiladu, INDIA ABSTRACT A ew method amely, algebraic elimiatio method is proposed for fidig a complemetarity feasible solutio to the liear complemetarity problem which have applicatios i o-liear programmig, ecoomics, game theory ad egieerig The, the algebraic elimiatio method is exteded to quadratic programmig problems The solutio procedure is illustrated by meas of umerical examples Keywords: Liear complemetarity problem, Algebraic elimiatio method, Quadratic programmig problem I INTRODUCTION The liear complemetarity (LC) problem is oe of the most widely studied problems of mathematical programmig sice it arise i a variety of applicatios [3, 4, 6] i egieerig, ecoomics ad applied scieces Several methods [11, 10, 14, 16, 4 ] have bee proposed for solvig LC problems Iterative methods for the solutio of LC problem were cosidered i [2, 12, 7, 9] Morales etal [13] proposed a improvemet of a method described by Kocvara ad Zowe [9] for the solutio of mixed symmetric liear complemetarity problems Yassie [18] discussed a comparative study betwee Lemke s method ad the Iterior poit method for the mootoe liear complemetarity problem Hadjidimos etal[8] proposed the scaled extrapolated block modulus algorithm for solvig the LC problem whose real matrix is a H+-matrix Elfoutayei etal [5] have proposed a mimax algorithm for solvig LC problems liear iequalities ad complemetarity slackess Also, QP problem ca be trasformed ito LC problem usig the of KKT coditios ad the, it ca be solved by Lemke s algorithm Recetly, Quazzafi Rabbai etal [15] applied Fourier s variables elimiatio method to solve QP problem I this paper, we propose a ew method amely, algebraic elimiatio method for fidig a complemetarity feasible solutio to the LC problem I the algebraic elimiatio method, we first reduce the LC problem ito a iequality system by usig the relatio W 0 ad the, the resultig reduced iequality system is solved by matrix / algebraic method The proposed method for solvig LC problem is very simple ad easy to uderstad ad also, to apply Further, we exted the algebraic elimiatio method for solvig quadratic programmig problems with liear costraits after covertig to LC problem Numerical examples are give for better uderstadig the solutio procedures of the proposed method II LINEAR COMPLENTARITY PROBLEM Cosider the followig problem kow as a LC problem to fid colum vectors W R ad Z R satisfyig the system A quadratic programmig (QP) problem is a special case of o- liear programmig problem The two importat methods for solvig QP problem are Wolfe s method [17] ad Beale s method [1] Wolfe [17] used Kuh Tucker coditios to trasform the QP problem ito 51
2 A colum vector ( W, Z) R R satisfyig (21) ad (22) is called a feasible solutio to the LC problem A colum vector ( W, Z) R R satisfyig (21) to (23) is called a complemetarity feasible solutio to the LC problem III ALGEBRAIC ELIMINATION METHOD Now, we propose a ew method amely, algebraic elimiatio method for fidig a complemetarity feasible solutio to the LC problem The proposed method proceeds as follows: Step 1 If M 0 ad q 0, the reduce the give system MZ = q, Z 0 by takig W = 0 ad solve the reduced system by matrix / algebraic method Say Z = Z The, ( W = 0, Z = Z ) is a complemetarity feasible solutio to LC problem Step 2 If there is o egative term i q, the ( W = q, Z = 0) is a complemetarity feasible solutio to LC problem Step 3 If q < 0 for atleast oe term, move o to Step 4 Step 4 Costruct the iequality system MZ q ; Z 0 from the give system usig W 0 Step 5 Elimiate the Z-variables oe by oe upto oly oe of the Z-variable obtaied Say z k Step 6 Fid the greatest lower boud of all maximum possible values of z k Say, z k The values of all possible z j ' s are computed usig backward substitutio method Step 7 If m =, go to Step 9 Otherwise, move o to Step 8 Step 8 (a) Take w j = 0 if z j 0, j = 1,2,, (b) Substitutig the values of w j, j = 1,2,, ad the values of z j, j = 1,2,, i W MZ = q obtaied i 9(a), compute the rest of W ad Z-values Thus, W-value ad Z-value are obtaied Say, W ad Z (c) ( W, Z ) is a complemetarity feasible solutio to the LC problem Step 9 (a) Take w j = 0 if z j 0 (b) Substitutig the values of w j, j = 1,2,, ad the values of z j, j = 1,2,, i W MZ = q obtaied i 9(a), compute the rest of W-values Thus, W-value is obtaied Say, W (c) ( W, Z ) is a complemetarity feasible solutio to the LC problem Now, the proposed method is illustrated with the help of the followig examples Example 31: Cosider the followig LC problem Now, by the Step 1, the complemetarity feasible solutio to the give LC problem is Example 32: Cosider the followig LC problem ad basic algebraic method by makig the ivolved iequality ito equality Say z j = z j, j = 1,2,, 52
3 Now, by the Step 2, the complemetarity feasible solutio to the give LC problem is W = (1,2) ad Z = (0,0) Example 33: Cosider the followig LC problem Now, we proceed to the Step 6 to the Step 9 From the Table-3, we ca coclude that z 2 3 Now, sice z 2 3 correspods to (38) ad sice (3,8) correspods to (34) ad (33), we have z 1 = 0 Now, sice z 2 3, we have w 2 = 0 Now, substitutig the values of z 2 3, w 2 = 0 ad z 1 = 0 i the give system, we have Now, by the Step 3 ad the Step 4, we have the followig iequality system MZ q ; Z 0 The table form of the above problem ca be give as follows: Thus, the complemetarity feasible solutio to the LC problem is W = (15,0,0) ad Z = (0,3,8) IV QUADRATIC PROGRAMMING PROBLEM Now, we proceed to the Step 5 Cosider the followig quadratic programmig (QP) problem: Now, elimiatig followig table z 1 from the Table-1, we obtai the Now, usig KKT coditios, the problem (Q) ca be writte as a liear complemetarity problem as follows: Now, elimiatig z 3 from the Table-2, the followig table has bee obtaied: Result 41: The complemetarity feasible solutio to the (L) problem is the optimal solutio to the (Q) problem Now, the solutio procedure for solvig the quadratic programmig problem by the algebraic proposed method after covertig to LC problem is illustrated by the followig example 53
4 Example 41: Cosider the followig QP problem Now, sice z 3 6 correspods to (41) Now, sice z 3 6, we have w 3 = 0 Now, substitutig the values of z 3 6 ad w 3 = 0 i the give system, we have Now, cosider the followig LC problem which correspods to (Q) problem: Now, the above system ca be writte as the followig table Now, elimiatig z 1 from Table -4, we have the followig table Now, elimiatig z 2 from Table-5, we have From the Table - 6, we ca coclude that z 3 6 Thus, the optimal solutio to the give QP problem is x 1 = 4, x 2 = 0 ad Mi K = 24 V CONCLUSION I this paper, we propose a ew method amely, algebraic elimiatio method for fidig a complemetarity feasible solutio to the liear complemetarity problem The proposed method is easy to uderstad ad apply The, we exted algebraic elimiatio method to quadratic programmig problems With the help of umerical examples, the proposed method is illustrated for better uderstadig of the solutio procedures Sice complemetarity is cetral to all costraied optimizatio problems, the algebraic elimiatio method ca serve decisio makers by providig a appropriate best solutio to a variety of liear programmig complemetarity models i a simple ad effective maer I ear future, we exted the proposed method to fuzzy liear complemetarity problems ad fuzzy quadratic programmig problems REFERENCES [1] Beale, EML, O quadratic programmig, Naval Research Logistic Quart, 6, , 1959 [2] Cryer, CW, The solutio of a quadratic programmig problem usig systematic over-relaxatio, SIAM Joural o Cotrol ad Optimizatio, 9, , 1971 [3] Cottle, RW ad Datzig, GB, Complemetarity pivot theory of mathematical programmig, Liear Algebra ad Its Applicatios, 1, , 1968 [4] Cottle, RW, Jog-Shi Pag ad Richard E Stoe, The liear complemetarity problem, SIAM, Philadelphia, 2009 [5] Elfoutayei, Y ad Khaladi, M, A Mi-Max algorithm for solvig the liear complemetarity problem, Joural of Mathematical Scieces ad Applicatios, 1, 6-11, 2013 [6] Ferris, MC ad Pag, JS, Egieerig ad ecoomic applicatios of complemetarity problems, SIAM REV,39, ,
5 [7] Habetler, GJ ad Price, AL, A iterative method for geeralized complemetarity problems, Joural of Optimizatio Theory ad Applicatios, 11, 36 48, 1973 [8] Hadjidimos, A, Adjidimos, Lapidakisad, M ad Tzoumas, M, O iterative solutio for liear complemetarity problem with a H+-Matrix, SIAM J Matrix Aal Appl, 33, , 2012 [9] Kocvara, M ad Zowe, J, A iterative two-step method for liear complemetarity problems, Numerische Mathematik, 68, , 1994 [10] Kojima, M, Mizuo, S, ad Yoshise, A, A polyomial-time algorithm for a class of liear complemetarity problems, Joural Mathematical Programmig: Series A ad B, 44, 1 26, 1988 [11] Lemke, CE, Bimatrix equilibrium poits ad mathematical programmig, Maagemet Sciece, 11, , 1965 [12] Magasaria, OL, Solutio of symmetric liear complemetarity problems by iterative methods, J Optim Theory Appl, 22, , 1977 [13] Morales, JL, Jorge Nocedaly ad Smelyaskiy, M,A algorithm for the fast solutio of symmetric liear complemetarity problems, Numer Math, 111, ,2008 [14] Murthy, KG, Liear complemetarity, liear ad oliear Programmig, Iteret Editio, 1997 [15] Quazzafi Rabbai, Yusuf Adhami, A ad Abdul Bari, Modified Fourier s method for solvig quadratic programmig problems, Iteratioal Joural of Mathematical Archive, 2, , 2011 [16] Va der Heyde, L, A variable dimesio algorithm for the liear complemetarity problem, Mathematical programmig 19, , 1980 [17] Wolfe, P, The simplex method for quadratic programmig, Ecoometrica, 27, , 1959 [18] Yassie, A, Comparative study betwee Lemke s method ad the Iterior poit method for the mootoe liear complemetarity problem, Studia Uiversity, Babes Bolyai, Mathematica, 53, , Vadaa Publicatios All Rights Reserved 55
M.Jayalakshmi and P. Pandian Department of Mathematics, School of Advanced Sciences, VIT University, Vellore-14, India.
M.Jayalakshmi, P. Padia / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Vol., Issue 4, July-August 0, pp.47-54 A New Method for Fidig a Optimal Fuzzy Solutio For
More information2 The LCP problem and preliminary discussion
Iteratioal Mathematical Forum, Vol. 6, 011, o. 6, 191-196 Polyomial Covergece of a Predictor-Corrector Iterior-Poit Algorithm for LCP Feixiag Che College of Mathematics ad Computer Sciece, Chogqig Three
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationComputation of Error Bounds for P-matrix Linear Complementarity Problems
Mathematical Programmig mauscript No. (will be iserted by the editor) Xiaoju Che Shuhuag Xiag Computatio of Error Bouds for P-matrix Liear Complemetarity Problems Received: date / Accepted: date Abstract
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationSome New Iterative Methods for Solving Nonlinear Equations
World Applied Scieces Joural 0 (6): 870-874, 01 ISSN 1818-495 IDOSI Publicatios, 01 DOI: 10.589/idosi.wasj.01.0.06.830 Some New Iterative Methods for Solvig Noliear Equatios Muhammad Aslam Noor, Khalida
More informationProduct Mix Problem with Radom Return and Preference of Production Quantity. Osaka University Japan
Product Mix Problem with Radom Retur ad Preferece of Productio Quatity Hiroaki Ishii Osaka Uiversity Japa We call such fiace or idustrial assets allocatio problems portfolio selectio problems, ad various
More informationA new error bound for linear complementarity problems for B-matrices
Electroic Joural of Liear Algebra Volume 3 Volume 3: (206) Article 33 206 A ew error boud for liear complemetarity problems for B-matrices Chaoqia Li Yua Uiversity, lichaoqia@yueduc Megtig Ga Shaorog Yag
More informationSolution of Differential Equation from the Transform Technique
Iteratioal Joural of Computatioal Sciece ad Mathematics ISSN 0974-3189 Volume 3, Number 1 (2011), pp 121-125 Iteratioal Research Publicatio House http://wwwirphousecom Solutio of Differetial Equatio from
More informationA collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation
Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 9 Number 1 (017) pp. 45-51 Iteratioal Research Publicatio House http://www.irphouse.com A collocatio method for sigular itegral equatios
More informationA Primal-Dual Interior-Point Filter Method for Nonlinear Semidefinite Programming
The 7th Iteratioal Symposium o Operatios Research ad Its Applicatios (ISORA 8) Lijiag, Chia, October 31 Novemver 3, 28 Copyright 28 ORSC & APORC, pp. 112 118 A Primal-Dual Iterior-Poit Filter Method for
More informationSolvability of Multivalued General Mixed Variational Inequalities
Joural of Mathematical Aalysis ad Applicatios 261, 390 402 2001 doi:10.1006 jmaa.2001.7533, available olie at http: www.idealibrary.com o Solvability of Multivalued Geeral Mixed Variatioal Iequalities
More informationDECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS. Park Road, Islamabad, Pakistan
Mathematical ad Computatioal Applicatios, Vol. 9, No. 3, pp. 30-40, 04 DECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS Muhammad Aslam Noor, Khalida Iayat Noor ad Asif Waheed
More informationSome Variants of Newton's Method with Fifth-Order and Fourth-Order Convergence for Solving Nonlinear Equations
Copyright, Darbose Iteratioal Joural o Applied Mathematics ad Computatio Volume (), pp -6, 9 http//: ijamc.darbose.com Some Variats o Newto's Method with Fith-Order ad Fourth-Order Covergece or Solvig
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationBi-Magic labeling of Interval valued Fuzzy Graph
Advaces i Fuzzy Mathematics. ISSN 0973-533X Volume 1, Number 3 (017), pp. 645-656 Research Idia Publicatios http://www.ripublicatio.com Bi-Magic labelig of Iterval valued Fuzzy Graph K.Ameeal Bibi 1 ad
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationTaylor polynomial solution of difference equation with constant coefficients via time scales calculus
TMSCI 3, o 3, 129-135 (2015) 129 ew Treds i Mathematical Scieces http://wwwtmscicom Taylor polyomial solutio of differece equatio with costat coefficiets via time scales calculus Veysel Fuat Hatipoglu
More informationSYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D
Joural of Pure ad Alied Mathematics: Advaces ad Alicatios olume, Number, 009, Pages 99-07 SYMMERIC POSIIE SEMI-DEFINIE SOLUIONS OF AX B AND XC D School of Mathematics ad Physics Jiagsu Uiversity of Sciece
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationResearch Article Robust Linear Programming with Norm Uncertainty
Joural of Applied Mathematics Article ID 209239 7 pages http://dx.doi.org/0.55/204/209239 Research Article Robust Liear Programmig with Norm Ucertaity Lei Wag ad Hog Luo School of Ecoomic Mathematics Southwester
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationResearch Article An Improved Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems with O nl -Iteration Complexity
Joural of Applied Mathematics Volume 0, Article ID 3409, pages doi:0.55/0/3409 Research Article A Improved Predictor-Corrector Iterior-Poit Algorithm for Liear Complemetarity Problems with O L-Iteratio
More informationIntroduction to Optimization Techniques. How to Solve Equations
Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually
More informationLinear Support Vector Machines
Liear Support Vector Machies David S. Roseberg The Support Vector Machie For a liear support vector machie (SVM), we use the hypothesis space of affie fuctios F = { f(x) = w T x + b w R d, b R } ad evaluate
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS
Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet
More informationwavelet collocation method for solving integro-differential equation.
IOSR Joural of Egieerig (IOSRJEN) ISSN (e): 5-3, ISSN (p): 78-879 Vol. 5, Issue 3 (arch. 5), V3 PP -7 www.iosrje.org wavelet collocatio method for solvig itegro-differetial equatio. Asmaa Abdalelah Abdalrehma
More informationSome Basic Diophantine Equations
Some Basic iophatie Equatios R.Maikada, epartmet of Mathematics, M.I.E.T. Egieerig College, Tiruchirappalli-7. Email: maimaths78@gmail.com bstract- - I this paper we preset a method for solvig the iophatie
More informationOn Summability Factors for N, p n k
Advaces i Dyamical Systems ad Applicatios. ISSN 0973-532 Volume Number 2006, pp. 79 89 c Research Idia Publicatios http://www.ripublicatio.com/adsa.htm O Summability Factors for N, p B.E. Rhoades Departmet
More informationEllipsoid Method for Linear Programming made simple
Ellipsoid Method for Liear Programmig made simple Sajeev Saxea Dept. of Computer Sciece ad Egieerig, Idia Istitute of Techology, Kapur, INDIA-08 06 December 3, 07 Abstract I this paper, ellipsoid method
More informationCommon Coupled Fixed Point of Mappings Satisfying Rational Inequalities in Ordered Complex Valued Generalized Metric Spaces
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn:319-765x Volume 10, Issue 3 Ver II (May-Ju 014), PP 69-77 Commo Coupled Fixed Poit of Mappigs Satisfyig Ratioal Iequalities i Ordered Complex
More informationA NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM
A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM *Kore B. G. Departmet Of Statistics, Balwat College, VITA - 415 311, Dist.: Sagli (M. S.). Idia *Author for Correspodece ABSTRACT I this paper I
More informationPOSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION
THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume, Number /, pp 88 9 POSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION Costi-Cipria POPESCU,
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationStability Analysis of the Euler Discretization for SIR Epidemic Model
Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 21: Primal Barrier Interior Point Algorithm
508J/65J Itroductio to Mathematical Programmig Lecture : Primal Barrier Iterior Poit Algorithm Outlie Barrier Methods Slide The Cetral Path 3 Approximatig the Cetral Path 4 The Primal Barrier Algorithm
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More informationNewton Homotopy Solution for Nonlinear Equations Using Maple14. Abstract
Joural of Sciece ad Techology ISSN 9-860 Vol. No. December 0 Newto Homotopy Solutio for Noliear Equatios Usig Maple Nor Haim Abd. Rahma, Arsmah Ibrahim, Mohd Idris Jayes Faculty of Computer ad Mathematical
More informationPAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu
More informationIN many scientific and engineering applications, one often
INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND APPLIED MATHEMATICS, VOL 3, NO, FEBRUARY 07 5 Secod Degree Refiemet Jacobi Iteratio Method for Solvig System of Liear Equatio Tesfaye Kebede Abstract Several
More informationGenerating Functions for Laguerre Type Polynomials. Group Theoretic method
It. Joural of Math. Aalysis, Vol. 4, 2010, o. 48, 257-266 Geeratig Fuctios for Laguerre Type Polyomials α of Two Variables L ( xy, ) by Usig Group Theoretic method Ajay K. Shula* ad Sriata K. Meher** *Departmet
More informationSome Common Fixed Point Theorems in Cone Rectangular Metric Space under T Kannan and T Reich Contractive Conditions
ISSN(Olie): 319-8753 ISSN (Prit): 347-671 Iteratioal Joural of Iovative Research i Sciece, Egieerig ad Techology (A ISO 397: 7 Certified Orgaizatio) Some Commo Fixed Poit Theorems i Coe Rectagular Metric
More informationModified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations
Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-
More informationOPTIMIZED SOLUTION OF PRESSURE VESSEL DESIGN USING GEOMETRIC PROGRAMMING
OPTIMIZED SOLUTION OF PRESSURE VESSEL DESIGN USING GEOMETRIC PROGRAMMING S.H. NASSERI, Z. ALIZADEH AND F. TALESHIAN ABSTRACT. Geometric programmig is a methodology for solvig algebraic oliear optimizatio
More informationInverse Nodal Problems for Differential Equation on the Half-line
Australia Joural of Basic ad Applied Scieces, 3(4): 4498-4502, 2009 ISSN 1991-8178 Iverse Nodal Problems for Differetial Equatio o the Half-lie 1 2 3 A. Dabbaghia, A. Nematy ad Sh. Akbarpoor 1 Islamic
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More informationOptimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem
Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio
More informationA New Multivariate Markov Chain Model with Applications to Sales Demand Forecasting
Iteratioal Coferece o Idustrial Egieerig ad Systems Maagemet IESM 2007 May 30 - Jue 2 BEIJING - CHINA A New Multivariate Markov Chai Model with Applicatios to Sales Demad Forecastig Wai-Ki CHING a, Li-Mi
More informationON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS * M. JA]IMOVI], I. KRNI] 1.
Yugoslav Joural of Operatios Research 1 (00), Number 1, 49-60 ON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS M. JA]IMOVI], I. KRNI] Departmet of Mathematics
More informationarxiv: v1 [math.oc] 10 Dec 2018 R. Jana a,1, A. K. Das b,2, Vishnu Narayan Mishra c,3
Iterative Descet Method for Geeralized Leotief Model arxiv:181203819v1 [mathoc] 10 Dec 2018 R Jaa a,1, A K Das b,2, Vishu Naraya Mishra c,3 a Jadavpur Uiversity, Kolkata b Idia Statistical Istitute, Kolkata
More informationGeneralization of Contraction Principle on G-Metric Spaces
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 14, Number 9 2018), pp. 1159-1165 Research Idia Publicatios http://www.ripublicatio.com Geeralizatio of Cotractio Priciple o G-Metric
More informationExact Solutions for a Class of Nonlinear Singular Two-Point Boundary Value Problems: The Decomposition Method
Exact Solutios for a Class of Noliear Sigular Two-Poit Boudary Value Problems: The Decompositio Method Abd Elhalim Ebaid Departmet of Mathematics, Faculty of Sciece, Tabuk Uiversity, P O Box 741, Tabuki
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationPreponderantly increasing/decreasing data in regression analysis
Croatia Operatioal Research Review 269 CRORR 7(2016), 269 276 Prepoderatly icreasig/decreasig data i regressio aalysis Darija Marković 1, 1 Departmet of Mathematics, J. J. Strossmayer Uiversity of Osijek,
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationA Further Refinement of Van Der Corput s Inequality
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn:9-75x Volume 0, Issue Ver V (Mar-Apr 04), PP 7- wwwiosrjouralsorg A Further Refiemet of Va Der Corput s Iequality Amusa I S Mogbademu A A Baiyeri
More informationA class of spectral bounds for Max k-cut
A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut
More informationStreamfunction-Vorticity Formulation
Streamfuctio-Vorticity Formulatio A. Salih Departmet of Aerospace Egieerig Idia Istitute of Space Sciece ad Techology, Thiruvaathapuram March 2013 The streamfuctio-vorticity formulatio was amog the first
More informationMulti parameter proximal point algorithms
Multi parameter proximal poit algorithms Ogaeditse A. Boikayo a,b,, Gheorghe Moroşau a a Departmet of Mathematics ad its Applicatios Cetral Europea Uiversity Nador u. 9, H-1051 Budapest, Hugary b Departmet
More informationThe Pivot Adaptive Method for Solving Linear Programming Problems
America Joural of Operatios Research 28 8 92- http://wwwscirporg/oural/aor ISS Olie: 26-8849 ISS Prit: 26-883 he Pivot Adaptive Method for Solvig Liear Programmig Problems Saliha elahcee Philippe Martho
More informationNew Iterative Method for Variational Inclusion and Fixed Point Problems
Proceedigs of the World Cogress o Egieerig 04 Vol II, WCE 04, July - 4, 04, Lodo, U.K. Ne Iterative Method for Variatioal Iclusio ad Fixed Poit Problems Yaoaluck Khogtham Abstract We itroduce a iterative
More informationNotes on iteration and Newton s method. Iteration
Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f
More informationExact Solutions of the Generalized Benjamin Equation and (3 + 1)- Dimensional Gkp Equation by the Extended Tanh Method
Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 7, Issue (Jue 0), pp 75 87 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) Exact Solutios of the Geeralized Bejami Equatio
More informationA Genetic Algorithm for Solving General System of Equations
A Geetic Algorithm for Solvig Geeral System of Equatios Győző Molárka, Edit Miletics Departmet of Mathematics, Szécheyi Istvá Uiversity, Győr, Hugary molarka@sze.hu, miletics@sze.hu Abstract: For solvig
More informationA Study on Fuzzy Complex Linear. Programming Problems
It. J. Cotemp. Math. Scieces, Vol. 7, 212, o. 19, 897-98 A Study o Fuzzy Complex Liear Programmig Problems Youess, E. A. (1) ad Mekawy, I. M. (2) (1) Departmet of Mathematics, Faculty of Sciece Tata Uiversity,
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationInternational Journal of Mathematical Archive-4(9), 2013, 1-5 Available online through ISSN
Iteratioal Joural o Matheatical Archive-4(9), 03, -5 Available olie through www.ija.io ISSN 9 5046 THE CUBIC RATE OF CONVERGENCE OF GENERALIZED EXTRAPOLATED NEWTON RAPHSON METHOD FOR SOLVING NONLINEAR
More informationμ are complex parameters. Other
A New Numerical Itegrator for the Solutio of Iitial Value Problems i Ordiary Differetial Equatios. J. Suday * ad M.R. Odekule Departmet of Mathematical Scieces, Adamawa State Uiversity, Mubi, Nigeria.
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationSimilarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall
Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig
More informationM17 MAT25-21 HOMEWORK 5 SOLUTIONS
M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series
More informationLecture 8: October 20, Applications of SVD: least squares approximation
Mathematical Toolkit Autum 2016 Lecturer: Madhur Tulsiai Lecture 8: October 20, 2016 1 Applicatios of SVD: least squares approximatio We discuss aother applicatio of sigular value decompositio (SVD) of
More informationCSCI567 Machine Learning (Fall 2014)
CSCI567 Machie Learig (Fall 2014) Drs. Sha & Liu {feisha,yaliu.cs}@usc.edu October 9, 2014 Drs. Sha & Liu ({feisha,yaliu.cs}@usc.edu) CSCI567 Machie Learig (Fall 2014) October 9, 2014 1 / 49 Outlie Admiistratio
More informationA comparative study of a system of Lotka-Voltera type of PDEs through perturbation methods
Computatioal Ecology ad Software, 13, 3(4): 11-15 Article A comparative study of a system of Lotka-Voltera type of PDEs through perturbatio methods H. A. Wahab 1, M. Shakil 1, T. Kha 1, S. Bhatti, M. Naeem
More informationInteger Linear Programming
Iteger Liear Programmig Itroductio Iteger L P problem (P) Mi = s. t. a = b i =,, m = i i 0, iteger =,, c Eemple Mi z = 5 s. t. + 0 0, 0, iteger F(P) = feasible domai of P Itroductio Iteger L P problem
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationTeaching Mathematics Concepts via Computer Algebra Systems
Iteratioal Joural of Mathematics ad Statistics Ivetio (IJMSI) E-ISSN: 4767 P-ISSN: - 4759 Volume 4 Issue 7 September. 6 PP-- Teachig Mathematics Cocepts via Computer Algebra Systems Osama Ajami Rashaw,
More informationHigher-order iterative methods by using Householder's method for solving certain nonlinear equations
Math Sci Lett, No, 7- ( 7 Mathematical Sciece Letters A Iteratioal Joural http://dxdoiorg/785/msl/5 Higher-order iterative methods by usig Householder's method for solvig certai oliear equatios Waseem
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationA Parametric Approach to Solve Bounded-Variable LFP by Converting into LP
Iteratioal Joural of Operatios Research Iteratioal Joural of Operatios Research Vol., No., 0707 (06 A Parametric Approach to Solve ouded-variable LFP by Covertig ito LP Saal Chakroborty ad M. abul Hasa
More informationResearch Article Two Expanding Integrable Models of the Geng-Cao Hierarchy
Abstract ad Applied Aalysis Volume 214, Article ID 86935, 7 pages http://d.doi.org/1.1155/214/86935 Research Article Two Epadig Itegrable Models of the Geg-Cao Hierarchy Xiurog Guo, 1 Yufeg Zhag, 2 ad
More informationThe Perturbation Bound for the Perron Vector of a Transition Probability Tensor
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Liear Algebra Appl. ; : 6 Published olie i Wiley IterSciece www.itersciece.wiley.com. DOI:./la The Perturbatio Boud for the Perro Vector of a Trasitio
More informationSome properties of Boubaker polynomials and applications
Some properties of Boubaker polyomials ad applicatios Gradimir V. Milovaović ad Duša Joksimović Citatio: AIP Cof. Proc. 179, 1050 (2012); doi: 10.1063/1.756326 View olie: http://dx.doi.org/10.1063/1.756326
More informationTHE TRANSFORMATION MATRIX OF CHEBYSHEV IV BERNSTEIN POLYNOMIAL BASES
Joural of Mathematical Aalysis ISSN: 17-341, URL: http://iliriascom/ma Volume 7 Issue 4(16, Pages 13-19 THE TRANSFORMATION MATRIX OF CHEBYSHEV IV BERNSTEIN POLYNOMIAL BASES ABEDALLAH RABABAH, AYMAN AL
More informationLecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods
Itroductory lecture otes o Partial Differetial Equatios - c Athoy Peirce. Not to be copied, used, or revised without explicit writte permissio from the copyright ower. 1 Lecture 8: Solvig the Heat, Laplace
More informationSolving a Nonlinear Equation Using a New Two-Step Derivative Free Iterative Methods
Applied ad Computatioal Mathematics 07; 6(6): 38-4 http://www.sciecepublishiggroup.com/j/acm doi: 0.648/j.acm.070606. ISSN: 38-5605 (Prit); ISSN: 38-563 (Olie) Solvig a Noliear Equatio Usig a New Two-Step
More informationk-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction
Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)
More informationSimple Polygons of Maximum Perimeter Contained in a Unit Disk
Discrete Comput Geom (009) 1: 08 15 DOI 10.1007/s005-008-9093-7 Simple Polygos of Maximum Perimeter Cotaied i a Uit Disk Charles Audet Pierre Hase Frédéric Messie Received: 18 September 007 / Revised:
More informationsubject to A 1 x + A 2 y b x j 0, j = 1,,n 1 y j = 0 or 1, j = 1,,n 2
Additioal Brach ad Boud Algorithms 0-1 Mixed-Iteger Liear Programmig The brach ad boud algorithm described i the previous sectios ca be used to solve virtually all optimizatio problems cotaiig iteger variables,
More information-ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION
NEW NEWTON-TYPE METHOD WITH k -ORDER CONVERGENCE FOR FINDING SIMPLE ROOT OF A POLYNOMIAL EQUATION R. Thukral Padé Research Cetre, 39 Deaswood Hill, Leeds West Yorkshire, LS7 JS, ENGLAND ABSTRACT The objective
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More information1 6 = 1 6 = + Factorials and Euler s Gamma function
Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio
More informationON POINTWISE BINOMIAL APPROXIMATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece
More information