Abstract

http://ssrn.com/abstract=2362475
 


 



How to Generate Good Profit Maximization Problems


Lewis Davis


Union College - Department of Economics

December 2, 2013


Abstract:     
This paper considers the merits of two classes of profit maximization problems, those involving perfectly competitive firms with quadratic and cubic cost functions. While relatively easy to develop and solve, problems in which the firm has a quadratic cost functions are structurally too simple to address a number of important mathematical and economic issues, such as the use of second-order conditions and the short run shutdown condition. Problems based on cubic cost functions are sufficiently complex to address these issues, but the additional complexity introduces other problems. Solving such problems may involve messy arithmetic and, moreover, many cubic functions are not plausible representations of a firm’s costs. Finding cubic functions that do not suffer from these drawbacks can be a time consuming process. I address this issue by providing a simple algorithm that generates profit maximization problems that are theoretically interesting, economically plausible and computationally simple.

Number of Pages in PDF File: 15

Keywords: Profit maximization, perfect competition, intermediate microeconomics, cost functions, shutdown condition, constrained optimization, second-order condition.

JEL Classification: A22, C02, D21

working papers series





Download This Paper

Date posted: December 3, 2013  

Suggested Citation

Davis, Lewis, How to Generate Good Profit Maximization Problems (December 2, 2013). Available at SSRN: http://ssrn.com/abstract=2362475 or http://dx.doi.org/10.2139/ssrn.2362475

Contact Information

Lewis S. Davis (Contact Author)
Union College - Department of Economics ( email )
Schenectady, NY 12308-3107
United States
Feedback to SSRN


Paper statistics
Abstract Views: 288
Downloads: 52
Download Rank: 232,413

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo1 in 0.328 seconds