Elluminate - 15. * The purpose of this paper is to provide a complete characterization of the normalized restricted profit function via the conjugate.

Slides:



Advertisements
Similar presentations
Duality for linear programming. Illustration of the notion Consider an enterprise producing r items: f k = demand for the item k =1,…, r using s components:
Advertisements

Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Session II – Introduction to Linear Programming
Long Run Demand for Labor
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
General Equilibrium Theory
The Most Important Concept in Optimization (minimization)  A point is said to be an optimal solution of a unconstrained minimization if there exists no.
THE MATHEMATICS OF OPTIMIZATION
Who Wants to be an Economist? Part II Disclaimer: questions in the exam will not have this kind of multiple choice format. The type of exercises in the.
Constrained Maximization
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
5.6 Maximization and Minimization with Mixed Problem Constraints
Linear Programming Applications
Boyce/DiPrima 9th ed, Ch 11.2: Sturm-Liouville Boundary Value Problems Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
Chapter 4 The Simplex Method
THE MATHEMATICS OF OPTIMIZATION
Definition and Properties of the Cost Function
Definition and Properties of the Production Function Lecture II.
The Production Process: The Behavior of Profit-Maximizing Firms
The Production Process: The Behavior of Profit-Maximizing Firms
Applied Economics for Business Management
THE MATHEMATICS OF OPTIMIZATION
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
11. Cost minimization Econ 494 Spring 2013.
1. The Simplex Method.
The method of moments in dynamic optimization
Ch 4 THE THEORY OF PRODUCTION
1 SM1.21 Managerial Economics Welcome to session 5 Production and Cost Analysis.
Chapter 6 Linear Programming: The Simplex Method
Economics 2010 Lecture 12 Perfect Competition. Competition  Perfect Competition  Firms Choices in Perfect Competition  The Firm’s Short-Run Decision.
Lecture #9. Review Homework Set #7 Continue Production Economic Theory: product-product case.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Chapter 4 Consumer and Firm Behaviour: The Work-Leisure Decision and Profit Maximization Copyright © 2010 Pearson Education Canada.
1 Long-Run Costs and Output Decisions Chapter 9. 2 LONG-RUN COSTS AND OUTPUT DECISIONS We begin our discussion of the long run by looking at firms in.
Applied Economics for Business Management Lecture #8.
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
Lecture 7 and 8 The efficient and optimal use of natural resources.
EE/Econ 458 Duality J. McCalley.
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
Part 3 Linear Programming 3.3 Theoretical Analysis.
Chapter 3 Profit and costs1 CHAPTER 3 Profit maximisation, input demand, output supply and duality.
Frank Cowell: Microeconomics The Multi-Output Firm MICROECONOMICS Principles and Analysis Frank Cowell Almost essential Firm: Optimisation Useful, but.
Ecnomics D10-1: Lecture 11 Profit maximization and the profit function.
Econ 102 SY Lecture 7 Profit Maximization and Supply August 21, 24 and 28, 2008.
Introduction to Optimization
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
Support Vector Machine: An Introduction. (C) by Yu Hen Hu 2 Linear Hyper-plane Classifier For x in the side of o : w T x + b  0; d = +1; For.
Approximation Algorithms based on linear programming.
> > > > The Behavior of Profit-Maximizing Firms Profits and Economic Costs Short-Run Versus Long-Run Decisions The Bases of Decisions: Market Price of.
Part 3 Linear Programming 3.3 Theoretical Analysis.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
 This will explain how consumers allocate their income over many goods.  This looks at individual’s decision making when faced with limited income and.
CASE FAIR OSTER ECONOMICS P R I N C I P L E S O F
Production & Costs Continued…
PowerPoint Lectures for Principles of Economics, 9e
UNIT 6 COSTS AND PRODUCTION: LONG AND SHORT-RUN, TOTAL, FIXED AND VARIABLE COSTS, LAW OF DIMINISHING RETURNS, INCREASING, CONSTANT AND DIMINISHING RETURNS.
The Production Process: The Behavior of Profit-Maximizing Firms
Chap 9. General LP problems: Duality and Infeasibility
7 The Production Process: The Behavior of Profit-Maximizing Firms
Chapter 8. General LP Problems
Chapter 5. The Duality Theorem
Chapter 8. General LP Problems
Chapter 8. General LP Problems
7 The Production Process: The Behavior of Profit-Maximizing Firms
Presentation transcript:

