On solving a non-convex quadratic programming problem involving resistance distances in graphs

Quadratic programming problems involving distance matrix ( D ) that arises in trees are considered in the literature by Dankelmann (Discrete Math 312:12–20, 2012 ), Bapat and Neogy (Ann Oper Res 243:365–373, 2016 ). In this paper, we consider the question of solving the quadratic programming problem...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Annals of operations research Ročník 287; číslo 2; s. 643 - 651
Hlavní autori: Dubey, Dipti, Neogy, S. K.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.04.2020
Springer
Springer Nature B.V
Predmet:
Analysis
Business and Management
Combinatorics
Distance matrices
Graphic methods
Graphs
Mathematical programming
Matrices (mathematics)
Methods
Operations research
Operations Research/Decision Theory
Problem solving
Quadratic programming
S.I.: Game theory and optimization
Studies
Theory of Computation
India
Non-convex quadratic programming
Laplacian matrix
Polynomial time algorithm
Symmetric bimatrix game
Resistance distance
90C33
ISSN:0254-5330, 1572-9338
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Quadratic programming problems involving distance matrix ( D ) that arises in trees are considered in the literature by Dankelmann (Discrete Math 312:12–20, 2012 ), Bapat and Neogy (Ann Oper Res 243:365–373, 2016 ). In this paper, we consider the question of solving the quadratic programming problem of finding maximum of x T R x subject to x being a nonnegative vector with sum 1 and show that for the class of simple graphs with resistance distance matrix ( R ) which are not necessarily a tree, this problem can be reformulated as a strictly convex quadratic programming problem. An application to symmetric bimatrix game is also presented.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-018-3018-5