A numerical method for a class of continuous concave programming problems

DOI10.1007/BF01585513zbMATH Open0297.90074OpenAlexW1978436330MaRDI QIDQ4051908FDOQ4051908

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Existence of an Optimal Plan in a Continuous-Time Allocation Process
• Title not available (Why is that?)
• The Existence of an Optimal Economic Policy
• An Approximate Method for Solving a Continuous Time Allocation Problem

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)