Showing papers in "European Journal of Operational Research in 1982"

TL;DR: In this article, the authors present an ordinal regression method using linear programming to estimate the parameters of the utility function, which leads to the assessment of a set of utility functions by means of postoptimality analysis techniques in linear programming.

TL;DR: In this article, the Schrage tree search problem has been shown to be NP-hard in the strong sense, and it is shown that the difference between the optimum and Schrage schedule is less than d 1.

TL;DR: The global optimal solution is shown to be difficult to obtain and an alternative iterative procedure is presented which is easily implemented and converges to a local optimum.

TL;DR: In this article, the knowledge of weights is replaced by the existence of a semi-order, where preference of the decision maker as a weak order on each criterion and the relation among criteria as a semiorder on the given set of criteria are considered.

TL;DR: This paper presents an algorithm for the shortest path problem, where one objective for any Pareto optimal path can not be improved without worsening the other one and a special set of paths is determined.

TL;DR: Theory of evaluation sheds new light on such well-known concepts as membership, conjunction and disjunction and seems to be a very promising tool to handle representation problems as they grow from the fields of theory of fuzzy set and its many applications, of human decision making and of multicriteria analysis.

TL;DR: In this paper, a bieriterion approach to sequencing with time/cost trade-offs is presented, which produces an efficient frontier of possible schedules, and does not require the sequencing criteria to be measurable in the same units as the resource allocation cost.

TL;DR: An approximate method for the analysis of open networks of queues in tandem and with blocking is proposed, based on the method of decomposition where the total network is broken down into queues which are analyzed as M/C2/1/N queues assuming Poisson arrival and departure processes.

TL;DR: The technique can be used to identify some or all efficient solutions to the multiple objective integer linear programming problem and is well suited for implementation using integer postoptimality techniques.

TL;DR: The Lagrangean approach to the symmetric traveling salesman problem is used in a new branch and bound algorithm that differs from other algorithms not only in the branching scheme, but also in the ascent method to calculate the 1-tree bounds.

TL;DR: This paper addresses two further issues: Firstly, for some important special cases or applications, it is demonstrated that not only is the computation of a set of equivalent weights feasible, but it is also highly desirable.

TL;DR: Two lower bounds for the p-median problem are presented, the problem of locating p facilities (medians) on a network, based on two separate lagrangean relaxations of a zero-one formulation of the problem with subgradient optimisation being used to maximise these bounds.

TL;DR: In this paper, a generalization of the classical economic order quantity model is considered, where the traditional parameters of unit cost, selling price, demand rate and set-up cost are constant but the holding cost per unit is a non-linear function of the length of time the item is held in stock.

TL;DR: An acceptance-rejection algorithm for generating random vectors uniformly distributed over (inside or on the surface of) a complex region inserted in a minimal multidimensional rectangle is considered.

TL;DR: A network-based optimizing approach to the classroom/time model which rapidly approximates the solutions is devised which combines the insight of the scheduler with combinatorial and searching ability of a computer via a transshipment optimization network model.

TL;DR: A special multiple criteria decision making approach for solving problems in context with fuzzy individual preferences, i.e. a highway plan choice problem and a problem in marketing research dealing with the launching of a new product.

TL;DR: The proposed Sequential Proxy Optimization Technique (SPOT) combines the desirable features of both the Surrogate Worth Trade-off method and the Multiattribute Utility Function (MUF) method and can interactively derive the preferred solution of the decision maker efficiently.

TL;DR: In this paper, the authors considered several multi-period public facility planning decision problems such as multiperiod service coverage and phase-out, and presented models for these situations and computational experience.

TL;DR: In this article, the worst case performance of three heuristics is analyzed for the dynamic lot size problem without backlogging, and it is shown that the worst-case performance of the Silver-Meal algorithm is twice the optimal one.

TL;DR: The problem to be addressed and tackled in this paper arose as a byproduct from some efforts at solving problems involving multiple goals by linking linear and goal programming models that some forms for interdependence among the goals could not be handled in the programming models.

TL;DR: In this paper, the authors consider the long range planning process from the point of view both of projecting forward likely or desired changes from the current position to define a possible future state, and of identifying desirable future states and working backwards from those to consider ways in which they could be reached.

TL;DR: In this paper, a solution to a qualification of the standard EOQ problem in which freight costs are at least partially determined by the integer number of carloads required to fill the order is given.

TL;DR: The concept of semilocally convexity was introduced by Ewing as discussed by the authors, who defined semilocal quasiconvex, semi-locally pseudoconvex and other related functions and investigated some of their properties.