# linear optimization (linear programming)

Post on 04-Jan-2016

41 views

Embed Size (px)

DESCRIPTION

Linear Optimization (Linear Programming). Terry Turner, Lecturer School of Mathematical and Statistical Sciences Arizona State University. Absolute Optimization. The domain is constrained to a closed and bounded region most of the time. - PowerPoint PPT PresentationTRANSCRIPT

PowerPoint Presentation - Deductive vs Inductive Reasoning

Terry Turner, LecturerSchool of Mathematical and Statistical SciencesArizona State UniversityLinear Optimization(Linear Programming)

Simple Interest (MAT 142)1

The domain is constrained to a closed and bounded region most of the time.Closed and bounded regions are guaranteed to have absolute extremes.We analyze the partial derivatives for extremes within the region.We analyze all paths for extremes.We identify all corner points.We evaluate everything we found.The max is the highest z-value; The min is the lowest z-value; Discard anything in between.

Absolute OptimizationSimple Interest (MAT 142)2The Basics

Simple Interest (MAT 142)3

Maximize: Subject to:Example

Find the maximum and minimum values for

Subject to:

Example

Simple Interest (MAT 142)5

A CEO invests some of his $120,000 savings in an account paying 5% annual interest and the rest in another account paying 6% annual interest. He invests at least $60,000 in the account paying 6%. The amount in the 6% account must be no more than three times the amount in the 5% account. How much must he invest in each account to maximize interest at the end of the year?

Example

Simple Interest (MAT 142)6Terry Turner, LecturerSchool of Mathematical and Statistical SciencesArizona State UniversityLinear Optimization

Simple Interest (MAT 142)7

Recommended