OPTIMALITY CONDITIONS FOR NONLINEAR PROGRAMMING WITH MIXED CONSTRAINTS AND ρ -LOCALLY ARCWISE CONNECTED FUNCTIONS
|
|
- Jordan Parker
- 5 years ago
- Views:
Transcription
1 HE PUBLSHNG HOUSE PROCEEDNGS OF HE ROMANAN ACADEMY, Seres A, OF HE ROMANAN ACADEMY Volume 7, Number /6, pp - OPMALY CONDONS FOR NONLNEAR PROGRAMMNG WH MXED CONSRANS AND ρ -LOCALLY ARCWSE CONNECED FUNCONS oan M SANCU-MNASAN, Andreea Mădălna SANCU he Romanan Academy, nsttute of Mathematcal Statstcs and Appled Mathematcs, Calea Septembre nr, Ro-57, Bucharest 5, Romana, E-mal: stancum@csmro A nonlnear prorammn problem wth mxed constrants s consdered, where the functons nvolved are ρ -locally arcwse connected, ρ -locally Q-connected, ρ -locally P-connected and locally PQ-connected (a noton ntroduced n ths paper and dfferentable wth respect to an arc Suffcent optmalty condtons are obtaned n terms of the rht dfferentals wth respect to an arc of the functons Our results eneralze to the case of mxed constrants the results obtaned by Stancu-Mnasan [] and Stancu-Mnasan and Andreea Mădălna Stancu [] PRELMNARES n ths secton we ntroduce the notaton and defntons whch are used throuhout the paper Let R n be the n-dmensonal Eucldean space and R n ts nonneatve orthant { x R n, x j, ј =,, n} hrouhout the paper the follown conventons for vectors n R n wll be followed: x > y f and only f x > y, =,, n, x y f and only f x y, =,, n, x y f and only f x y, =,, n, but x y secton Let Also, all defntons and theorems are numbered consecutvely n a snle numeraton system n each X R n be a nonempty and compact subset of R n Defnton Let x, x X A contnuous mappn H ( = x, H ( x x, x = H, : [,] R n wth s called an arc from x to x Defnton ([] We say that the set X R n s a locally arcwse connected set at x ( x X ( X s LAC( x, for short f for any x X there exst a postve number a ( x, x, wth < a ( x, x, and a contnuous arc H, ( λ X for any λ (, a ( x, x H We say that the set X s locally arcwse connected f X s locally arcwse connected at any x X f we choose the functon H of the form H (λ = ( λ x λ x, we retreve the defnton of locally starshaped set as ven by Ewn [] Recommended by Marus OSFESCU, member of the Romanan Academy
2 oan M SANCU-MNASAN, Andreea Mădălna SANCU Defnton ([7] Let f : X R be a functon, where X R n s a locally arcwse connected set at x X wth the correspondn functon H (λ and a maxmum postve number a ( x, x satsfyn the requred condtons (from Defnton Also, let ρ R and d(, : X X R d ( x, x for x x We say that f s: ( ρ -locally arcwse connected at x ( f s ρ - LCN( x, for short f for any x X there exst a postve number d ( x, x a ( x, x and an arc H n X on [, d( x, x ] f (, ( λ λf ( x ( λ f ( x ρλ d( x, x, λ d( x, x ( H ( ρ -locally Q-connected at x ( ρ - LQCN(x f for any x X there exst a postve number d ( x, x a ( x, x and an arc H n X on [, d( x, x ] f ( x f ( x f ( H λ d( x,x, ( λ f ( x ρλd( x, x x X there exst a postve number ( ρ -locally P-connected at x ( ρ - LPCN( x f for any d ( x, x a ( x, x, an arc H n X on [, d(x, x ], and a postve number γ x, x f ( x < f ( x f ( H λ d( x,x x, x ( λ f ( x λγ x, x ρλd( x, x ( ρ -locally strctly P-connected at x ( ρ - LSPCN( x f for any x X there exst a postve number d ( x, x a ( x, x, an arc H n X on [, d(x, x ], and a postve number γ x, x x x, f ( x < f ( x λ d( x,x f ( H, ( λ < f ( x λγ, ρλd( x, x he functon f s sad to be ρ -locally strctly arcwse connected at x X ( ρ - LSCN( x f for each x X, x x, nequalty ( s strct f f s ρ - LCN( x ( ρ - LSCN( x at each x X, then f s sad to be ρ - LCN (ρ - LSCN on X f f s ρ - LQCN at each x X, then f s sad to be ρ - LQCN on X f f s ρ - LPCN at each x X, then f s sad to be ρ - LPCN on X Defnton Let f : X R be a functon, where X R n s a locally arcwse connected set at x X wth the correspondn functon H (λ and a maxmum postve number a ( x, x satsfyn the requred condtons (from Defnton We say that f s locally PQ-connected at x ( LPQCN( x f for any x X there exst a postve number d( x, x a ( x, x and an arc H n X on [, d( x, x ] f( x = f( x f( Hxx, ( λ f( x < λ < d( x,x Defnton 5 ([] Let f : X R be a functon, where X R n s a locally arcwse connected set at x X, wth the correspondn functon (λ and a maxmum postve number H
3 Optmalty condtons for nonlnear prorammn a ( x, x satsfyn the requred condtons he rht dfferental of f at x wth respect to the arc ( s defned as provded the lmt exsts f f s dfferentable at any x H λ (df (x, H ( = lm [ f ( H ( λ f ( x ] ( λ λ X, then f s sad to be dfferentable on X SUFFCEN OPMALY CRERA Consder the nonlnear prorammn problem Mnmze f( x (P subject to (, ( =, x h X, where X R n s a nonempty open locally arcwse connected set; f : X R; = ( m : X R m ; = ( h j j k : X R k ; v the rht dfferentals of f,, =,!, m, and hj, j =,, k at x exst wth respect to the same arc H ( λ Let X = { x X (x, hx ( = } be the set of all feasble solutons to (P Let N ε (x = { x R n x x < ε } Defnton a x s sad to be a local mnmum soluton to problem (P f x X and there exsts ε > x N ε ( x X f ( x f (x b x s sad to be the mnmum soluton to problem (P f x X and f ( x = mn f ( x For x X we denote by = ( x = { ( x = } the set of ndces of actve constrants at x, by J = J ( x = { ( x < } the set of ndces of nonactve constrants at x, and set = ( Obvously, J = {,,, m} Let u R m be u and u ( x = Obvously, u and u J =, where u and u J denotes the subvectors of u correspondn to the ndex sets and J, respectvely Let = { : u > } and L = { : u = }; L = Let and L be the subvectors of correspondn to the ndex sets and L, respectvely n ths secton we ve suffcent optmalty theorems for problem (P Frst, we ve a suffcent optmalty theorem of the uhn-ucker type he functons f, and h are not dfferentable but are drectonal dfferentable wth respect to the same arc H x, x ( λ at λ = Let,, } be a partton of the ndex set ; thus for each =,,, = Ø { for each rs {,,}, wth r s, and " = = he next result does not requre the functon h to be drectonally dfferentable x X r s
4 oan M SANCU-MNASAN, Andreea Mădălna SANCU heorem Let x X R n, where X s a locally arcwse connected set and let u R m Assume that there exst the rht dfferentals at x wth respect to the same arc H, of f and and ( x, u satsfes the condtons below: Assume furthermore that (d f ( x, H ( u (d ( x, H (, x X, ( x,x x,x u ( x =, ( (x, h( x = ( u, u (,, s α - LQCN( x, (5 u s β - LQCN( x (6 f u s γ - LPCN( x (7 αu β γ hen x s a mnmum soluton to Problem (P he follown result s a specal case of heorem, where the condtons are specal cases of (5 throuh (8 heorem Let x X R n, where X s a locally arcwse connected set and let u R m Assume that there exst the rht dfferentals at x, wth respect to the same arc H, of f and and ( x, u satsfes condtons ( - ( Assume furthermore that any one of the hypotheses below s satsfed f u s γ - LPCN( x, where γ ; a,, s α - LQCN( x, b f s γ - LPCN( x, c α u γ ; a u s β - LQCN( x, b f s γ - LPCN( x, c β γ ; a u s β - LQCN( x, b f u s γ - (,, s a partton of, c β γ ; 5 a,, s α - LQCN( x, b f u s γ - LPCN( x, where {, } s a partton of, c α u γ ;,, s α - LQCN( x, 6 a LPCN x where { } (8
5 5 Optmalty condtons for nonlnear prorammn b u s β - LQCN( x, c f s γ - LPCN( x, d αu β γ, where {, } s a partton of hen x s a mnmum soluton to problem (P Let v R k and defne P= { v > } and Q= { v < } Let { P, P, P } and { Q, Q, Q } be parttons of the sets P and Q, respectvely Let h P and h Q (=,, be the subvectors of h correspondn to the ndex sets P and Q ( =,,, respectvely Let vp and v ( = Q,, be the subvectors of v correspondn to the ndex sets P and Q ( =,,, respectvely he next result does not requre the functon to be drectonally dfferentable heorem Let x X R n, where X s a locally arcwse connected set and let v R k Assume that there exst the rht dfferentals at x wth respect to the same arc H, of f and h and ( xv, satsfes the condton (d f ( x, Hxx, ( v (d h ( x, H xx, (, x X Assume furthermore that h P, s LPQCN( x,, h, Q, s LPQCN( x, s LPQCN ( x P P Q Q f s τ - LPCN( x, ( τ P P Q Q hen x s a mnmum soluton to Problem (P u R Let { } m Let L= u > Let {,,, }, {,,, } and {,,, } k v R and defne = { > } P v and = { <} Q v Let L L L L P P P P Q Q Q Q be parttons of the sets LP, and Q, respectvely he follown result s a combnaton of heorems and horem 5 Let x X R n, where X s a locally arcwse connected set and let u R m and k v R Assume that there exst the rht dfferentals at x, wth respect to the same arc H, of f, and h and ( xuv,, satsfes the condtons below: (d f ( x, H ( u (d ( x, H ( v (d h ( x, H (, x X, xx, Assume furthermore that u ( x =, ( x (, hx =, u, u
6 oan M SANCU-MNASAN, Andreea Mădălna SANCU 6, L, h, P h, Q, s α - LQCN( x,, s LPQCN( x,, s LPQCN( x, 5 u s β - LQCN( x, L L s LPQCN ( x P P Q Q 6 u L L s δ - LQCN ( x P P Q Q 7 f u L L s τ - LPCN ( x P P Q Q 8 αu β δ τ L hen x s a mnmum soluton to Problem (P n what follows we consder suffcent optmalty condtons of the Frtz John type Let ( xv,, vw, be a Frtz John pont, where x X (a locally arcwse connected set, v R, v R m and w R k Assume that ( xv,, vw, satsfes the condtons v (d f ( x,h ( v (d ( x,h ( w (d h ( x,h (, x X, (9 x,,,x f v = then condtons (9 ( become v ( x =, ( ( v, v, ( v, v, w ( v(d ( xh, ( w(d h ( xh, (, x X, ( xx, v ( x =, ( v, ( vw, ( Let and J be the sets defned at the bennn of ths secton By ( we have v and v J = Let L= { : v > } Let L be the subvector of correspondn to the ndex set L Also, let v L be the subvector of v correspondn to the ndex set L Let k U = w > and V = w < Let h and h w R Defne the ndex sets U and V by { } { } be the subvectors of h correspondn to the ndex sets U and V, respectvely Also, let w U and w V be the vector of w correspondn to the ndex sets U and V, respectvely heorem 6 Let x X R n, where X s a locally arcwse connected set Assume that there exst the rht dfferentals at x wth respect to the same arc H of f, and h Let ( xv,, vw, be a Frtz John pont whch satsfy condtons (9-( f v >, let the assumptons of heorem 5 hold wth u = v v, v = v w U V
7 7 Optmalty condtons for nonlnear prorammn f v =, let ( x,, v, w satsfy (-( and assume that the condtons below hold: a, L,, s α - LQCN(x, b h, U, s LPQCN( x, c h, V, s LPQCN( x, d vl L s β - LQCN( x, e vu h U w V h V s LPQCN ( x f vl L w U h U w V h V s δ - LQCN ( x, αv β δ L hen x s a lobal mnmum soluton to Problem (P he proofs wll appear n [] REFERENCES AVREL, M, ZANG,, Generalzed arcwse-connected functons and characterzatons of local-lobal mnmum propertes J Optm heory Appl,,, pp 7-5, 98 EWNG, G M, Suffcent condtons for lobal mnma of sutably convex functons from varatonal and control theory SAM Rev, 9,, pp, -, 977 AUL, R N, LYALL, V, Locally connected functons and optmalty ndan J Pure Appl Math,, pp 99-8, 99 AUL, R N, LYALL, VNOD, AUR, SURJEE, Locally connected set and functons J Math Anal Appl, pp -5, LYALL, V, SUNEJA, S, AGGARWAL, S, Frtz John optmalty and dualty for non-convex prorams J MathAnalAppl,, pp 8-5, OREGA, J M, RHENBOLD, W C, teratve Soluton of Nonlnear Equatons n Several Varables Academc Press, New York, NY 97 7 PREDA, V, NCULESCU, CRSAN, On dualty mnmax problems nvolvn ρ -locally arcwse connected and related functons Analele Unverstăţ Bucureşt, Matematca, 9,, pp85-95, 8 SANCU-MNASAN, M, Fractonal Prorammn heory, Methods and Applcatons luwer Academc Publshers, Dordrecht, SANCU-MNASAN, M, Dualty for nonlnear fractonal prorammn nvolvn eneralzed locally arcwse connected functons Rev Roumane MathPures Appl, 9,, pp87-98, SANCU-MNASAN, M, Optmalty condtons for nonlnear prorammn wth eneralzed locally arcwse connected functons Proc Ro Acad, Seres A, 5, pp-7, SANCU-MNASAN, M, SANCU, Andreea-Mădălna, Suffcent optmalty condtons for nonlnear prorammn wth ρ -locally arcwse connected and related functons Submtted SANCU-MNASAN, M, SANCU, Andreea-Mădălna, Suffcent optmalty condtons for nonlnear prorammn wth mxed constrants and eneralzed ρ -locally arcwse connected functons Submtted Receved January 6, 6
Multiple Objective Programming Involving Differentiable (H p, r)-invex Functions
CUBO A Mathematcal Journal Vol.13, N ō 01, (125 136). March 2011 Multple Objectve Programmng Involvng Dfferentable (H p, r)-nvex Functons Xaolng Lu, Dehu Yuan, Shengyun Yang, Guomng La Department of Mathematcs
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationFIRST AND SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR DISCRETE OPTIMAL CONTROL PROBLEMS
Yugoslav Journal of Operatons Research 6 (6), umber, 53-6 FIRST D SECOD ORDER ECESSRY OPTIMLITY CODITIOS FOR DISCRETE OPTIML COTROL PROBLEMS Boban MRIKOVIĆ Faculty of Mnng and Geology, Unversty of Belgrade
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationConvex Optimization. Optimality conditions. (EE227BT: UC Berkeley) Lecture 9 (Optimality; Conic duality) 9/25/14. Laurent El Ghaoui.
Convex Optmzaton (EE227BT: UC Berkeley) Lecture 9 (Optmalty; Conc dualty) 9/25/14 Laurent El Ghaou Organsatonal Mdterm: 10/7/14 (1.5 hours, n class, double-sded cheat sheet allowed) Project: Intal proposal
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationExistence results for a fourth order multipoint boundary value problem at resonance
Avalable onlne at www.scencedrect.com ScenceDrect Journal of the Ngeran Mathematcal Socety xx (xxxx) xxx xxx www.elsever.com/locate/jnnms Exstence results for a fourth order multpont boundary value problem
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationSystem of implicit nonconvex variationl inequality problems: A projection method approach
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 6 (203), 70 80 Research Artcle System of mplct nonconvex varatonl nequalty problems: A projecton method approach K.R. Kazm a,, N. Ahmad b, S.H. Rzv
More informationResearch Article Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem
Mathematcal Problems n Engneerng Volume 2012, Artcle ID 871741, 16 pages do:10.1155/2012/871741 Research Artcle Global Suffcent Optmalty Condtons for a Specal Cubc Mnmzaton Problem Xaome Zhang, 1 Yanjun
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LIX, 013, f.1 DOI: 10.478/v10157-01-00-y ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION BY ION
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationA Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function
A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no.
Ttle Sharp ntegral nequaltes nvolvng hgh-order partal dervatves Authors Zhao, CJ; Cheung, WS Ctaton Journal Of Inequaltes And Applcatons, 008, v. 008, artcle no. 5747 Issued Date 008 URL http://hdl.handle.net/07/569
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationFuzzy Approaches for Multiobjective Fuzzy Random Linear Programming Problems Through a Probability Maximization Model
Fuzzy Approaches for Multobjectve Fuzzy Random Lnear Programmng Problems Through a Probablty Maxmzaton Model Htosh Yano and Kota Matsu Abstract In ths paper, two knds of fuzzy approaches are proposed for
More informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationA SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents
A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION BOTAO WU Abstract. In ths paper, we attempt to answer the followng questons about dfferental games: 1) when does a two-player,
More informationCounterexamples to the Connectivity Conjecture of the Mixed Cells
Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs
More informationOn the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1
Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationHomogenization of reaction-diffusion processes in a two-component porous medium with a non-linear flux-condition on the interface
Homogenzaton of reacton-dffuson processes n a two-component porous medum wth a non-lnear flux-condton on the nterface Internatonal Conference on Numercal and Mathematcal Modelng of Flow and Transport n
More informationLyapunov-Razumikhin and Lyapunov-Krasovskii theorems for interconnected ISS time-delay systems
Proceedngs of the 19th Internatonal Symposum on Mathematcal Theory of Networks and Systems MTNS 2010 5 9 July 2010 Budapest Hungary Lyapunov-Razumkhn and Lyapunov-Krasovsk theorems for nterconnected ISS
More informationProjective change between two Special (α, β)- Finsler Metrics
Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationY. Guo. A. Liu, T. Liu, Q. Ma UDC
UDC 517. 9 OSCILLATION OF A CLASS OF NONLINEAR PARTIAL DIFFERENCE EQUATIONS WITH CONTINUOUS VARIABLES* ОСЦИЛЯЦIЯ КЛАСУ НЕЛIНIЙНИХ ЧАСТКОВО РIЗНИЦЕВИХ РIВНЯНЬ З НЕПЕРЕРВНИМИ ЗМIННИМИ Y. Guo Graduate School
More informationChapter 2 Transformations and Expectations. , and define f
Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationCurvature and isoperimetric inequality
urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More information6) Derivatives, gradients and Hessian matrices
30C00300 Mathematcal Methods for Economsts (6 cr) 6) Dervatves, gradents and Hessan matrces Smon & Blume chapters: 14, 15 Sldes by: Tmo Kuosmanen 1 Outlne Defnton of dervatve functon Dervatve notatons
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationMath 702 Midterm Exam Solutions
Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationFinslerian Nonholonomic Frame For Matsumoto (α,β)-metric
Internatonal Journal of Mathematcs and Statstcs Inventon (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 ǁ Volume 2 ǁ Issue 3 ǁ March 2014 ǁ PP-73-77 Fnsleran Nonholonomc Frame For Matsumoto (α,)-metrc Mallkarjuna
More informationInfinitely Split Nash Equilibrium Problems in Repeated Games
Infntely Splt ash Equlbrum Problems n Repeated Games Jnlu L Department of Mathematcs Shawnee State Unversty Portsmouth, Oho 4566 USA Abstract In ths paper, we ntroduce the concept of nfntely splt ash equlbrum
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationSupplementary material: Margin based PU Learning. Matrix Concentration Inequalities
Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we
More informationResearch Article A Generalized Sum-Difference Inequality and Applications to Partial Difference Equations
Hndaw Publshng Corporaton Advances n Dfference Equatons Volume 008, Artcle ID 695495, pages do:0.55/008/695495 Research Artcle A Generalzed Sum-Dfference Inequalty and Applcatons to Partal Dfference Equatons
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationON THE JACOBIAN CONJECTURE
v v v Far East Journal of Mathematcal Scences (FJMS) 17 Pushpa Publshng House, Allahabad, Inda http://www.pphm.com http://dx.do.org/1.17654/ms1111565 Volume 11, Number 11, 17, Pages 565-574 ISSN: 97-871
More informationHow Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *
How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationOn the convergence of the block nonlinear Gauss Seidel method under convex constraints
Operatons Research Letters 26 (2000) 127 136 www.elsever.com/locate/orms On the convergence of the bloc nonlnear Gauss Sedel method under convex constrants L. Grppo a, M. Scandrone b; a Dpartmento d Informatca
More informationThe New Butterfly Relaxation Method for Mathematical Programs with Complementarity Constraints
The New Butterfly Relaxaton Method for Mathematcal Programs wth Complementarty Constrants Dussault, J.-P. Haddou, M. Mgot, T. 2016 Abstract We propose a new famly of relaxaton schemes for mathematcal programs
More informationACTM State Calculus Competition Saturday April 30, 2011
ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More information2 MADALINA ROXANA BUNECI subset G (2) G G (called the set of composable pars), and two maps: h (x y)! xy : G (2)! G (product map) x! x ;1 [: G! G] (nv
An applcaton of Mackey's selecton lemma Madalna Roxana Bunec Abstract. Let G be a locally compact second countable groupod. Let F be a subset of G (0) meetng each orbt exactly once. Let us denote by df
More informationGroup Analysis of Ordinary Differential Equations of the Order n>2
Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru
More informationSupplement to Clustering with Statistical Error Control
Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More information