A numerical method for a class of continuous concave programming problems

DOI10.1007/BF01585513MaRDI QIDQ4051908zbMATH OpenOpenAlexFDO

Authors Jaromir Abrham, Livingstone S. Luboobi

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585513

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites work

• An Approximate Method for Solving a Continuous Time Allocation Problem
• scientific article; zbMATH DE number 3208389 (Why is no real title available?)
• scientific article; zbMATH DE number 3223774 (Why is no real title available?)
• scientific article; zbMATH DE number 3225772 (Why is no real title available?)
• On the Existence of an Optimal Plan in a Continuous-Time Allocation Process
• The Existence of an Optimal Economic Policy

Cited in

(2)

• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Continuous-time Programming

This page was built for publication: A numerical method for a class of continuous concave programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051908)