A computational method for the maximization of long-run and short-run profit

DOI10.1016/j.amc.2006.08.037zbMath1128.90035OpenAlexW1968902967MaRDI QIDQ884556

N. E. Zubov

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.037

zbMATH Keywords

optimizationsensitivity analysisprofitgeometric programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Marketing, advertising (90B60)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
• Shortfall as a risk measure: properties, optimization and applications
• Innovations, improvements, and the optimal adoption of new technologies
• Computing the steady state of linear quadratic optimization models with rational expectations
• Note—A Note on “Substitution Effects in Geometric Programming”
• The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
• Solving posynomial geometric programming problems via generalized linear programming

This page was built for publication: A computational method for the maximization of long-run and short-run profit