-
作者：Mulligan, AE; Ahlfeld, DP
作者单位：Woods Hole Oceanographic Institution; University of Massachusetts System; University of Massachusetts Amherst
摘要：A new interior-point algorithm for solving the groundwater-pollution-control design problem is presented. The algorithm requires that the objective function is differentiable in the interior region. Fur minimization problems with nonlinear constraint, and a concave objective function, the technique is shown to be similar to an active set gradient-projection method, where the tangent of the boundary between feasible and infeasible solutions is used to determine a search direction. In this new m...
-
作者：Post, T; Cherchye, L; Kuosmanen, T
作者单位：Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC; KU Leuven
摘要：This paper develops a new nonparametric model for efficiency estimation. In contrast to Data Envelopment Analysis (DEA), it does not impose debatable production assumptions like free disposability and convexity, and it does not assume that the data are measured without error. The estimators are asymptotically unbiased and have an asymptotic variance that is comparable to that of stochastic frontier estimators (provided the latter use a correct specification of the functional form for the produ...
-
作者：Sherali, HD; Driscoll, PJ
作者单位：Virginia Polytechnic Institute & State University; United States Department of Defense; United States Army; United States Military Academy
摘要：This paper is concerned with applying the Reformulation-Linearization Technique (RLT) to derive tighter relaxations for the Asymmetric Traveling Salesman Problem (ATSP) formulation that is based on the Miller-Tucker-Zemlin (MTZ) subtour elimination constraints. The MTZ constraints yield a compact representation for the Traveling Salesman Problem (TSP), and their use is particularly attractive in various routing and scheduling contexts that have an embedded ATSP structure. However, it is well r...
-
作者：Klamroth, K; Wiecek, MM
作者单位：University of Erlangen Nuremberg; University of Copenhagen; Clemson University
摘要：The multiple objective median problem (MOMP) involves locating a new facility with respect to a given set of existing facilities so that a vector of performance criteria is optimized. A variation of this problem is obtained if the existing facilities are situated on two sides of a linear barrier, Such barriers, like rivers. highways, borders. or mountain ranges, are frequently encountered in practice, In this paper, theory of an MOMP with line barriers is developed. As this problem is nonconve...
-
作者：Rajaram, K; Karmarkar, US
作者单位：University of California System; University of California Los Angeles
摘要：We formulate the dynamic product-cycling problem with yield uncertainty and buffer limits to determine how much product to produce at what time to minimize total expected switching, production, inventory storage. and backorder costs, A restricted Lagrangian technique is used to develop a lower bound and a model-based Lagrangian heuristic. We also develop an operational heuristic and a greedy heuristic. The operational heuristic has been implemented at seven refineries at Cerestar, Europe's lea...
-
作者：Dai, JG; Weiss, G
作者单位：University System of Georgia; Georgia Institute of Technology; University System of Georgia; Georgia Institute of Technology; University of Haifa
摘要：We describe a simple online heuristic for scheduling job shops, We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses safety stocks and keeps the bottleneck machine buoy at almost all times, while the other machines are paced by the bottleneck machine. We perforin a probabilistic analysis of the heuristic, under some assumptions on the distributions, of the processing times. We show that our heuristic produces makespan, which exceeds the...
-
作者：Magnanti, TL; Sastry, T
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); Indian Institute of Management (IIM System); Indian Institute of Management Ahmedabad
摘要：We study a scheduling problem with changeover costs and capacity constraints. The problem is NP-complete, and combinatorial algorithms for solving it have not performed well. We identify a general class of facets that subsumed as special cases some known facets from the literature. We also develop a cutting-plane-based procedure and reformulation for the problem, and we obtain optimal solutions to problem instances with up to 600 integer variables without resorting to branch-and-bound procedur...
-
作者：Cooper, WL
作者单位：University of Minnesota System; University of Minnesota Twin Cities
摘要：Revenue management has become an important tool in the airline, hotel. and rental car industries. We describe asymptotic propertied of revenue management policies derived from the solution of a deterministic optimization problem. Our primary results state that, within a stochastic and dynamic framework, solutions arising out of a single well-known linear program can be used to generate allocation policies for which the normalized revenue converges in distribution to a constant upper bound on t...
-
作者：Pastor, JT; Ruiz, JL; Sirvent, I
作者单位：Universidad Miguel Hernandez de Elche
摘要：Some problems in economics. operations research, and engineering may be approached by means of a pair of radial DEA models that are nested, i.e., that the set of Constraints of one of them is included in that of the other, In this paper we have focused on analyzing the marginal role of a given variable, called candidate. with respect to the efficiency measured by means of a DEA model, First, we have defined a new efficiency contribution measure (ECM), which finally compares the efficiency scor...
-
作者：Erera, AL; Daganzo, CF; Lovell, DJ
作者单位：University System of Georgia; Georgia Institute of Technology; University of California System; University of California Berkeley; University System of Maryland; University of Maryland College Park
摘要：This paper is concerned with the performance of multicommodity capacitated networks in a deterministic but time-dependent environment. For a given time-dependent origin-destination table, this paper asks if it is easy to find a way of regulating the input flows into the network to avoid queues from growing internally, i.e., to avoid capacity violations. Problems of this tape are conventionally approached in the traffic/transportation field with variational methods such as control theory (if ti...
