Premium Essay

Sub Optimization

In:

Submitted By a1trueworshipper
Words 400
Pages 2
Sub Optimization

Definition:
“The result of different departments each attempting to reach a solution that is optimum for that department” (Stevenson, 2015).
Unfortunately, the sub-optimization process does not always adhere to the principle “the whole is more important than the sum of its parts”. Sub optimization occurs when different departments each attempt to reach a solution that is optimal for that department, but that may not be optimum for the organization as a whole. This type of policy can actually do more harm than good. When one department is delivering faster than another department can handle this could cause what is known as a “bottleneck” in the process, which may result in lost profits and customers. “This is a typical effect of sub-optimization. If you only optimize one step in your value creation process it can deliver things faster than the rest of the organization can deal with. Either that part runs dry on input or the output of that part floods subsequent process steps. Make sure that no one department produces more than the department with the least capacity (the bottleneck) can handle” (Marschall, 2011). In the management book “The Goal, Eliyahu Goldratt gives the example of a decision to make machining centers in a factory more efficient by increasing the amount of metal taken off with each pass of the cutting tool. However, Increasing the amount of metal taken off on each pass made the parts brittle, which necessitated heat-treating. The increased load on the furnace gave rise to a serious bottleneck in heat-treating and made the plant significantly less productive and less profitable.
In an effort to prevent sub optimization from occurring each department must work together to understand what the best process is as a whole and to see the bigger picture. Management must ensure that processes are not implemented independently of

Similar Documents

Premium Essay

Cost-Quality Trade Off

...of Economic Sciences, Tehran, Iran d Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran b a r t i c l e i n f o a b s t r a c t Considering the trade-offs between conflicting objectives in project scheduling problems (PSPs) is a difficult task. We propose a new multi-objective multi-mode model for solving discrete time–cost–quality trade-off problems (DTCQTPs) with preemption and generalized precedence relations. The proposed model has three unique features: (1) preemption of activities (with some restrictions as a minimum time before the first interruption, a maximum number of interruptions for each activity, and a maximum time between interruption and restarting); (2) simultaneous optimization of conflicting objectives (i.e., time, cost, and quality); and (3) generalized precedence relations between activities. These assumptions are often consistent with real-life projects. A customized, dynamic, and self-adaptive version of a multiobjective evolutionary algorithm is proposed to solve the scheduling problem. The proposed multi-objective evolutionary algorithm is...

Words: 11435 - Pages: 46

Premium Essay

Linear Programming and Simplex Method

