A. Charnes, W. W. Cooper. "Management Models and Industrial Applications of Linear Programming". Wiley, New York, 1961.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... 0 becomes v(x) v(y) # where # 0 is a very small positive number that should be chosen according to the precision of the arithmetics used by the LP package. The test of the existence of a solution to the system of linear constraints is done via standard Goal Programming techniques [33] adding appropriate deviation variables. In UTA, each equation v(x) v(y) 0 is translated into an equation v(x) v(y) # y = 0, where x , # x , # y and # y are nonnegative deviation variables. Similarly each inequality v(x) v(y) # is written as v(x) v(y) # y ....

A. Charnes and W. W. Cooper. Management Models and Industrial Applications of Linear Programming. Wiley, New York, 1961.

.... Normally, the decision about what the best answer is, corresponds to the so called human decision maker (Coello 1999) Traditionally, there are several methods available in the Operational Research (OR) literature for solving MOPs as mathematical programming models, viz goal programming (Charnes and Cooper 1961), weighted sum method (Turban and Meredith 1994) goals as requirement (Coello 1999) goal attainment (Wilson and Macleod 1993) and the iso resource cost solution method (Zeleny 1998) The concept of a goal is somewhat di#erent from an objective. A goal is usually considered as a planned ....

Charnes, A. and W. Cooper (1961). Management models and industrial applications of linear programming, volume 1. John Wiley, New York.

....Decision Support Problem (Mistree et al. 1993, Figure 4) is used in this work to make the trade offs between the multiple design requirements. The compromise DSP is a multiobjective mathematical construct which is a hybrid formulation based on mathematical programming and goal programming (Charnes Cooper, 1961). The method is superior to conventional optimization methods in its capability of handling multiple design objectives at either the same or different priority levels. In Figure 4, goals may either be weighted in an Archimedean solution scheme or, using a preemptive approach, rank ordered into ....

Charnes, A. and Cooper, W.W., 1961, Management Models and Industrial Applications of Linear Programming, John & Wiley, New York.

....This is an innovative idea first introduced by the Italian economist, Pareto. A significant contribution was later made by Koopmans (1951) using the concept of efficient vectors. He introduced the concept of non dominated solutions for modern MCDM problems. The introduction of goal programming by Charnes and Cooper (1961) was the most significant work of the 1950s in this area. The 1970s then witnessed the development of a variety of algorithms to solve nonlinear multi criterion problems. Special algorithms are also developed which have the ability to solve linear as well as nonlinear and discrete as well as ....

Charnes, A. and W. W. Cooper. 1961. Management Models and Industrial Applications of Linear Programming, Vols. I and II. John Wiley and Sons, New York.

