Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Richard J. Gallagher"'
Publikováno v:
INFORMS Journal on Computing. 15:23-41
A linear-programming model is proposed for deriving discriminant rules that allow allocation of entities to a reserved-judgment region. The size of the reserved-judgment region, which can be controlled by varying parameters within the model, dictates
Publikováno v:
Annals of Operations Research. 74:65-88
A nonlinear 0/1 mixed integer programming model is presented for a constrained discriminant analysis problem. The model places restrictions on the numbers of misclassifications allowed among the training entities, and incorporates a "reserved judgmen
Autor:
Jerald P. Dauer, Richard J. Gallagher
Publikováno v:
European Journal of Operational Research. 88:368-381
Characterizations for efficient faces and certain maximal efficient faces of the objective set Y of a linear k -objective minimization problem are presented. These characterizations are used to develop an algorithm for etermining high-dimensional max
Autor:
Ossama A. Saleh, Richard J. Gallagher
Publikováno v:
European Journal of Operational Research. 80:204-212
Associated with the objective set Y of a linear k-objective minimization problem is the efficiency equivalent polyhedron Y ≔ Y + R + k . Since Y has the same efficient structure as Y and since every extreme point of Y is efficient, this polyhedron
Autor:
Richard J. Gallagher, Ossama A. Saleh
Publikováno v:
European Journal of Operational Research. 73:150-163
A forward dynamic programming approach is utilized to find an algebraic representation for a polyhedron in objective space associated with a multiple objective transportation problem having k linear objectives. This polyhedron has the same efficient
Autor:
Ossama A. Saleh, Richard J. Gallagher
Publikováno v:
SIAM Journal on Control and Optimization. 31:247-256
In 1953, Arrow, Barankin, and Blackwell proved that if $R^n $ is equipped with its natural ordering and if A is a closed convex subset of $R^n $, then the set of points in A that can be supported by strictly positive linear functionals is dense in th
Autor:
Jerald P. Dauer, Richard J. Gallagher
Publikováno v:
SIAM Journal on Control and Optimization. 28:158-172
Positive proper efficient points are defined as solutions of appropriate linear scalar optimization problems. A geometric characterization of positive proper efficient points is given as well as conditions under which the set of positive proper effic
Publikováno v:
Proceedings of the 28th IEEE Conference on Decision and Control.
Two generalizations of a theorem concerning the density of the set of positive proper coefficient points in the set of all efficient points are given. A brief discussion of the importance of positive proper efficient points in controlling an economy
Publikováno v:
Physics in medicine and biology. 44(1)
An integer linear programming model is proposed as a framework for optimizing seed placement and dose distribution in brachytherapy treatment planning. The basic model involves using 0/1 indicator variables to describe the placement or non-placement
Autor:
Eva K. Lee, Marcelo Brito Passos1 eva.lee@isye.gatech.edu, Richard J. Gallagher, Marcelo Brito Passos1, Campbell, Ann Melissa2, Prausnitz, Mark R.3
Publikováno v:
IEEE Transactions on Biomedical Engineering. Jan2004, Vol. 51 Issue 1, p82-89. 8p.