9 package org.coinor.examples.scalable;
11 import java.util.HashMap;
21 public static void main(String[] args)
23 HashMap<String, Scalable> list =
new HashMap<String, Scalable>();
26 list.put(
"LukVlE1",
new LuksanVlcek1(
"LukVlE1", 0.0, 0.0));
27 list.put(
"LukVlI1",
new LuksanVlcek1(
"LukVlI1", -1.0, 0.0));
31 System.out.println(
"Usage: ProblemName N\n");
32 System.out.println(
" - N is a positive parameter determining problem size");
33 System.out.println(
" - ProblemName is one of:");
36 System.out.println(
" " + s);
41 String problem = args[0];
42 int n = Integer.parseInt(args[1]);
44 System.out.println(
"Solving problem " + problem +
" for N=" + n);
49 System.out.println(
"Problem not found!");
62 case Ipopt.SOLVE_SUCCEEDED:
63 case Ipopt.ACCEPTABLE_LEVEL:
64 System.out.println(
"Solution found.");
67 System.out.println(
"** Could not solve problem " + problem +
" for N=" + n +
", status: " + p.
getStatus());
static void main(String[] args)
Implementation of Example 5.1 from "Sparse and Parially Separable Test Problems for Unconstrained and...
Abstract class for the scalable problems.
Copyright (C) 2007 VRTech Industrial Technologies - www.vrtech.com.br.
abstract boolean initialize(int n)
In this function all problem sizes, bounds and initial guess should be initialized.
int OptimizeNLP()
This function actually solve the problem.
int getStatus()
Gives Ipopt status of last OptimizeNLP call.
Class for running several different Scalable problems.
A Java Native Interface for the Ipopt optimization solver.
void create()
Creates the problem based on the already computed problem sizes and bounds.