Chapter 9
1 / 32


  • Uploaded on

Chapter 9. NONLINEARITIES AND APPROXIMATION. MAD Models. Minimize the sum of absolute deviations The deviation is defined as ei = Yi - ∑X ji B j Similar to regression, except we minimize sum of the absolute values of the error term and not the sum of the squares of the error terms. .

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'NONLINEARITIES AND APPROXIMATION.' - salim

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Chapter 9

Chapter 9



Mad models
MAD Models

  • Minimize the sum of absolute deviations

  • The deviation is defined as ei = Yi - ∑XjiBj

  • Similar to regression, except we minimize sum of the absolute values of the error term and not the sum of the squares of the error terms.

Problem defined
Problem Defined

  • Minimize ∑ | ei |

  • Subject to

    • ei - ∑ Xji bj = Yi

  • The bj are the variables to be determined in the model. They can be positive or negative, as can the ei.

Need substitutions to solve
Need Substitutions to solve

  • Define ei = eipos – eineg

  • Define bj = bjpos – bjneg

  • If we replace these in the formulation, we can solve these. Remembering that the absolute value is always a positive number, we have an objective function that sums up over all eipos + eineg.

Example from book
Example from Book

Predict the price based on quantity of oranges

and quantity of juice sold.

Orange price model
Orange Price Model

  • Pricei = Bo + B1QOrangesi + B2QJuicei + e i

  • The ei can be positive or negative, as can the Bj.

  • Decision variables are the Bj and the ei which are determined by the choice of the Bj.

  • Because I minimize the sum of absolute values, I must define two error terms for each observation, the positive and the negative.

The lp from this problem
The LP from this Problem

Here, I've let the Bj be unrestricted in sign,

because Solver will let me do that. I could

add more columns and define negative Bj.


  • Minimize the biggest absolute deviation from the line.

  • This can be accomplished by using inequality constraints and one e.

  • Yi - ∑XjiBj ≤ e (if max e is positive)

  • ∑XjiBj – Yi ≤ e (if max e is negative)

  • Rewrite these so that Yi is on the RHS and e is on the left.

  • Resolve our orange example, but restrict b1 to be non-positive and b2 to be non-negative.

Optimizing a fraction
Optimizing a Fraction

McCarl and Spreen Section 9.1.3

Type of problem
Type of Problem

Co + CjXj


do + djXj

S.T. aijXj le bi

Xj ge 0 and the denominator strictly positive

Define some new variables
Define Some New Variables

Yo = [do +djXj]-1

Yj = YoXj

(Xj = Yj/Yo)

Do some math and
Do Some Math And . . .

Max CoYo + CjYj

s.t. -biYo + aijYj le 0

doYo + djYj = 1

Yo, Yj GE 0

Solve this and do the reverse

transformation to get the X values

Example problem
Example Problem

1.8 X1 + 1.7 X2


10 + 4X1 + 4.1 X2

s.t. 1.5X1 + X2 le 6

3.0X1 + 4X2 le 20

X1, X2 ge 0


Max 1.8 Y1 + 1.7Y2

s.t -6Yo + 1.5Y1 + Y2 le 0

-20Yo + 3Y1 + 4Y2 le 0

10Yo + 4Y1 + 4.1Y2 = 1

Yo, Y1, Y2 ge 0


X1 = Y1/Yo = 1 1/3

X2 = Y2/Yo = 4

Separable programming
Separable Programming

In some cases, the level of return to an

activity is not constant as the activity level

increases. Because of the law of diminishing

returns, returns to additional units of an

enterprise often decrease as more units

are added.

Diminishing returns
Diminishing Returns





level of activity j

Linear approximation
Linear Approximation






level of activity j

Modeling this situation
Modeling this Situation

Max Profit = R1X1 + R2X2 + R3X3


X2 LE (B-A)

And X2 and X3 use the same (or higher) levels

of all resources. Because R1 > R2 > R3, X1

will enter solution to its full level A before X2 is

selected and so on.


Totals: A-635; B-100, C-50

Alternative method
Alternative Method

This method of solving separable programming

is sometimes called the "delta method."

An alternative, presented in McCarl and

Spreen chapter 9, is sometimes called the

"lambda method" or "grid point approximation."

Mccarl and spreen
McCarl and Spreen

McCarl and Spreen present a different

application of the gridpoint method in

chapter 9, section 2.1. Also, they

show you how to extend this method

to functions of more than one variable.

The more complicated material won't

appear on the final but you may want

to read it on your own.

Using integers to approximate nonlinear functions
Using Integers to Approximate Nonlinear Functions

McCarl and Spreen, 15.1.6

We will come back to this

material. If you have already

seen integer programming, you

may want to look at it now.

Some functions
Some Functions

Some functions cannot be approximated

using the delta or lambda methods

because the more "attractive" section

of the function takes place at larger

numbers. If, for example, unit

profits increase as output increases or

costs (in a cost min) decrease as a variable

gets larger, those techniques don't work.

Modifying the lambda method
Modifying the Lambda Method

for a max, P0<P1<P1<P3

The Zi are 0-1 integers

An example
An Example

Modification of our original 3 product

situation so that the profit from A

increases as output goes up.

Without integers
Without Integers

We are skipping the intermediate steps.

Profit from 635 units of A is $6200, not

$6254.7 as it would appear from this answer.

With the integer constraints
With the Integer Constraints

Profit from the first activity is now calculated