Dipti Dubey

TL;DR: A Unified Framework for a Class of Mathematical Programming Problems (Dipti Dubey as discussed by the authors ) is a framework for solving a class of problems in graph optimization problems, such as maximizing spectral radius and number of spanning trees in bipartite graphs.

TL;DR: It is demonstrated how the concept of principal pivot transform can be effectively used to extend many existing results and revisit various results obtained for hidden Z class by Mangasarian, Cottle and Pang in context of solving linear complementarity problems as linear programs.

TL;DR: This paper considers 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 shows 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 quadratics programming problem.

TL;DR: In this article, a necessary and sufficient condition is given for the existence of an integer solution of a linear fractional programming problem by using its LCP formulation, where the concept of total dual integrality is utilized to obtain a necessary condition for existence of a integer solution to LCP with a hidden K-matrix.

TL;DR: A discrete variant of Farkas Lemma in the setting of a module over a linearly ordered commutative ring is reported, which may contain zero divisors and need not be associative nor unital.