Optimal Linear Approximation in Project Compression.

Abstract

When the cost of reducing the duration of activities is convex and nonlinear, it may be advisable (to reduce the computing burden) to seek a 'satisfying answer', in which the project is compressed to a desired completion time with prespecified tolerable relative error. We treat the problem of constructing the optimal first degree interpolating linear spline that guarantees such maximal error, and consider various possible refinements. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1981
Accession Number
ADA095757

Entities

People

  • A. M. Salem
  • S. E. Elmaghraby

Organizations

  • North Carolina State University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Compression
  • Computer Programming
  • Computer Programs
  • Construction
  • Equations
  • Guarantees
  • Inequalities
  • Intervals
  • Iterations
  • Linear Programming
  • North Carolina
  • Numbers
  • Operations Research
  • Real Numbers
  • Universities

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Approximation Theory.
  • Operations Research