....(x) k ; k 2 K 9 = 2 IR l ; where 0 2 : f 2 IR l j k 0; k 2 Kg is arbitrarily fixed. By glob ( loc ( we denote the set of all global (local) minimizers for P 1 ( Then the following relation is known M eff = 2IR l glob ( M loceff = 2IR l loc ( see e.g. [1], 3] 9] Then we obtain a one parametric optimization problem by choosing a starting parameter 0 with 0 k f k (x i ) k 2 K; and considering the connecting line n 2 IR l j = 0 t( 1 Gamma 0 ) t 2 [0; 1] o : Then we obtain P 1 (t) P 1 (t; 0 ; 1 ) min 8 ....

Charnes, A., Cooper, W. (1961): Management Models and Industrial Applications of Linear Programming. New York

....organizational units. See, for example, Charnes, Cooper, Lewin, and Seiford [1994] and Norman and Stoker [1991] Interestingly, Charnes and Cooper have also had a significant impact on the development of Multiple Objective Linear Programming (MOLP) through the development of Goal Programming (Charnes and Cooper [1961]) Since the 1970 s, MOLP has become a popular approach for modeling and analyzing certain types of multiple criteria decision problems. Although Charnes and Cooper have played a significant role in the development of DEA and MOLP, researchers in these two camps have generally not paid much ....

Charnes, A. and Cooper, W. W. (1961), Management Models and Industrial Applications of Linear Programming, John Wiley, New York.

....the trade off surface 2 by varying the weights. This approach is very simple and easy to implement, but it has the disadvantage of missing concave portions of the trade off curve 3 [Ritzel et al. 1994] which is a serious drawback in most real world applications. 4. 2 Goal Programming Charnes and Cooper [1961] and Ijiri [1965] are credited with the development of the goal programming method for a linear model, and have played a key role in applying it to industrial problems. In this method, the decision maker has to assign targets or goals that he she wishes to achieve for each objective. These values ....

Charnes, A. and Cooper, W. W. 1961. Management Models and Industrial Applications of Linear Programming, Volume 1. John Wiley, New York.

....complicating its appropriate use in practice. 4.6 Target Vector Approaches Under this name we will consider approaches in which the decision maker has to assign targets or goals that he she wishes to achieve for each objective. The most popular techniques included here are: Goal Programming [48, 49], Goal Attainment [9, 50] and the min max approach [51, 52, 53] These techniques will yield a dominated solution if the goals desired are chosen in the feasible domain, which is a condition that might certainly limit their applicability. 4.6.1 Applications Wilson MacLeod [9] used ....

A. Charnes and W. W. Cooper. Management Models and Industrial Applications of Linear Programming, volume 1. John Wiley, New York, 1961.

....points in the procedure outlined above because it is reasonable to expect values of each criterion to lie between utopia and nadir points. The ARBDS method can be considered as an extension of the commonly known technique called Goal Programming (GP) originally proposed by Charnes and Cooper in [ChC67] One can compare GP to using all goals as soft equality constraints, while ARBDS approach includes also soft inequalities of both signs (for maximized or minimized objectives) as well as soft equality constraints (for stabilized objectives) Thus, the ARBDS approach produces Pareto optimal ....

A. Charnes and W. Cooper, Management Models and Industrial Applications of Linear Programming, J. Wiley & Sons, New York, London, 1967.

....expectations of a DM. The limitations of the two approaches summarized above have led to developments of various methods based on a most natural way of expressing preferences. Namely, by a specification of the aspiration levels. Goal Programming (GP) originally proposed by Charnes and Cooper in [ChC67] is a commonly known technique that assumes minimization of a distance between a point composed of criteria s value and a given aspiration point. The GP uses a scalarizing function: s(q; q) k q Gamma q k (8) Minimization of (8) with respect to x 2 X 0 , provides a solution having values ....

A. Charnes and W. Cooper, Management Models and Industrial Applications of Linear Programming, J. Wiley & Sons, New York, London, 1967.

....disadvantage of missing concave portions of the trade off curve (in other words, the approach does not generate proper Pareto optimal solutions in the presence of non convex search spaces) 77] which is a serious drawback in most real world applications. 3. 2 Goal Programming Charnes and Cooper [5] and Ijiri [39] are credited with the development of the goal programming method for a linear model, and have played a key role in applying it to industrial problems. In this method, the decision maker has to assign targets or goals that he she wishes to achieve for each objective. These values ....

A. Charnes and W. W. Cooper. Management Models and Industrial Applications of Linear Programming, volume 1. John Wiley, New York, 1961.

....for the (MOP ) if there is no other point x 2 F such that f i (x) f i (x) for all i 2 Q and f(x) 6= f(x) If x is a Pareto point, the corresponding point f(x) in the objective space is called nondominated. We make extensive use of the scalarization of (1) introduced by Charnes and Cooper [2] and formulated for x , an arbitrary feasible point of the (MOP ) min Q X q=1 f q (x) s.t. f q (x) Gamma f q (x ) 0 q = 1; Q (2) x 2 F: As this scalarization depends on the point x , we refer to this problem as (CC(MOP; x ) It is also well known that problem (2) ....

A. Charnes and W. Cooper. Management Models and Industrial Applications of Linear Programming. John Wiley and Sons, New York, 1961.

....is given. Key Words: Convex curve, approximation method, quadratic convergence, bicriteria network program. 1. Introduction Approximation methods of convex curves in IR 2 are useful in several contexts and have been extensively studied in recent operations research literature, see e.g. [3,4,5,10]. Without loss of generality, we assume that the given convex curve is described by a convex function defined on a bounded closed interval [a; b] To be more specific, we assume that the change of the direction of the tangent of the convex function is less than or equal to 2 . Several ....

Charnes, A. and Cooper, W.W., Management Models and Industrial Applications of Linear Programming, John Wiley & Sons, INC., New York, 1961.

No context found.

A. Charnes, W. W. Cooper. "Management Models and Industrial Applications of Linear Programming". Wiley, New York, 1961.

No context found.

Charnes A. and Cooper W. W., Management models and industrial applications of linear programing. New York, John Wiley & Sons, 1961.

No context found.

Charnes A and Cooper WW (1961). Management Models and Industrial Applications of Linear Programming (Volume 2). Wiley: New-York.

No context found.

Charnes, A., and Cooper, W. W.: Management Models and Industrial Applications of Linear Programming, Vol. II, John Wiley & Sons, NY (1961).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC