Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Operation Research Problems

R Hundredweight of flour for regular bread P Hundredweight of flour for premium bread B Total benefit to bakery in dollars [Pg.307]

We have three constraints, 140 hundredweights of flour, 7,200 of capital, and 330 h of labor  [Pg.307]

In addition, all decision variables should be integers and equal to or greater than 0 (R and P [Pg.307]

As detailed and explained in the warm-up example (11.5.5) we will use the Solver tool from Microsoft Excel. The following screen shows the objective function (cell L6), the variables R and P (cells 19 and no, respectively), and the constraints for Flour, Capital and Hundredweights (cells D9, DIO and D11 respectively). We tentatively start with initial values of R = 50 and P = 30 (Fig. 11.35). [Pg.307]

as shown in the following screen, in the Solver tool box we include objective function, changing variables and constraints (Fig. 11.36). [Pg.307]


An operations research problem may be remedial in that it seeks to... [Pg.251]

An illustration of an operations research problem for which no model is yet available is the following, which occurs in queueing theory.4 Everyone has observed, and perhaps been displeased to notice, persons in a waiting line, before a theater box-office, for example, who arrive after the observer s arrival, but who go to persons in front to solicit their cooperation in obtaining service. Thus, an... [Pg.252]

Whatever model is used to describe an operations research problem, be it a differential equation, a mathematical program, or a stochastic process, there is a natural tendency to seek a maximum or a minimum with a certain purpose in mind. Thus, one often finds optimization problems imbedded in the models of operations research. [Pg.255]

A Search Problem.—An example of an operations research problem that gives rise to an isoperimetric model is a search problem, first given by B. Koopman,40 that we only formulate here. Suppose that an object is distributed in a region of space with ... [Pg.307]

C. Koulamas, K.R. Davis, F. Turner III, A survey of simulated annealing applications to operations research problems. Omega, 22 (1994) 41. [Pg.470]

A variety of methods can be used for such problems, among them ant colony optimisation is a promising method, inspired by the way in which ants find the shortest path in nature. The selection of paths traditionally uses a roulette wheel which works well for problems of smaller dimensionality but breaks down when higher numbers of variables are considered. In this paper, a subset-based tournament selection ACO approach is proposed that is shown to outperform the roulette wheel-based approach for operations research problems of higher dimensionality in terms of the performance of the final solutions and execution time on problems taken from the literature. [Pg.232]

DE has been successfiiUy applied in many operational research problems, such as flow shop scheduling, job shop scheduling, and VRP. Some of the applications are briefly reviewed below. [Pg.364]

The pursuit of operations research consists of (a) the judgment phase (what are the problems ), (b) the research phase (how to solve these problems), and (c) the decision phase (how to act on the finding and eliminate the problems). These phases require the evaluation of objectives, analysis of an operation and the collection of evidence and resources to be committed to the study, the (mathematical) formulation of problems, the construction of theoretical models and selection of measures of effectiveness to test the models in practice, the making and testing of hypotheses as to how well a model represents the problem, prediction, refinement of the model, and the interpretation of results (usually as possible alternatives) with their respective values (payoff). The decision-maker generally combines the findings of the... [Pg.250]

To a considerable extent, operations research as a formal discipline is occupied with the construction of models. This is closely related to the analysis of alternatives for decision-making. It is generally assumed that it is preferable to have a model to represent an operation, even though it is oversimplified and perhaps imperfect, than to have none. A model may be purely logical or it may be a physical analogue. A mathematical formula is an example of the former, a wind tunnel an illustration of the latter. In both cases, the model provides a ooherent framework for coping with the complexities of a problem. [Pg.251]

One observes that operations research tends to regard a problem within the operation as a whole in order to avoid overlooking significant factors that affect those parts of the operation relating to the problem. [Pg.252]

An interesting problem solved by operations research methods is that of the flow of traffic through the New York tunnels. The presence of toll booths causes congestion of traffic at the entrances and exits of tunnels. Economical operation of the toll booths necessitates that not all booths be open at all times. By studying the statistics of the traffic, a schedule was developed indicating the number of booths to be operated at different times of the day. In this manner congestion was alleviated, and the frequency of traffic jams was reduced considerably.8... [Pg.252]

The problems of operations research have stimulated new developments in several mathematical fields various aspects of game theory, stochastic processes, the calculus of variations, graph theory, and numerical analysis, to name a few. [Pg.253]

Interest in developing and refining the mathematical methods of operations research has become intensified and sophisticated. Attention is generally given to a priori upper bounds on the number of solutions of a problem, the existence and uniqueness of solutions,... [Pg.254]

We shall start out with elementary general topological considerations of flow by studying network flow. We shall follow this by a variety of models from operations research that illustrate analytical methods and problems. No illustrations of statistical methods will be given here because statistics, a fundamental tool of science, is abundantly discussed in the literature of science. [Pg.255]

Fig. 5-2. we shall discuss at some length in this section. This problem is applicable to operations research, and, hence, we give a brief outline of maximum flow through networks. [Pg.256]

Maximization, Minimization, and Minmax.—We shall discuss three wide classes of optimization problems that illustrate the ideas of the title of this section as used in operations research. They are ... [Pg.286]

Another active branch of optimization in operations research is dynamic programming, which provides a variety of interesting ideas for formulating problems. Because we cannot discuss it in this chapter, the reader is referred, for an understanding of the subject, to the work of R. Bellman.37... [Pg.305]

Manne, Alan S., A Target-Assignment Problem, Operations Research, 6, No. 3, 307-466 (1958). [Pg.319]

Sasieni, M. W., Yaspan, A., and Friedman, L., Operations Research Methods and Problems, John Wiley and Sons, Inc., New York, 1959. [Pg.320]

The flowshop problem has been widely studied in the fields of both operations research (Lagweg et al., 1978 Baker, 1975) and chemical engineering (Rajagopalan and Karimi, 1989 Wiede and Reklaitis, 1987). Since the purpose of this chapter is to illustrate a novel technique to synthesize new control knowledge for branch-and-bound algorithms, we... [Pg.273]

Ackoff and Sasieni [1] defined operations research (OR) as the application of scientific method by interdisciplinary teams to problems involving the control of organized (man-machine) systems so as to provide solutions which best serve the purposes of the organization as a whole . [Pg.605]

In Section 42.2 we have discussed that queuing theory may provide a good qualitative picture of the behaviour of queues in an analytical laboratory. However the analytical process is too complex to obtain good quantitative predictions. As this was also true for queuing problems in other fields, another branch of Operations Research, called Discrete Event Simulation emerged. The basic principle of discrete event simulation is to generate sample arrivals. Each sample is characterized by a number of descriptors, e.g. one of those descriptors is the analysis time. In the jargon of simulation software, a sample is an object, with a number of attributes (e.g. analysis time) and associated values (e.g. 30 min). Other objects are e.g. instruments and analysts. A possible attribute is a list of the analytical... [Pg.618]

Here we review some classical formulations of typical integer programming problems that have been discussed in the operations research literature, as well as some problems that have direct applicability to chemical processing ... [Pg.352]

There has been quite a large stream of research concerned with capacity expansions and retrofit problems in the chemical and operations research literature. In this section, however, we will concentrate on expansion and strategic multisite planning studies. Single site short-term and mid-term planning and scheduling studies are beyond the scope of this book and the interested reader is referred to the work by Bodington and Baker (1990), Pinto, Joly and Moro (2000), and Kallrath (2005). [Pg.57]

Kallrath, J. (2005) Solving planning and design problems in the process industry using mixed integer and global optimization. Annals of Operations Research, 140, 339. [Pg.78]

Ahmed, S., Cakrrian, U., and Shapiro, A. (2007) Coherent risk measure in inventory problems. European Journal of Operational Research, 182, 226. [Pg.159]

The methods of simulated annealing (26), genetic algorithms (27), and taboo search (29) are three of the most popular stochastic optimization techniques, inspired by ideas from statistical mechanics, theory of evolutionary biology, and operations research, respectively. They are applicable to our current problem and have been used by researchers for computational library design. Because SA is employed in this chapter, a more-detailed description of the (generalized) SA is given below. [Pg.381]

The best strategy on how to spend resources of time and money most efficiently can be considered a problem in operations research, under the topic of optimal resource allocation. The best way to use the limited resources of money and time effectively may be a mixed strategy, with some guided and some random searches. [Pg.229]


See other pages where Operation Research Problems is mentioned: [Pg.65]    [Pg.307]    [Pg.320]    [Pg.65]    [Pg.307]    [Pg.320]    [Pg.556]    [Pg.286]    [Pg.250]    [Pg.319]    [Pg.25]    [Pg.162]    [Pg.44]    [Pg.329]    [Pg.605]    [Pg.45]    [Pg.88]    [Pg.319]    [Pg.393]    [Pg.666]    [Pg.279]    [Pg.189]    [Pg.181]    [Pg.13]   


SEARCH



Operating problems

Operation problems

Operational problems

Operations research

Operations researchers

Research Problems

© 2024 chempedia.info