Elluminate - 15

* The purpose of this paper is to provide a complete characterization of the normalized restricted profit function via the conjugate duality approach and under conditions more general than those customarily assumed in the literature. * A normalized restricted profit function is defined as the maximized value of the normalized prices of the variable commodities and the quantities of the fixed commodities. * None of the above treatments [Samuelson, Gorman, McFadden, Diewert, Jacobsen, and Shepard] is based on the conjugacy correspondence of closed, proper, convex functions.

* In addition, technological assumptions are relaxed in various directions. * First, all commodities (except one) are treated symmetrically. * There is no artificial distinction between commodities that are net outputs and commodities that are net inputs. * The theory of the normalized restricted profit function thus developed will not only accommodate normalized cost functions (all net outputs are fixed) and normalized revenue functions (all inputs are fixed) as special cases, but also all the mixed cases in between (some net outputs and some net inputs are fixed; for example, when a firm has a long-term fixed output delivery as well as material supply contracts). * Second, there is no assumptions of free disposal except for the numeriare commodity.

* Third, the assumption that the production possibilities set is a convex cone is relaxed. * It does not need to be a convex cone, or in fact, even convex. * Instead, a new assumption of biconvexity, which is weaker than convexity is introduced. * Biconvexity allows for the existence of overall increasing returns while preserving the properties of diminishing marginal rates of transformation (substitution) amongst certain subsets of commodities. * Fourth, reversibility in production is allowed in a limited sense, not all production plans are reversible, but some production plans may be reversible. * Finally, the normalized prices of commodities are allowed to be either positive, zero, or negative. Only the price of the numeriare is required to be positive.

* Rockafellar, R.T Conjugate Duality and Optimization Society for Industrial and Applied Mathematics. * Let us start with a function of the form where X and Y are arbitrary sets, and define

* Consider the economic problem where p is a vector of output prices and y is a vector of outputs (subject to a technology set) * Consider * So the profit as a function of price is the supremum of the profit function choosing the feasible combination of inputs and outputs.

* From the other side of the expression * The infemum is the minimum set of prices that will yield a given level profit subject to a specific set of netputs (y). * The work of the conjugate duality is then based on two sub- problems

* It is elementary that * And consequently

* Theorem 2: A pair (x,y) satisfies the saddle-point condition if and only if x solves the minimization problem and y solves the maximization problem, and the saddle value of K exists, i.e., one has * Compare this approach with that from Hotelling-Samuelson

* It is assumed that there are (n m) commodities. * The commodities y 1, y 2, … y n+1 are assumed to be variable, and the quantities of the last m commodities K 1, K 2, … K m are assumed to be fixed. * All prices are measured relative to the (n + 1)st commodity. The price of the (n + 1)st commodity is always one. * The normalized prices of the variable commodities are denoted y 1 *, y 2 *, … y n * ; the normalized prices for the fixed commodities are denoted K 1 *, K 2 *, … K m *. * The production possibilities set is the set of all feasible production plans. * The production function is defined by the supremum of the quantity of the (n + 1)st commodity given the quantities of all the other commodities, such that the plan is contained in the production possibilities set.

* Just a little clarity – * The set of activities can be defined as * This vector is contained in a technology set T * This technological mapping is used to define the normalized production function

* Origin: 0  T * Closure: T is closed * Convexity: T is convex * Montonticity: If then * Nonproducibility: If

* Production Function * Domain: The effective domain of F(y,K) is a convex set containing the origin F(0,0) = 0. * Closure: F(y,K) is closed in {y,K}. * Convexity: F(y,K) is convex in {y,K}. * Nonnegativity: F(y,K) is nonnegative. * The profit function maximized by the producer then becomes

* Given that y n+1 = -F(y,K), the profit function can be rewritten as * The unrestricted profit function can be written as * The conjugate duality proof results from