Seminar exercises Product-mix decisions

Slides:



Advertisements
Similar presentations
Supply Decisions.
Advertisements

Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
At what Q is TR maximized? How do you know this is a maximum
OPSM 301 Operations Management
Planning with Linear Programming
Linear Programming Problem
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.
Elasticity & Total Revenue Chapter 5 completion…..
Operations Management
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
4.7 Optimization Problems 1.  In solving such practical problems the greatest challenge is often to convert the word problem into a mathematical optimization.
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.
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
Types of Market Structure in the Construction Industry
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.
ACTG 3020 Chapter 6 - Cost-Volume-Profit Relationships.
Seminar exercises The Product-mix Problem
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)
Chapter 6 Cost-Volume-Profit Analysis and Relevant Costing.
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.
CDAE Class 21 Nov. 6 Last class: Result of Quiz 5 6. Costs Today: 7. Profit maximization and supply Quiz 6 (chapter 6) Next class: 7. Profit maximization.
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.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
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.
ACCT 2302 Fundamentals of Accounting II Spring 2011 Lecture 18 Professor Jeff Yu.
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.
Contribution Margins. Cost-volume-profit Analysis: Calculating Contribution Margin Financial statements are used by managers to help make good business.
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.
Chapter 8: Short-Run Costs and Output Decisions. Firm’s Decisions.
Part Three: Information for decision-making Chapter Eight: Cost-volume-profit analysis Use with Management and Cost Accounting 8e by Colin Drury ISBN
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,
Chapter 17 Cost-Volume-Profit Analysis
Cost-Volume-Profit Analysis
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
Break-even point and CVP analysis
Cost-Volume-Profit Analysis: A Managerial Planning Tool
AMIS 310 Foundations of Accounting
Linear Programming Dr. T. T. Kachwala.
MBA 651 Quantitative Methods for Decision Making
WARM-UP Over the weekend, what type of decision(s) did you have to make? explain the decision(s) you made, what were the other options you had to choose.
PRODUCTION COSTS PROFIT FUNCTION COST FUNCTION P = TR – TC P = PROFITS
MANAGEMENT AND COST ACCOUNTING
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.
Profit Maximization.
Constraint management
A what level of production does the business start to make a profit?
Optimization Models Module 9.
1.6 Linear Programming Pg. 30.
Case 2:( Model Construction):
Presentation transcript:

Seminar exercises Product-mix decisions

Corporation 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 1 i n R a 11 1i 1n b 2 21 2i 2n i1 i i i n m m1 m i mn Product types Capacities Resources Resource utilization coefficients

Contribution margin per unit (CM) Rnvironmental matrix P1 … Pi Pn MIN MAX Price (p) Contribution margin per unit (CM)

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

Resource-Product Relation types Non-convertible relations R1 a11 R2 a22 R3 a32 Partially convertible relations R4 a43 a44 a45 R5 a56 a57 R6 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*P1+0,5*P2 < 50 e2: 0,5*P1+1*P2 < 50 e3: 0,1*P2 < 10 p1, p2: 10 < P1 < 100 p3, p4: 10 < P2 < 100 ofF: 200 P1+200P2=MAX 200 200

variables (amount of produced goods) Objective function refers to choosing the best element from some set of available alternatives. X*P1 + Y*P2 = 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 P1 e1 100 ofF e3 e1: 1*P1+0,5*P2 < 50 e2: 0,5*P1+1*P2 < 50 e3: 0,1*P2 < 10 p1,p2: 10 < P1 < 100 p3, p4: 10 < P2 < 100 ofF: 200 P1+200P2=MAX 33,3 e2 100 P2 33,3

What is the product-mix, that maximizes the revenues and the contribution to profit!   P1 P2 P3 P4 P5 P6 b (hrs/y) R1 4 2 000 R2 2 1 3 000 R3 1 000 R4 3 6 000 R5 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 P1: P2-P3: Which one is the better product? Resource constraint 2000/4 = 500 > market constraint 400 P2-P3: Which one is the better product? Rev. max.: 270/2 < 200/1 thus P3 P3=(3000-200*2)/1=2600>1000 P2=200+1600/2=1000<1100 Contr. max.: 110/2 > 50/1 thus P2 P2=(3000-200*1)/2=1400>1100 P3=200+600/1=800<1000

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

P5 e1 Profit max: P5=1500, P6=1000 TR max: P5=50, P6=1966 3000 e2 2500 cfF cfÁ 2000 2500 P6