83 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.This research addresses algorithmic approaches for solving two different, but related, types of optimization problems. Firstly, the research considers the solution of a specific type of assignment problem using continuous methods. Secondly, the research addresses solving systems of inequalities (and equalities) in a least square sense. The specific assignment problem has piece-wise linear additive separable server cost functions, which are continuous everywhere except at zero, the point of discontinuity for the $\{0,1\}$ assignment condition. Continuous relaxation of the $\{0,1\}$ constraints yields a linear programming problem. Solving the dual of the linear programming ...
This second edition introduces several areas and items that were not included in the first edition, ...
SIGLEAvailable from British Library Document Supply Centre- DSC:6029.319(NPL-DITC--168/90) / BLDSC -...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
140 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.In this thesis techniques for...
. In 1980, Han [6] described a finitely terminating algorithm for solving a system Ax b of linear ...
In [2] S.P. Han proposed a method for finding a least-squares solution for systems of linear inequal...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
International audienceWe consider a non-linear version of the Generalized Assignment Problem, a well...
partially_open3siWe consider a non-linear version of the Generalized Assignment Problem, a well-know...
International audienceWe consider a non-linear version of the Generalized Assignment Problem, a well...
We discuss a new simple method to solve linear programming (LP) problems, based on the so called dua...
This second edition introduces several areas and items that were not included in the first edition, ...
SIGLEAvailable from British Library Document Supply Centre- DSC:6029.319(NPL-DITC--168/90) / BLDSC -...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
International audienceWith the help of elementary results and techniques from Real Analysis and Opti...
140 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.In this thesis techniques for...
. In 1980, Han [6] described a finitely terminating algorithm for solving a system Ax b of linear ...
In [2] S.P. Han proposed a method for finding a least-squares solution for systems of linear inequal...
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
International audienceWe consider a non-linear version of the Generalized Assignment Problem, a well...
partially_open3siWe consider a non-linear version of the Generalized Assignment Problem, a well-know...
International audienceWe consider a non-linear version of the Generalized Assignment Problem, a well...
We discuss a new simple method to solve linear programming (LP) problems, based on the so called dua...
This second edition introduces several areas and items that were not included in the first edition, ...
SIGLEAvailable from British Library Document Supply Centre- DSC:6029.319(NPL-DITC--168/90) / BLDSC -...
AbstractAn algorithm previously introduced by the author for finding a feasible point of a system of...