1. ## Linear Programming Formulation

Hi. I need help with this formation of this problem.

A highly unethical taxi company is trying to determine the number of staff it requires to cover demand - they are most interested in keeping the number of staff to the barest of minimums to cover projected demand. They are also interested in knowing when the drivers should start work. A driver will work for 16 hours at a time which begins at the start of one of the designated shifts. The company has identified a rough demand schedule below which is broken into 8 hour segments:

3am - 11am : 2
11.01am - 7pm : 3
7.01am - 3am - 14

Formulate the problem as a linear programming problem.

Thanks

2. Originally Posted by lpd
Hi. I need help with this formation of this problem.

A highly unethical taxi company is trying to determine the number of staff it requires to cover demand - they are most interested in keeping the number of staff to the barest of minimums to cover projected demand. They are also interested in knowing when the drivers should start work. A driver will work for 16 hours at a time which begins at the start of one of the designated shifts. The company has identified a rough demand schedule below which is broken into 8 hour segments:

3am - 11am : 2
11.01am - 7pm : 3
7.01pm - 3am - 14

Formulate the problem as a linear programming problem.

Thanks
Start by identifying the variables you will use. Lets choose $x$, $y$ and $z$ being the number who start at 03:00, 11:01 and 19:01.

Then the objetive is to minimise the total number of drives:

$
Ob(x,y,z)=x+y+z
$

Now I will leave it to you to formulate the constraint/s. If you have problems then post them here with an explanation of what they are.

CB

3. Hi.

The contraints will be

x =< 2
y =< 3
z =< 14

because thats the minimum amount of demand that has to be met right?

4. Originally Posted by lpd
Hi.

The contraints will be

x =< 2
y =< 3
z =< 14

because thats the minimum amount of demand that has to be met right?
Wrong. You said the drivers work for 16 hours at a time, therefore those who start at 3am will cover the period from 3am to 11am and the one from 11am to 7pm.

Also it should be >= because the number of drivers have to cover the demand.

The constraints should then be:

z+x >= 2
x+y >= 3
y+z >= 14
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 4, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://mathhelpforum.com/advanced-applied-math/101074-linear-programming-formulation.html", "fetch_time": 1481163428000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2016-50/segments/1480698542323.80/warc/CC-MAIN-20161202170902-00362-ip-10-31-129-80.ec2.internal.warc.gz", "warc_record_offset": 176135769, "warc_record_length": 10597, "token_count": 598, "char_count": 2301, "score": 4.0625, "int_score": 4, "crawl": "CC-MAIN-2016-50", "snapshot_type": "longest", "language": "en", "language_score": 0.9496789574623108, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00009-of-00064.parquet"}