...Maynooth devharajan.rangarajan.2016@mumail.ie Abstract— An optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function. This pays way to a new world of constrained optimization. This paper focuses on one such optimization technique known as Linear programming and one of its method known as Simplex method in detail with examples. cTx = c1x1 + · · · + cnxn The subject of linear programming can be defined quite concisely. It is concerned with the problem of maximizing or minimizing a linear function whose variables are required to satisfy a system of linear constraints, a constraint being a linear equation or inequality. The subject might more appropriately be called linear optimization. Problems of this sort come up in a natural and quite elementary way in many contexts but especially in problems of economic planning. (or Ax ≤ b) I. INTRODUCTION Linear programming is the process of taking various linear inequalities relating to some situation, and finding the "best" value obtainable under those conditions. A typical example would be taking the limitations of materials and labour, and then determining the "best" production levels for maximal profits under those conditions. In "real life", linear programming is part of a very important area of mathematics called "optimization techniques". This field of study (or at least the applied...

Words: 1927 - Pages: 8

Premium Essay

Math

...Case Analysis- Local Context Executive Summary: In the case we are challenged with the lofty task of enhancing the procurement process. In effort to accomplish this goal, Mars has implemented the online auction model. This is where an RFQ or request for quote is issued and suppliers make bids to satisfy the request. After adopting this model for procurement there were challenges that presented itself. The optimal solution varied, based on the conditions and constraints imposed on the model. In this exercise we had to develop strategies to determine the winner of the multi-item allocation in combinatorial auctions, with regards to the optimal policy. We also had to address the shift in market demand for Mars products. And this initiative exhibited proximity constraints, and supplier conditions were imposed. In conclusion, we found that each scenario warranted a solution, and the team had to generate a customized solution for every constraint. This exercise is a microcosm of how business works outside of academia. There isn’t a cookie cutter solution for procurement or any business process. As an executive one must be vigilant and sensitive to the changes in the market and the constraints imposed on the supply chain. Question 1 As always, we will build a base-model to understand the main thrust of the problem by relaxing some considerations (constraints). For example, for now, we will ignore the constraint of the number of winning bidders and/or maximum total winning...

Words: 1317 - Pages: 6

Premium Essay

Cost-Quality Trade Off

...of Economic Sciences, Tehran, Iran d Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran b a r t i c l e i n f o a b s t r a c t Considering the trade-offs between conflicting objectives in project scheduling problems (PSPs) is a difficult task. We propose a new multi-objective multi-mode model for solving discrete time–cost–quality trade-off problems (DTCQTPs) with preemption and generalized precedence relations. The proposed model has three unique features: (1) preemption of activities (with some restrictions as a minimum time before the first interruption, a maximum number of interruptions for each activity, and a maximum time between interruption and restarting); (2) simultaneous optimization of conflicting objectives (i.e., time, cost, and quality); and (3) generalized precedence relations between activities. These assumptions are often consistent with real-life projects. A customized, dynamic, and self-adaptive version of a multiobjective evolutionary algorithm is proposed to solve the scheduling problem. The proposed multi-objective evolutionary algorithm is...

Words: 11435 - Pages: 46

Premium Essay

Disruption Management in the Airline Industry

...Disruption Management in the Airline Industry: Dealing with the Airline Recovery Problem Andr´as Mavrocordatos e i6015437 Maastricht University School of Business and Economy Econometrics & Operations Research Master Thesis Supervisor: Tjark Vredeveld August 23, 2015 Abstract This thesis approaches the disruption management problem in the airline industry. The problem is proposed by the ROADEF 2009 Challenge and considers multiple objectives: minimize passenger disutility while maximizing revenue. Moreover, the airline operations should be back to normal after a given recovery period. The method used in this thesis is to firstly create an initial feasible schedule by focusing on different constraints and maximizing the number of passengers arriving to their destination, and secondly, to improve the schedule by using a form of Tabu Search to create and cancel routes in order to diversify the schedule. During the improvement algorithm, routes are created based on characteristics related to disrupted routes in the initial schedule, and routes are deleted based on a selective criterion related to aircraft. 1 Contents 1 Introduction 4 2 Problem Description 6 2.1 Stakeholders . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.1 Airports . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.2 Aircraft . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

Words: 15844 - Pages: 64

Premium Essay

Master in Business Management

...OPERATION RESEARCH Credits: 4 SYLLABUS Development Definition, Characteristics and phase of Scientific Method, Types of models. General methods for solving operations research models. Allocation: Introduction to linear programming formulation, graphical solution, Simplex ethod, artificial variable technique, Duality principle. Sensitivity analysis. Transportation Problem Formulation optimal solution. Unbalanced transportation problems, Degeneracy. Assignment problem, Formulation optimal solution, Variation i.e., Non-square (m x n) matrix restrictions. Sequencing Introduction, Terminology, notations and assumptions, problems with n-jobs and two machines, optimal sequence algorithm, problems with n-jobs and three machines, problems with n-jobs and m-machines, graphic solutions. Travelling salesman problem. Replacement Introduction, Replacement of items that deteriorate with time – value of money unchanging and changing, Replacement of items that fail completely. Queuing Models M.M.1 & M.M.S. system cost considerations. Theory of games introduction, Two-person zero-sum games, The Maximum –Minimax principle, Games without saddle points – Mixed Strategies, 2 x n and m x 2 Games – Graphical solutions, Dominance property, Use of L.P. to games, Algebraic solutions to rectangular games. Inventory Introduction, inventory costs, Independent demand systems: Deterministic models – Fixed order size systems – Economic order quantity (EOQ) – Single items, back ordering...

Words: 30976 - Pages: 124

Free Essay

Multi User Detection

...A project reported submitted in partial fulfillment of the requirements of the course EEL6503: Spread Spectrum and CDMA, Fall 2001 Submitted by Arun Avudainaygam LINEAR AND ADAPTIVE LINEAR MULTIUSER DETECTION IN CDMA SYSTEMS Project Website: http://arun-10.tripod.com/mud/mud.html SECTION 0 Introduction Multiuser detection is a technology that spawned in the early 80’s. It has now developed into an important, full-fledged field in multi-access communications. Multiuser Detection (MUD) is the intelligent estimation/demodulation of transmitted bits in the presence of Multiple Access Interference (MAI). MAI occurs in multi-access communication systems (CDMA/ TDMA/ FDMA) where simultaneously occurring digital streams of information interfere with each other. Conventional detectors based on the matched filter just treat the MAI as additive white gaussian noise (AWGN). However, unlike AWGN, MAI has a nice correlative structure that is quantified by the cross-correlation matrix of the signature sequences. Hence, detectors that take into account this correlation would perform better than the conventional matched filter-bank. MUD is basically the design of signal processing algorithms that run in the black box shown in figure 0.1. These algorithms take into account the correlative structure of the MAI. 0.1 Overview of the project This project investigates a couple of different approaches to linear multiuser detection in CDMA systems. Linear MUDs are detectors that...

Words: 8974 - Pages: 36

Free Essay

Modelling in Operational Research.

...Foundations of Operational Research and Business Analysis 1 Assignment 2013/14 Author: Thibaut Achard de Leluardière Abstract: Looking through the infinite number of theories and models developed in organisations, this assignment aims at finding out the founding principles of a good OR/MS model and general issues encountered in the setting-up of OR interventions. To try out and compare the insights presented, this assignment proposes to study a specific case about OR modelling in Fishery management. Fishery Management is related to the preservation of fish resources and optimisation of catch and profit of this industry, in a context of high-yield practices and increasingly more complex environmental issues present. This case applies to a large and complex system linked to today’s topics issues of sustainable development. In addition, a personal experience of analytical project related to an internship position as assistant project manager in a leading oil company is proposed to illustrate this essay. This essay concludes by giving recommendations about what could be the characteristics of an ideal portrait of OR/MS model. Introduction: In a letter addressed to English universities after the Second World War, general Pile, a popular British officer who commended the Anti-Aircraft Command, claims for men of sciences ‘able to quickly understand complex issues and to find them simple’. Thus, supporting the fast economic growth in Europe after war, operational...

Words: 4178 - Pages: 17

Premium Essay

Fajwidj Adkjwnid

...Homework 1 Q1. The SKKU company, one of social enterprise produces chairs and tables from two resources – labor and wood. The company has 80 hours of labor and 36 pounds of wood available each day. Demand for chairs is limited to 6 per day. Each chair requires 8 hours of labor and 2 pounds of wood, whereas a table requires 10 hours of labor and 6 pounds of wood. The profit derived from each chair is $400 and from each table, $100. The company wants to determine the number of chairs and tables to produce each day in order to maximize profit A. Formulate a linear programming model for this problem B. Solve the model by using computer sw. Q2. In problem 1, how much labor and wood will be unused if the optimal numbers of chairs and table produced? Q3. In problem1, explain the effect on the optimal solution of changing the profit on the table from $100 to $500. * Solve the model by using computer SW. Q4. RPR has been conducted to do survey following an election primary in New Hampshire. The firm must assign interview to conduct the survey by telephone or in person. One person can conduct 80 telephone interviews or 40 personal interviews in a single day. The following criteria have been established by the firm to ensure a representative survey: An A. Formulate a linear programming model for this problem B. Solve the linear programming model by using computer sw(Excel or DS for...

Words: 252 - Pages: 2

Premium Essay

Quantitative Business Methods

...DERY CYRIL DOMEYELLE EBA LEVEL: 300 QUANTITATIVE BUSINESS METHODS ASSIGNMENT (A) Let x = number of units of product X y = number of units of product Y z = number of units of product Z Maximize 20x + 18y + 16z (Objective function) Subject to 5x + 3y + 6z ≤ 3,000 (Machine hours constraint) 2x + 5y + 3z ≤ 2,500 (Labour hours constraint) 8x + 10y + 3z ≤ 10,000 (Materials constraint) Changing the inequalities into equalities and adding a slack variable Maximize 20x + 18y + 16z (Objective function) Subject to 5x + 3y + 6z + S1 = 3,000 2x + 5y + 3z + S2 = 2,500 8x + 10y + 3z + S3 = 10,000 Initial Simplex Tableau Solution Variables Products X Y Z Slack Variables S1 S2 S3 S1 5 3 6 1 0 0 3,000 S2 2 5 3 0 1 0 2,500 S3 8 10 3 0 0 0 10,000 Z 20 18 16 0 0 0 0 (B) Initial Simplex Tableau Solution Variables Products X Y Z Slack Variables S₁ S₂ S₃ S₁ 5 3 6 1 0 0 3,000 S₂ 2 5 3 0 ...

Words: 896 - Pages: 4

Premium Essay

How Comment Sensitive Analysis

...Yağmur GÜVEN IE-202 PROJECT PART 1 LP: Minimize 4*X121+8*X122+7*X131+14*X132+4*X211+8*X212+10*X231+20*X232+13*X241+26*X242+7*X311+14*X312+10*X321+20*X322+13*X421+26*X422+4*Y121+8*Y122+7*Y131+14*Y132+4*Y211+8*Y212+10*Y231+20*Y232+13*Y241+26*Y242+7*Y311+14*Y312+10*Y321+20*Y322+13*Y421+26*Y422 s.t. X111+X112<=0 X121+X122<=175 X131+X132<=175 X141+X142<=0 X211+X212<=175 X222+X221<=0 X231+X232<=175 X241+X242<=175 X311+X312<=175 X321+X322<=175 X331+X332<=0 X341+X342<=0 X411+X412<=0 X421+X422<=175 X431+X432<=0 X441+X442<=0 Y111+Y112<=0 Y121+X122<=175 Y131+Y132<=175 Y141+Y142<=0 Y211+Y212<=175 Y221+Y222<=0 Y231+Y232<=175 Y241+Y242<=175 Y311+Y312<=175 Y321+Y322<=56 Y331+Y332<=0 Y341+Y342<=0 Y411+Y412<=0 Y421+Y422<=175 Y431+Y432<=0 Y441+Y442<=0 (X211+X311+X411)-(Y121+Y131+Y141)>=0 (X121+X321+X421)-(Y211+Y231+Y241)>=50 (X131+X231+X431)-(Y311+Y321+Y341)>=130 (X141+X241+X341)-(Y411+Y421+Y431)>=0 (X212+X312+X412)-(Y122+Y132+Y142)>=75 (X122+X322+X422)-(Y212+Y232+Y242)>=0 (X132+X232+X432)-(Y312+Y322+Y342)>=0 (X142+X242+X342)-(Y412+Y422+Y432)>=100 Y211+Y311+Y411>=0 Y121+Y321+Y421>=75 Y131+Y231+Y431>=80 Y141+Y241+Y341>=0 Y212+Y312+Y412>=110 Y122+Y322+Y422>=0 Y132+Y232+Y432>=0 Y142+Y242+Y342>=80   |   | Son | Azaltılmış | Hedef | İzin Verilen | İzin Verilen | Hücre | Ad...

Words: 2276 - Pages: 10

Premium Essay

Optimizacion

...Solutions 56:171 Operations Research Homework #3 Solutions – Fall 2002 1. Revised Simplex Method Consider the LP problem Maximize subject to z = 3 x1 − x2 + 2 x3 x1 + x2 + x3 ≤ 15 2 x1 − x2 + x3 ≤ 2 − x1 + x2 + x3 ≤ 4 x j ≥ 0, j = 1, 2,3 a. Let x4 , x5 , &, x6 denote the slack variables for the three constraints, and write the LP with equality constraints. Answer: Maximize z = 3 x1 − x2 + 2 x3 subject to x1 + x2 + x3 + x4 = 15 2 x1 − x2 + x3 + x5 = 2 − x1 + x2 + x3 + x6 = 4 x j ≥ 0, j = 1, 2,3, 4,5, 6 After several iterations of the revised simplex method, 1 0  the basis B={4,3,2} and the basis inverse matrix is ( AB ) −1 =  0 1 2  0 − 1   2 −1   1 . 2 1   2 b. Proceed with one iteration of the revised simplex method, by i. Computing the simplex multiplier vector π Answer: 1 0 −1    B −1 0 1 1  =  0, 3 , 1  π = CB ( A ) = [0 2 −1] 2 2  2 2  0 − 1 1    2 2  = [ 0, 1.5, 0.5] ii. “pricing”, i.e., computing the “relative profits”, of the non-basic columns. Answer: 56:171 O.R. -- HW #3 Solutions Fall 2002 page 1 of 8 Solutions  1 0 0 C = [3 0 0 ] , A =  2 1 0     −1 0 1    N N N −3 −1  C = C −π A =  1 2 2  2 The relative profits for non-basic variables are C1 = 0.5 , C5 = −1.5 , C6 = −0.5 . iii. Selecting the column to enter the basis. Answer: Only the relative profit of X 1 is positive and the problem is Max problem, and so X 1 should enter the basic. iv. Computing the substitution rates of the entering column. Answer: The substitution...

Words: 2524 - Pages: 11

Premium Essay

Paper

...|Commerce | | | | | | |Honours Bachelor of Commerce (4-year) | | | | | | | | |DEGREE CHECKLIST | | |TOTAL: 120 credits | |HBComm (4yr) |Required courses (63 credits) | | |Students must obtain a minimum grade of 60% on all required courses and in each of the 21 COMM | | |credits at the 4000 level. | | |COMM 1006 E/F - Foundations of the Management of Organizations I | | |COMM 1007 E/F - Foundations...

Words: 415 - Pages: 2

Free Essay

New R Program

...R Tools for Portfolio Optimization Guy Yollin Quantitative Research Analyst Rotella Capital Management Bellevue, Washington Backgrounder Rotella Capital Management Quantitative Research Analyst Systematic CTA hedge fund trading 80+ global futures and foreign exchange markets Insightful Corporation Director of Financial Engineering Developers of S-PLUS®, S+FinMetrics®, and S+NuOPT® J.E. Moody, LLC Financial Engineer Futures Trading, Risk Management, Business Development OGI School of Engineering at Oregon Health & Science University Adjunct Instructor Statistical Computing & Financial Time Series Analysis Electro Scientific Industries, Inc Director of Engineering, Vision Products Division Machine Vision and Pattern Recognition Started Using R in 1999 R Tools for Portfolio Optimization 2 Introduction DJIA: 12/02/2008 - 04/15/2009 100 GM C 80 IBM annualized return (%) JPM 60 INTC HD DD GE PG BAC R-SIG-FINANCE QUESTION: stock price 90 40 MMM 20 KFT XOM PFE CVX JNJ VZ HPQ MCD KO UTX WMT T CAT MRK AXP BA Can I do < fill in the blank > portfolio optimization in R? MSFT DIS AA 0 IBM: 12/02/2008 - 04/15/2009 0 100 5 10 conditional value-at-risk (%) 15 20 95 80 85 Maximum Drawdown Jan Mar ANSWER: drawdown (%) IBM Underwater Graph 0 -5 P/L Distribution -10 -15 Yes! (98% confidence level) 0.12 0.14 Jan Mar 0.10 VaR 0.08 Density CVaR...

Words: 663 - Pages: 3

Free Essay

Zzzz Best

...After doing extensive researches us the research team of DooDads Inc. has determined that if we are operating at our most efficient level. The optimal level of widget production to maximize our profit will be to produce 1,763 widgets. We acquired this number by using the information we already have and creating a demand function. The steps we took to create a demand function are the following 1. Using the number of widgets demand and their prices at two intervals and finding the slope.2. Once the slope is found from these two intervals we chose one interval and plug it into the point slope form, giving us our demand function. This allows us to acquire our revenue function, which is the demand function time the number of widgets.3. We create our cost function “price per widget time number of widgets plus fixed cost”.4. Of course (revenue – cost=profit) so now all is left to do is to solve the equation. So, now we have determined from this solving this equation the optimal level of widgets sold is 1,763 however we still need to know the maximum profit. This is determined by plugging optimal level of widgets sold into the profit function; we came out with an optimal profit of $21,170.24. The average cost of each widget (1763plugged into our cost function divided by 1763) is $7.84 per widget. The average revenue per widget (21170.24/1763) is $12.01.Average profit per widget (1,763 plugged into profit function) is $4.17. Since our breakeven point ( where cost = revenue or where...

Words: 416 - Pages: 2