Calculus in Business By Frederic A. Palmliden December 7, 999
Optimization Linear Programming Game Theory
Optimization The quest for the best Definition of goal equilibrium: The equilibrium state is defined as the optimum position for a given economic unit and in which the said economic unit will be deliberately striving for attainment of that equilibrium.
There are always many alternatives when any kind of an economic project is to be carried out. One or more will however be more desirable.
Most common criterion in economics Maimizing Minimizing
Definition of an objective function: A function whose dependent variable represents the object of maimization or minimization and in which the set of independent variables indicates the objects whose magnitudes can be chosen with a view to optimizing.
If the first derivative of f () at a point 0 is f '( then the value 0) 0 of the function at this point will be : a relative maimum a relative minimum neither
Concept of the second derivative and higher orders derivative d n y d n
If f '( 0) 0 then the value of the function at that point will be -a relative maimum if -a relative minimum if f ( 0 f ( 0 ) 0 ) 0
A firm must choose the output level such that MC=MR R=R() total revenue function C=C() total cost function Objective function ( ) R( ) C( )
First condition for a maimum d d d 0 d ( ) R( ) C( ) 0 iff R ( ) C( ) or MR MC
Second condition d d ( ) R( ) C( ) 0 iff R( ) C( )
An objective function for a multiproduct firm ) ( ) (, ), ( z y y z y y z y z y y z y z f f f f y f z z
For a maimum For a minimum 0,, 0 y yy yy y f f f f f f f 0,, 0 y yy yy y f f f f f f f
Eample R C P 0 P 0 Note: C 4
Profit function: 0 0 0 0 4 4 P P P P C R
4 P 0 4 Solutions: P 0 4P0 P0 4P0 P, 5 5 0
Second condition: Hessian H 4 4 H 4 0 H 5 0
Linear Programming Technique that allows decision makers to solve maimization and minimization problems where there are certain constraints that limit what can be done.
The objective function is a linear function of the variables to be determined. The values of these variables must satisfy certain constraints, which are in the form of inequalities.
Production planning eample: Profit pair batch of cotton cloth finished is $.00 with process, $0.90 with process, $.0 with process 3. Process uses 3 machine-hours of finishing capacity per batch of cotton cloth processed, process uses.50 machine-hours and process 3 uses 5.5 machine-hours. Process uses 0.40 hours of labor per batch of cotton cloth processed, process uses 0.50 hours, and process 3 uses 0.35 hours. 6,000 machine-hours per week 600 hours per week
Problem: maimize Constraints: 3 0. 0.90.00 0,, 600 0.35 0.50 0.40 6,000 5.5.50 3 3 3 3
In this kind of problem the optimal solution will generally entail the use of no more processes than there are constraints. 3 0.40 3 5.5 57.4,000 3 0.35 6,000 3 600
Game Theory A game is a competitive situation in which two or more persons pursue their own interests and no person can dictate the outcome
The rules of the game A strategy A player s payoff
A Nash equilibrium is a set of strategies such that each player believes that it is doing the best it can given the strategy of the other player(s).
Selection in Dynamic Entry Games The Model i {,} N ( i) the N-stage game in which firm i is the initial leader.
Assumption A: the functions v v,, C C, are continuous on X. Assumption B: the functions v,v are strictly increasing on X. Assumption C: the functions C,C Assumption D: the functions are strictly decreasing on X. are nonincreasing on X. ( C v ),( C v)
Symmetric Firms v C v( l v C ) 0 v 3 C 3
Average cost pricing C( L ) 0
The firm s OEPP L C( n ) n n v( k ) for n,..., N
In the unique perfect equilibrium of any symmetric entry game i {,} N (i) with firm i maintains with the OEPP { N, N,..., } Total rent: N n v( n )
Firm plays In and Firm plays In its payoff is s payoff is, payoff maimized at i N i j 0 ) ( ) ( N n n i v C i N n n i v v ) ( ) ( 0 ) (, N N N i v
i N i Firm plays In and Firm enters, its total profit is C( d i ( i j i ) ) 0 N n v( n ) 0
If firm played i j plays Out, G(j) is plays In and N and its OEPP v( N ) N n v( n ) 0
Optimal choice for firm i In and N Merci beaucoup