9 package org.coinor.examples.scalable;
11 import org.coinor.Ipopt;
86 public void print(
double[] x, String str)
88 System.out.println(str);
89 for(
int i = 0; i <
x.length; ++i )
90 System.out.println(
x[i]);
Number * x
Input: Starting point Output: Optimal solution.
Number Number Index m
Number of constraints.
Number Number Index Number Number Index Index Index index_style
indexing style for iRow & jCol, 0 for C style, 1 for Fortran style
Abstract class for the scalable problems.
abstract boolean initialize(int n)
In this function all problem sizes, bounds and initial guess should be initialized.
void print(double[] x, String str)
Scalable(String name, double gl, double gu)
double[] getInitialGuess()
void create()
Creates the problem based on the already computed problem sizes and bounds.