Search results

From TomWiki
Jump to navigationJump to search

Page title matches

  • The folder will then contain about 90 test problems, of which one is <tt>cre-c.mps</tt>. To solve this problem with TO
    639 bytes (113 words) - 09:35, 12 August 2011
  • The folder will then contain about 90 test problems, of which one is <tt>blp-ic97.mps</tt>. To solve this problem with
    656 bytes (112 words) - 09:40, 12 August 2011
  • The folder will then contain about 130 test problems, of which one is <tt>liswet1.qps</tt>. To solve this problem with
    643 bytes (112 words) - 09:43, 12 August 2011
  • ...ex ''main routine. The test routines and utilities are shown in [[#Table: Test routines and utilities in non-Tomlab format.]]. It is easy to call the test routines, e.g.
    2 KB (253 words) - 14:41, 18 January 2012
  • ...''cpxKnaps ''discussed in the previous subsection. It runs three knapsack test examples. It is possible to change the cut strategy. The problems are setup ====Table: Test routines====
    1 KB (160 words) - 14:10, 21 January 2012
  • ...'main routine. The test routines and utilities are shown in [[#Table: The test routines and utilities.]]. It is easy to call the test routines, e.g.
    2 KB (282 words) - 13:25, 22 January 2012
  • ...o ''xpknaps'' discussed in the previous subsection. It runs three knapsack test examples. It is possible to change the cut strategy and whether to use the ====Table: The test routines and utilities.====
    11 KB (1,409 words) - 13:26, 22 January 2012
  • ...the ''testprob ''folder in TOMLAB. ''lgo1_prob ''contains one dimensional test problems while ''lgo2_prob ''includes two- and higher-dimensional. Several To test the solution of these problem sets with CGO, the following type of code can
    617 bytes (91 words) - 07:08, 4 March 2014
  • ...Economics and Mathematical Systems, 187, Springer Verlag, 1981, and as the test example in P. E. Gill, W. Murray, M. A. Saunders, and M. Wright: User's Gui
    3 KB (367 words) - 09:33, 8 November 2011

Page text matches

  • ==The Matlab Interface Routines - Test Routines== Test of an air-crew schedule generation problem.
    19 KB (2,722 words) - 09:45, 3 October 2011
  • ==The Matlab Interface Routines - Test Routines== Test of an air-crew schedule generation problem.
    9 KB (1,187 words) - 07:45, 6 October 2011
  • ...'is physically stored in one file, an ''Init File''. In [[#Table: Defined test problem sets in TOMLAB. probSets marked with * are not part of the standard ====Table: Defined test problem sets in TOMLAB. probSets marked with * are not part of the standard
    17 KB (2,613 words) - 10:20, 5 August 2014
  • ...Works Optimization TB. See [[TOMLAB Appendix E]] for more information and test examples. ...t a linear least squares model with linear constraints to given data. This test problem is taken from the User's Guide of ''LSSOL''.
    20 KB (3,073 words) - 10:18, 5 August 2014
  • ...Routines in Non-Tomlab Format]] and [[CPLEX Test Routines in TOMLAB Format|Test Routines in TOMLAB Format]]. All Matlab routines are described in [[CPLEX A ==Test Routines in Non-Tomlab Format==
    3 KB (476 words) - 08:52, 13 August 2011
  • ...ex ''main routine. The test routines and utilities are shown in [[#Table: Test routines and utilities in non-Tomlab format.]]. It is easy to call the test routines, e.g.
    2 KB (253 words) - 14:41, 18 January 2012
  • ...outines in Non-Tomlab Format]] and [[Xpress Test Routines in Tomlab Format|Test Routines in Tomlab Format]]. All Matlab routines are described in [[Xpress ==Test Routines in Non-Tomlab Format==
    3 KB (441 words) - 06:59, 28 September 2011
  • ...'main routine. The test routines and utilities are shown in [[#Table: The test routines and utilities.]]. It is easy to call the test routines, e.g.
    2 KB (282 words) - 13:25, 22 January 2012
  • An example of the use of the TOMLAB ''linprog'' solver to solve test problem (13) illustrates the basic usage |''testbintprog''||Test of binary programming.
    11 KB (1,502 words) - 08:29, 16 January 2012
  • *[[#Termination Test and Optimality]] shows how the solver terminates. ...feasibility. Default 0. '''NOTE''': For more information on the stopping test used in TOMLAB /KNITRO see [http://tomwiki.com/KNITRO#Termination_Test_and
    71 KB (10,810 words) - 09:18, 6 March 2019
  • ...the matrix is not presolved. The PRESOLVESTATE attribute can be used to test if the matrix is presolved or not. See also Working with Presolve. ...n the matrix is not presolved. The PRESOLVESTATE attribute can be used to test if the matrix is presolved or not. See also Working with Presolve.
    10 KB (1,648 words) - 08:54, 29 September 2011
  • If ''ask ''== 1 is set, it is easy to change the values of ''Prob.uP ''in the test problems interactively. However, if setting ''Prob.uP ''directly (needed f |align="center"|1||Final results including convergence test results and minor warnings.
    19 KB (2,996 words) - 08:34, 10 January 2012
  • ...scribe the algorithm and TOMLAB format in more detail. There are several test problem included with the TOMLAB distribution that illustrates the use. *[[#A simple example]] illustrates how to solve a simple test case.
    45 KB (6,423 words) - 12:16, 17 December 2011
  • ...now possible to replace fathoming rule '''FR3 '''applied to (''P''ˆ) by a test for feasibility of <math>(QP^k_c)</math> (replacing the bounding in branch ...P solver which establishes feasibility first and then optimizes. Thus the test of Lemma 1 comes at no extra cost. The basic integrated SQP and branch-and-
    37 KB (5,823 words) - 16:47, 19 January 2012
  • ...t illustrates the use. The following example will create and run the first test case. *[[#A GP Example]] illustrates how to solve a simple test case.
    22 KB (2,948 words) - 06:31, 29 November 2012
  • ...''cpxKnaps ''discussed in the previous subsection. It runs three knapsack test examples. It is possible to change the cut strategy. The problems are setup ====Table: Test routines====
    1 KB (160 words) - 14:10, 21 January 2012
  • ...o ''xpknaps'' discussed in the previous subsection. It runs three knapsack test examples. It is possible to change the cut strategy and whether to use the ====Table: The test routines and utilities.====
    11 KB (1,409 words) - 13:26, 22 January 2012
  • Check frequency 60 * test row residuals ||Ax - s|| ...''b'', where ''s ''is the set of slack variables. To perform the numerical test, the residual vector ''r ''= ''b - Ax ''+ ''s ''is computed. If the largest
    50 KB (7,891 words) - 11:17, 14 August 2013
  • *[[#LGO Test Examples]] provides information regarding TOMLAB /LGO test examples. ==LGO Test Examples==
    12 KB (1,770 words) - 04:56, 23 June 2015
  • *Adding a derivative convergence test =====Adding a derivative convergence test=====
    35 KB (5,139 words) - 05:35, 6 December 2011
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)