Seminar exercises The Product-mix Problem

Slides:



Advertisements
Similar presentations
Supply Decisions.
Advertisements

At what Q is TR maximized? How do you know this is a maximum
Linear Programming Problem
Cost and Production Chapters 6 and 7.
MVCP Exercise solving class. Capacity calculations.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Cost, revenue, profit Marginals for linear functions Break Even points Supply and Demand Equilibrium Applications with Linear Functions.
Profit-Maximization. Economic Profit u Profit maximization provides the rationale for firms to choose the feasible production plan. u Profit is the difference.
Linear Programming 1.6 (M3) p. 30 Test Friday !!.
Nonlinear Programming
Elasticity & Total Revenue Chapter 5 completion…..
Operations Management
Part 5 The Theory of Production and Cost
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Further Optimization of Economic Functions
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming Example 2 Alternate Optimal Solutions.
THE FIRM ’ S BASIC PROFIT MAXIMIZATION PROBLEM Chapter 2 slide 1 What Quantity of Output should the Firm Produce and Sell and at What Price? The Answer.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Profit. Learning Targets: Distinguish between economic and normal profit. Explain why a firm will continue even when it earns zero economic profit? Why.
Business Economics The Behavior of Firms. Assumption: Profit Maximization Problem: You have 6 acres of land and you are deciding how many acres to spray.
Quadratic Applications
A-REI Represent and solve equations and inequalities graphically
The Firm and Optimal Input Use Overheads. A neoclassical firm is an organization that controls the transformation of inputs (resources it controls) into.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
Department of Business Administration
Chapter 4: Modeling and Analysis
Linear Programming Chapter 13 Supplement.
5.3 Break-Even Analysis Chapter 32.
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
COSTS OF PRODUCTION How do producers decide how much of a good to produce?
UNIT 4 COST VOLUME PROFIT CONCEPTS AC330. Exercise 5-1 Let’s a take a minute to read Exercise 5-1 in the textbook. We will then review the solution.
Benefits, costs and income statement. Expenses x Costs Costs - financial accounting: Amount of money which the enterprise used to get benefits. - general.
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
Principles of Microeconomics : Ch.14 First Canadian Edition Perfect Competition - Price Takers u The individual firm produces such a small portion of the.
Constraint management Constraint Something that limits the performance of a process or system in achieving its goals. Categories: Market (demand side)
Capacity Planning. Capacity Capacity (I): is the upper limit on the load that an operating unit can handle. Capacity (I): is the upper limit on the load.
Warm-up Solve each system of equations:
INTRODUCTORY MATHEMATICAL ANALYSIS For Business, Economics, and the Life and Social Sciences  2011 Pearson Education, Inc. Chapter 1 Applications and.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
EXCERCISES ON BES. Compute the Break-even sales in pesos and units 1.A product line is sold at a unit selling price of P9.00. Variable cost is estimated.
@ 2012, Cengage Learning Cost Behavior and Cost-Volume-Profit Analysis LO 3a – Understanding Break-Even.
derivative bears roses A manufacturer has been selling 1000 television sets a week at $450 each. A market survey indicates that for each $10 rebate.
17-1 HANSEN & MOWEN Cost Management ACCOUNTING AND CONTROL.
1 Geometrical solution of Linear Programming Model.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Part Three: Information for decision-making Chapter Eight: Cost-volume-profit analysis.
PROFIT MAXIMIZATION. Profit Maximization  Profit =  Total Cost = Fixed Cost + Variable Cost  Fixed vs. Variable… examples?  Fixed – rent, loan payments,
DEVRY BSOP 209 Week 8 Final Exam Check this A+ tutorial guideline at exam For more classes.
Cost-Volume-Profit Analysis: A Managerial Planning Tool
Seminar exercises Product-mix decisions
AMIS 310 Foundations of Accounting
Starter What’s the story? Title: Break-Even.
AMIS 310 Foundations of Accounting
Marginal Revenue & Monopoly
Linear Programming A potter wants to make and sell serving bowls and plates. A bowl uses 5 pounds of clay. A plate uses 4 pounds of clay. The potter has.
Section 4.4 Applications to Marginality
Contribution per unit= Selling price – Direct Cost per unit
Capacity Planning.
Price Elasticity Using Coffee Example
Constraint management
A what level of production does the business start to make a profit?
Firms in Competitive Markets
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
1.6 Linear Programming Pg. 30.
Cost Volume Profit Analysis
Presentation transcript:

