Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Angelos Tsoukalas"'
Autor:
Angelos Tsoukalas, Kalyan Talluri
Publikováno v:
Operations Research. INFORMS Institute for Operations Research and the Management Sciences
Professional service firms (PSFs) such as management consulting, law, accounting, investment banking, architecture, advertising, and home-repair companies provide services for complicated turnkey projects. A firm bids for a project and, if successful
Publikováno v:
Operations Research, 68, 572-590. INFORMS Institute for Operations Research and the Management Sciences
Two-stage robust optimization problems, in which decisions are taken both in anticipation ofand in response to the observation of an unknown parameter vector from within an uncertaintyset, are notoriously challenging. In this paper, we develop conver
Autor:
Kalyan T. Talluri, Angelos Tsoukalas
Publikováno v:
SSRN Electronic Journal.
Professional service firms (PSFs) such as management consulting, law, accounting, investment banking, architecture, advertising and home-repair companies provide services for turnkey complicated projects. The operational tasks of such firms consists
Publikováno v:
Journal of Global Optimization. 68:219-225
Publikováno v:
Journal of Optimization Theory and Applications. 167:558-584
We propose an algorithm for solving the surrogate dual of a mixed integer program. The algorithm uses a trust region method based on a piecewise affine model of the dual surrogate value function. A new and much more flexible way of updating bounds on
Autor:
Alexander Mitsos, Angelos Tsoukalas
Publikováno v:
Journal of Global Optimization. 61:1-17
The algorithm proposed in Mitsos (Optimization 60(10---11):1291---1308, 2011) for the global optimization of semi-infinite programs is extended to the global optimization of generalized semi-infinite programs. No convexity or concavity assumptions ar
Autor:
Angelos Tsoukalas, Belmiro P.M. Duarte
Publikováno v:
Computers & Operations Research. 41:223-230
We propose a systematic algorithm to tackle a set of acceptance sampling problems introduced by Seidel [1] and their generalization when no prior knowledge is assumed. The problems are modeled as minimax problems with coupled or decoupled constraints
Autor:
Berç Rustem, Angelos Tsoukalas
Publikováno v:
Optimization Letters. 5:705-716
Discretization methods for semi-infinite programming do not provide a feasible point in a finite number of iterations. We propose a method that computes a feasible point with an objective value better than or equal to a target value f0 or proves that
Publikováno v:
Lectures on Global Optimization. :215-243
Autor:
Taghi Miri, Berç Rustem, Serafim Bakalis, Efstratios N. Pistikopoulos, Peter J. Fryer, Angelos Tsoukalas
Publikováno v:
Journal of Food Engineering. 87:485-494
Conventionally, food is significantly over-processed to ensure safety. Dynamic optimization can be used to compute optimal thermal operation condition to ensure maximum product quality while assuring food safety. Local optimization (LO) algorithms ha