Chapter 5 Section 2

# Chapter 5 Section 2 - 5.2 Linear Programming in two...

This preview shows pages 1–4. Sign up to view the full content.

5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear inequalities.

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

View Full Document
A familiar example We have seen this problem before. An extra condition will be added to make the example more interesting. Suppose a manufacturer makes two types of skis: a trick ski and a slalom ski. Suppose each trick ski requires 8 hours of design work and 4 hours of finishing. Each slalom ski 8 hours of design and 12 hours of finishing. Furthermore, the total number of hours allocated for design work is 160 and the total available hours for finishing work is 180 hours. Finally, the number of trick skis produced must be less than or equal to 15. How many trick skis and how many slalom skis can be made under these conditions? Now, here is the twist: Suppose the profit on each trick ski is \$5 and the profit for each slalom ski is \$10. How many each of each type of ski should the manufacturer produce to earn the greatest profit?
Linear Programming problem This is an example of a linear programming problem. Every linear programming problem has two components: 1. A linear objective function is to be maximized or minimized. In our case the objective function is Profit = 5x + 10y ( 5 dollars profit for each trick ski manufactured and \$10 for every slalom ski produced). 2.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 12

Chapter 5 Section 2 - 5.2 Linear Programming in two...

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

View Full Document
Ask a homework question - tutors are online
{"found_math": false, "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": 0, "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": "https://www.coursehero.com/file/35419/Chapter-5-Section-2/", "fetch_time": 1513094857000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-51/segments/1512948517350.12/warc/CC-MAIN-20171212153808-20171212173808-00261.warc.gz", "warc_record_offset": 695727800, "warc_record_length": 130681, "token_count": 453, "char_count": 2023, "score": 3.890625, "int_score": 4, "crawl": "CC-MAIN-2017-51", "snapshot_type": "latest", "language": "en", "language_score": 0.904893159866333, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00063-of-00064.parquet"}