-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy patharglinb.mod
30 lines (25 loc) · 884 Bytes
/
arglinb.mod
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
# AMPL Model by Hande Y. Benson
#
# Copyright (C) 2001 Princeton University
# All Rights Reserved
#
# Permission to use, copy, modify, and distribute this software and
# its documentation for any purpose and without fee is hereby
# granted, provided that the above copyright notice appear in all
# copies and that the copyright notice and this
# permission notice appear in all supporting documentation.
# Source: Problem 33 in
# J.J. More', B.S. Garbow and K.E. Hillstrom,
# "Testing Unconstrained Optimization Software",
# ACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.
# See also Buckley#93 (with different N and M)
# SIF input: Ph. Toint, Dec 1989.
# classification SUR2-AN-V-0
param N:=10;
param M:=20;
var x{1..N}:=1.0;
minimize f:
sum {i in 1..M} ( sum {j in 1..N} x[j]*i*j -1.0)^2;
solve;
display f;
display x;