Seminar exercises The Product-mix Problem Agnes Kotsis

Corporate system-matrix 1.) Resource-product matrix Describes the connections between the company’s resources and products as linear and deterministic relations via coefficients of resource utilization and resource capacities. 2.) Environmental matrix (or market-matrix): Describes the minimum that we must, and maximum that we can sell on the market from each product. It also desribes the conditions.

Resource-product matrix Product types Capacities Resources Resource utilization coefficients

Contribution margin per unit (f) Environmental matrix T1 … Ti Tn MIN MAX Price (p) Contribution margin per unit (f)

Contribution margin Unit Price - Variable Costs Per Unit = Contribution Margin Per Unit Contribution Margin Per Unit x Units Sold = Product’s Contribution to Profit Contributions to Profit From All Products – Firm’s Fixed Costs = Total Firm Profit

Resource-Product Relation types Non-convertible relations E1 a11 E2 a22 E3 a32 Partially convertible relations E4 a43 a44 a45 E5 a56 a57 E6 a66 a67

Product-mix in a pottery – corporate system matrix Jug Plate Capacity 50 kg/week 100 HUF/kg 50 hrs/week 800 HUF/hr 10 kg/week Clay (kg/pcs) 1,0 0,5 Weel time (hrs/pcs) 0,5 1,0 Paint (kg/pcs) 0,1 Minimum (pcs/week) 10 Maximum (pcs/week) 100 Price (HUF/pcs) 700 1060 Contribution margin (HUF/pcs) e1: 1*T1+0,5*T2 < 50 e2: 0,5*T1+1*T2 < 50 e3: 0,1*T2 < 10 p1, p2: 10 < T1 < 100 p3, p4: 10 < T2 < 100 ofF: 200 T1+200T2=MAX 200 200

variables (amount of produced goods) Objective function refers to choosing the best element from some set of available alternatives. X*T1 + Y*T2 = max weights (depends on what we want to maximize: price, contribution margin) variables (amount of produced goods)

Solution with linear programming 33 jugs and 33 plaits a per week Contribution margin: 13 200 HUF / week T1 e1 100 ofF e3 e1: 1*T1+0,5*T2 < 50 e2: 0,5*T1+1*T2 < 50 e3: 0,1*T2 < 10 p1,p2: 10 < T1 < 100 p3, p4: 10 < T2 < 100 ofF: 200 T1+200T2=MAX 33,3 e2 100 T2 33,3

What is the product-mix, that maximizes the revenues and the contribution to profit!   T1 T2 T3 T4 T5 T6 b (hrs/y) E1 4 2 000 E2 2 1 3 000 E3 1 000 E4 3 6 000 E5 5 000 MIN (pcs/y) 100 200 50 MAX (pcs/y) 400 1100 1 000 500 1 500 2000 p (HUF/pcs) 270 30 150 f (HUF/pcs) 110 -10 20

Solution T1: T2-T3: Which one is the better product? Resource constraint 2000/4 = 500 > market constraint 400 T2-T3: Which one is the better product? Rev. max.: 270/2 < 200/1 thus T3 T3=(3000-200*2)/1=2600>1000 T2=200+1600/2=1000<1100 Contr. max.: 110/2 > 50/1 thus T2 T2=(3000-200*1)/2=1400>1100 T3=200+600/1=800<1000

T5-T6: linear programming T4: does it worth? Revenue max.: 1000/1 > 500 Contribution max.: 200 T5-T6: linear programming e1: 2*T5 + 3*T6 ≤ 6000 e2: 2*T5 + 2*T6 ≤ 5000 p1, p2: 50 ≤ T5 ≤ 1500 p3, p4: 100 ≤ T6 ≤ 2000 cfÁ: 50*T5 + 150*T6 = max cfF: 30*T5 + 20*T6 = max

T5 e1 Contr. max: T5=1500, T6=1000 Rev. max: T5=50, T6=1966 3000 e2 2500 cfF cfÁ 2000 2500 T6