File: exercise_example.mod

package info (click to toggle)
coinor-ipopt 3.14.19-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 8,796 kB
  • sloc: cpp: 97,169; sh: 4,802; ansic: 2,537; java: 1,289; makefile: 821; fortran: 224; xml: 210
file content (23 lines) | stat: -rw-r--r-- 636 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
# Copyright (C) 2009, International Business Machines
#
# This file is part of the Ipopt open source package, published under
# the Eclipse Public License
#
# Author:  Andreas Waechter         IBM       2009-04-02
#
# This is the AMPL formulation of the coding example problem from the
# Ipopt tutorial

# Number of variables (this is a scalable formulation)
param n := 8;

# Definition of the variables with bounds
var x {1..n} <= 0, >= -1.5, := -0.5;

# The objective function....
minimize obj:
  sum{i in 1..n} (x[i]-1)^2;

# ... and the constraints
subject to constr {i in 2..n-1}:
  (x[i]^2+1.5*x[i]-i/n)*cos(x[i+1]) - x[i-1] = 0;