Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Dynamic Programming and the Smoothing Problem

Published: 01 October 1956 Publication History

Abstract

A problem in the study of production smoothing leads to the problem of minimizing a linear form \(L(x) = \sum^{N}_{i=1}c_{i}x_{i}\) subject to constraints of the type xi ≧ 0, \(\sum^{k}_{i=1}x_{i}\geqq r_{k}\). A computational solution of this problem is given, using the methods of dynamic programming.

Cited By

View all
  • (2021)Optimizing Requests for Support in Context-Restricted Autonomy2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS51168.2021.9636240(6434-6440)Online publication date: 27-Sep-2021

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Management Science
Management Science  Volume 3, Issue 1
October 1956
126 pages
ISSN:0025-1909
DOI:10.1287/mnsc.1956.3.issue-1
Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 October 1956

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Optimizing Requests for Support in Context-Restricted Autonomy2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS51168.2021.9636240(6434-6440)Online publication date: 27-Sep-2021

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media