arp - 1 Automatic Recording Problem In this programming...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Automatic Recording Problem In this programming assignment, you will use linear programming to obtain an upper bound on the objective for the integer automatic recording problem (ARP). Integer ARP is as follows: maximize user satisfaction with the contents of a recorder (e.g. Tivo) over a set period of time, given a listing of overlapping programs with varying durations and value to the user. The constraints are that only one program can be recorded at once, you must record a program in its entirety, and you have a finite recording capacity. Input As input, you are given the number of programs available for recording and the capacity of the recorder. You are also given, for each program, the start time, end time, duration, and associated profit. Data You will find the data in /course/cs149/data/ARP BENCHMARK/ . Sub-directories are named ac- cording to the parameters with which the test instances were generated. For a more in-depth description of the objective types, see the end of this document....
View Full Document

Page1 / 2

arp - 1 Automatic Recording Problem In this programming...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online