Zobrazeno 1 - 10
of 60
pro vyhledávání: '"A. L. Soyster"'
Autor:
Allen L. Soyster
Publikováno v:
IISE Transactions. 55:107-110
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce6a22285fb10716797608266696ecb3
https://doi.org/10.1080/24725854.2022.2116508
https://doi.org/10.1080/24725854.2022.2116508
Autor:
A. L. Soyster, F. H. Murphy
Publikováno v:
Journal of Global Optimization. 66:195-223
The usual formulation of a linear program is max $$c\cdot x{:}Ax \le b, x \ge 0$$c·x:Ax≤b,xź0. The core part of this linear program is the $$A$$A matrix since the columns define the variables and the rows define the constraints. The $$A$$A matrix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3bf284770604ae588c3588860ba8ed9
https://doi.org/10.1007/s10898-014-0240-9
https://doi.org/10.1007/s10898-014-0240-9
Autor:
Andrija T. Saric, Frederic H. Murphy, Murthy V. Mudrageda, Allen L. Soyster, Aleksandar M. Stankovic
Publikováno v:
Energy Policy. 38:141-150
We look at the effect of modeling branch-outage contingencies on locational marginal prices. To model contingencies in the day-ahead auction, we formulate a two-stage stochastic program. Rather than follow the current practice of including a list of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60495f6b340f4e8c9aa8bd5b9957b68e
https://doi.org/10.1016/j.enpol.2009.08.065
https://doi.org/10.1016/j.enpol.2009.08.065
Publikováno v:
IEEE Transactions on Power Systems. 24:1266-1278
Planning for contingencies typically results in the use of more expensive facilities before disruptions. It leads to different prices and energy availability at various network locations depending on how the contingency analysis is performed. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28700718385fa1a4e766fffa9a855010
https://doi.org/10.1109/tpwrs.2009.2023267
https://doi.org/10.1109/tpwrs.2009.2023267
Publikováno v:
Journal of Engineering Education. 97:5-11
On February 21, 2006, the National Academy of Engineering recognized the achievements of the Learning Factory with the Bernard M. Gordon Prize for Innovation in Engineering and Technology Education. The co-founders were commended “for creating the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b30e80db1fd6f762be611c7a2d03339
https://doi.org/10.1002/j.2168-9830.2008.tb00949.x
https://doi.org/10.1002/j.2168-9830.2008.tb00949.x
Publikováno v:
Computers & Operations Research. 23:783-799
Given two sets of positive and negative examples, the inductive inference problem is to infer a small set of logical clauses which appropriately classify the examples. A graph theoretic approach is used to establish a lower limit on the minimum numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ec1fc11500d40467847df6ad95a677e
https://doi.org/10.1016/0305-0548(95)00075-5
https://doi.org/10.1016/0305-0548(95)00075-5
Publikováno v:
Mathematical and Computer Modelling. 23:69-86
A critical aspect in the problem of inductive inference is the number of examples needed to accurately infer a Boolean function from positive and negative examples. In this paper, we develop an approach for deriving a sequence of examples for this pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cf9af6cf5b49b8813a9744fdd0c085e
https://doi.org/10.1016/0895-7177(95)00234-0
https://doi.org/10.1016/0895-7177(95)00234-0
Publikováno v:
Computers & Operations Research. 21:185-197
Consider a logical system with N entities which assume binary values of either TRUE (1) or FALSE (0). There are 2 N vectors, each with N components, of this type. Even when a modest value of N , e.g. N = 50, the number of such vectors exceeds one qua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6745d4f62910d09d8a6c5152977417d
https://doi.org/10.1016/0305-0548(94)90051-5
https://doi.org/10.1016/0305-0548(94)90051-5
Autor:
M.K. Groover, A. L. Soyster
Publikováno v:
IIE Transactions. 23:104-114
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::562bffd7da1603fe09e860f6e4219956
https://doi.org/10.1080/07408179108963845
https://doi.org/10.1080/07408179108963845
Publikováno v:
European Journal of Operational Research. 46:388-392
In this paper, a transfer line with a common buffer is considered. It is demonstrated that the distribution of storage capacity remains a control issue even when a common buffer is employed. In particular, it is shown how deliberate machine blocking
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d501d7888dc34e85cbbde4c739a10bc
https://doi.org/10.1016/0377-2217(90)90014-3
https://doi.org/10.1016/0377-2217(90)90014-3