Assignment 1 for Nonlinear Programming | ORI 391Q, Assignments of Operational Research

Material Type: Assignment; Class: 4-INTEGER PROGRAMMING; Subject: Operations Rsch; University: University of Texas - Austin; Term: Spring 2005;

Typology: Assignments

Pre 2010

Uploaded on 08/27/2009

koofers-user-inj
koofers-user-inj 🇺🇸

5

(1)

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Nonlinear Programming (ORI 391Q)
Computer Assignment 1 (Due 2/1/05)
1) For the problem:
sin 3
min ( ) : 0 12
x
f x x
x
, write a computer program that
generates values of f(x) over the closed interval [0, 12]. Plot the points and identify
the global minimum.
2) Write a program that generates points on the boundary of the feasible region defined
by the following constraints:
(0.5x – 0.6)x ≤ 1
2x + 3x ≥ 27
0 ≤ x, x ≤ 6
Plot the feasible region.
3) For the following problem, plot the feasible region, isovalue contours of f(x), and
identify all local optima.
Minimize
subject to – 3x1 – + 0.8x2 ≤ 1.7
x1 + x2 ≤ 30
0 ≤ x1 ≤ 7, x2 ≥ 0
4) Use Jensen’s Math Programming Excel add-in to solve the nonlinear programs in
problems parts (1) and (3). In addition to the default values (x1 = x2 = 0), try three
different starting points for each problem. What are your observations? Did the add-
in find the global minima?
The Excel add-ins are also available on the PCs in the ME undergraduate computer
lab on the third floor of ETC. They can also be downloaded in compressed form
from the site: http://www.me.utexas.edu/~jensen/ORMM/
Read all the instructions for installing!
pf2

Partial preview of the text

Download Assignment 1 for Nonlinear Programming | ORI 391Q and more Assignments Operational Research in PDF only on Docsity!

Nonlinear Programming (ORI 391Q)

Computer Assignment 1 (Due 2/1/05)

  1. For the problem:

sin 3

min ( ) : 0 12

x

f x x

x

, write a computer program that

generates values of f ( x ) over the closed interval [0, 12]. Plot the points and identify

the global minimum.

  1. Write a program that generates points on the boundary of the feasible region defined

by the following constraints:

(0.5 x – 0.6)x ≤ 1

2 x + 3x ≥ 27

0 ≤ x , x ≤ 6

Plot the feasible region.

  1. For the following problem, plot the feasible region, isovalue contours of f(x), and

identify all local optima.

Minimize

subject to – 3 x

1

    • 0.8 x

2

x

1

  • x

2

0 ≤ x

1

≤ 7, x

2

  1. Use Jensen’s Math Programming Excel add-in to solve the nonlinear programs in

problems parts (1) and (3). In addition to the default values (x

1

= x

2

= 0), try three

different starting points for each problem. What are your observations? Did the add-

in find the global minima?

The Excel add-ins are also available on the PCs in the ME undergraduate computer

lab on the third floor of ETC. They can also be downloaded in compressed form

from the site: http://www.me.utexas.edu/~jensen/ORMM/

Read all the instructions for installing!

Computer Assignment 2 (Thursday, March 3)

Develop a series of computer routines that implement the following line search

algorithms:

  1. Fibonacci search
  2. Golden section
  3. Method of false position
  4. Newton’s method

You will need to specify one or more stopping criteria in each case. These should be

noted in your write-up. Test your code on the following problems.

a. Minimize f ( x ) = –ln( x ) + x

2

  • 5 x + 6 : 0 ≤ x ≤ 10

b. Minimize f ( x ) =

sin 3 x

x

: 0 ≤ x ≤ 2.

Provide the output in tables that list for each iteration k , the two end points, a k and b k , the

point or points,  k and  k , at which the measurements are being make, and the

corresponding function values, f (  k ) and f (  k ). Discuss the results and whatever insights

that you have gained from the analysis. Indicate the stopping criteria used, the number of

iterations required, and how the algorithms performed individually and in comparison to

each other. See the syllabus for instructions on preparing computer assignments.

Computer Assignment 3 (Due)