Dynamic Optimization with a Non-Convex Technology: The Case of a Linear Objective Function

Abstract
The paper studies the problem of optimal intertemporal allocation in an aggregative model with a non-convex technology set and a discounted sum of con

This publication has 0 references indexed in Scilit: