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 TO639 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 with656 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 with643 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 can617 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 Gui3 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 standard17 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_and71 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 largest50 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
- ...hWorks Optimization TB. See [[TOMLAB Appendix E]] for more information and test examples. The test examples and output files are part of the standard distribution of TOMLAB,18 KB (2,433 words) - 14:07, 14 January 2012
- ...re problems can be found. Many of these are quite large and may be good as test cases for benchmarking. A package of about 250 MB with mixed LP/MILP are al ...al linear programming test problems: lp_prob|Additional linear programming test problems: lp_prob]]4 KB (591 words) - 09:32, 12 August 2011
- ...oes not utilize information about derivatives. To define the ''Shekel 5 ''test problem in a routine ''glb1_f'', the following statements are needed To solve the ''Shekel 5 ''test problem define the following statements, available as ''glb1Demo ''in ''gl8 KB (1,284 words) - 14:09, 14 January 2012
- ...n solvers MINOS and QPOPT, available in TOMLAB v4.0, are compared. In all test cases the solvers converge to the same solution. The results are presented ...generated medium size LP problems for four different routines.]] a similar test is shown, running 20 problems with about 100 variables and 50 inequality co19 KB (1,748 words) - 10:57, 14 January 2012
- Test of TOMLAB /CPLEX level 1 interface solving three larger binary integer lin ...binary integer linear optimization problems calling the CPLEX solver. The test problem 1 and 2 have 1956 variables, 23 equalities and four inequalities wi2 KB (328 words) - 13:02, 15 August 2011
- Check frequency 60 * test row residuals ||Ax - s|| ...''= 0, where ''s ''is the set of slack variables. To perform the numerical test, the residual vector ''r ''= ''s - Ax ''is computed. If the largest compone84 KB (13,939 words) - 14:15, 22 January 2012
- ...O Test Examples]] provides information regarding (non-costly) TOMLAB /CGO test examples. ==TOMLAB /CGO Test Examples==2 KB (343 words) - 10:57, 18 June 2014
- ...mization environment. TOMLAB gives easy access to a large set of standard test problems, optimization solvers and utilities. Contains examples on the process of defining problems and solving them. All test examples are available as part of the TOMLAB distribution.12 KB (1,741 words) - 08:59, 13 August 2011
- 0: Perform tests for sparsity pattern and test that the derivatives appear to be ok. This is the default. ...uous. The test is much more expensive and should only be used of the cheap test does not find an error but one is expected to exist.27 KB (4,279 words) - 11:21, 17 December 2011
- In <tt>glb_prob</tt> there are 51 unconstrained global optimization test problems with sizes to 100 variables. In order to define the problem n and In <tt>glo1_prob</tt> there are 30 global optimization test problems in one dimension. In order to define the problem n and solve it e3 KB (429 words) - 13:55, 22 January 2012
- ...''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 com ...for. If the objective is scaled down to be very ''small'', the optimality test reduces to comparing ''d<sub>j</sub> ''against ''t''.17 KB (2,798 words) - 09:36, 14 August 2013
- ...t is larger than this tolerance, the point is classified infeasible. This test is made because points returned by NLP solvers may occasionally be infeasi ...n the first stage of the algorithm. If trial points are rejected by this test for more than WAITCYCLE consecutive iterations, the threshold is increased51 KB (7,906 words) - 11:59, 22 January 2012
- * Some Matlab test routines are included, described in Section [[GUROBI Appendix A#gurobi]] (n ==Appendix B - The Matlab Interface Routines - Test Routines==2 KB (261 words) - 04:11, 4 October 2011
- The TOMLAB bundle testprob provides three sets of test problems for (constrained) nonlinear least squares: <tt>cls_prob</tt>, <t <tt>cls_prob</tt> consists of 45 constrained nonlinear least squares test problems with up to 14 variables and a mixture of linear and nonlinear cons3 KB (473 words) - 11:30, 21 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 can617 bytes (91 words) - 07:08, 4 March 2014
- ...h to these files are always given in the text. Throughout this section the test problem ''Rosenbrock's banana'', ...'σ'' = 0''.''9, the value must be set slightly different to fool the test:24 KB (3,672 words) - 14:09, 14 January 2012
- ...as optimum: ''norm(xk - xOpt(:, i))'' <= ''xEqTol * max(1, norm(xk))'' If test fulfilled x_k is assumed to be too close to xOpt(:,i) Default xEqTol = 1E-5 |||''xOpt''||Prob.N x k matrix with k distinct local optima, the test being ''norm''(''xk -xOpt''(:'', i'')) ''<''= ''xEqTol * max''(1'', norm''(8 KB (1,215 words) - 10:16, 9 March 2015
- The TOMLAB bundle testprob provides three sets of test problems for nonlinear problems: <tt>con_prob</tt> and <tt>chs_prob</tt>. <tt>con_prob</tt> is a collection of 17 constrained nonlinear test problems with 2 to 100 variables and up to 50 constrains. In order to defin3 KB (549 words) - 18:52, 17 January 2012
- ==The Matlab Interface Routines - Test Routines==902 bytes (77 words) - 12:21, 15 August 2011
- Test of an air-crew schedule generation problem. ...eate ToDs, i.e. Tours of Duty. The function ''sectordata ''generates some test data.840 bytes (115 words) - 12:27, 15 August 2011
- Test of the TOMLAB /CPLEX level 1 interface solving three larger integer linear ...larger integer linear optimization problems calling the CPLEX solver. The test problems have 61 variables and 138 linear inequalities. 32 of the 138 ineq2 KB (259 words) - 05:18, 16 August 2011
- CPLEX Matlab Level 1 interface Knapsack test routine ...CPLEX Matlab level 1 interface knapsack test routine runs three different test problems. It is possible to change cut strategy and use heuristics defined1 KB (130 words) - 05:54, 16 August 2011
- CPLEX Matlab Level 2 interface Knapsack test routine ...CPLEX Matlab level 2 interface knapsack test routine runs three different test problems. It is possible to change cut strategy.1,005 bytes (124 words) - 06:00, 16 August 2011
- Simple test of calling CPLEX Matlab level 1 interface to solve a QP problem. Simple test of calling CPLEX Matlab level 1 interface to solve a QP or MIQP problem. Th1 KB (190 words) - 08:06, 16 August 2011
- To compile the following code, in ''test.m''. function f = test25 KB (3,973 words) - 12:05, 21 January 2012
- Simple test of calling CPLEX Matlab level 1 interface to solve a mixed integer quadrati Simple test of MIQP problem running CPLEX . The problem is defined as1 KB (186 words) - 08:13, 16 August 2011
- Run big test to check for bugs in TOMLAB. |''solvTypes''||A vector of numbers defining which ''solvType ''to test.576 bytes (74 words) - 10:56, 22 July 2011
- The test used is of the form Begin t6wood (WOPLANT test problem; optimal obj = -15.55716)50 KB (7,860 words) - 06:38, 7 September 2011
- In <tt>miqq_prob</tt> there are 14 mixed-integer quadratic programming test problems with quadratic constraints with sizes to 10 variables and 8 const Name = 'MIQQ Test Problem 1';2 KB (351 words) - 18:52, 17 January 2012
- ...=1).<br>Only possible if ''globalSolver'' = ''multiMin'' or glcDirect. <br>Test for additional minimum in local step (modN == N)<br>modN = -2,-3,-4,... a |''eps_sn''||Relative tolerance used to test if the minimum of surface, ''min_sn'', is sufficiently lower than the best14 KB (2,236 words) - 17:15, 21 June 2014
