Search results

Page title matches

• Models Additional linear programming test problems: lp prob
  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
• Models Additional mixed-integer linear programming test problems: milp prob
  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
• Models Additional quadratic programming test problems: qp prob
  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
• CPLEX Test Routines in Non-Tomlab Format
  ...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
• CPLEX Test Routines in TOMLAB Format
  ...''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
• Xpress Test Routines in Non-Tomlab Format
  ...'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
• Xpress Test Routines in Tomlab Format
  ...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
• CGO Test Examples
  ...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
• TomSym Area of Hexagon Test Problem
  ...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

• Xpress Appendix C
  ==The Matlab Interface Routines - Test Routines== Test of an air-crew schedule generation problem.
  19 KB (2,722 words) - 09:45, 3 October 2011
• GUROBI Appendix B
  ==The Matlab Interface Routines - Test Routines== Test of an air-crew schedule generation problem.
  9 KB (1,187 words) - 07:45, 6 October 2011
• TOMLAB Overall Design
  ...'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
• TOMLAB Solving Least Squares and Parameter Estimation Problems
  ...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
• CPLEX
  ...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
• CPLEX Test Routines in Non-Tomlab Format
  ...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
• Xpress
  ...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
• Xpress Test Routines in Non-Tomlab Format
  ...'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
• TOMLAB Appendix E
  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
• KNITRO
  *[[#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
• Xpress xpProblemAttrib
  ...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
• TOMLAB Special Notes and Features
  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
• GENO
  ...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
• MINLP Algorithmic description
  ...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
• GP
  ...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
• CPLEX Test Routines in TOMLAB Format
  ...''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
• Xpress Test Routines in Tomlab Format
  ...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
• SNOPT Optional parameters
  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
  *[[#LGO Test Examples]] provides information regarding TOMLAB /LGO test examples. ==LGO Test Examples==
  12 KB (1,770 words) - 04:56, 23 June 2015
• MAD Advanced Use of Forward Mode for First Derivatives
  *Adding a derivative convergence test =====Adding a derivative convergence test=====
  35 KB (5,139 words) - 05:35, 6 December 2011
• TOMLAB Solving Linear Quadratic and Integer Programming Problems
  ...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
• Models
  ...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
• TOMLAB Solving Global Optimization Problems
  ...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 ''gl
  8 KB (1,284 words) - 14:09, 14 January 2012
• TOMLAB Appendix G
  ...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 co
  19 KB (1,748 words) - 10:57, 14 January 2012
• CPLEX cpxbiptest
  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 wi
  2 KB (328 words) - 13:02, 15 August 2011
• SQOPT
  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 compone
  84 KB (13,939 words) - 14:15, 22 January 2012
• CGO
  ...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
• TOMLAB
  ...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
• CONOPT
  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
• Models Global Optimization Problems: glb prob, lgo1 prob, lgo2 prob and gkls prob
  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 e
  3 KB (429 words) - 13:55, 22 January 2012
• MINOS Solver Options
  ...''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_j ''against ''t''.
  17 KB (2,798 words) - 09:36, 14 August 2013
• OQNLP
  ...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 increased
  51 KB (7,906 words) - 11:59, 22 January 2012
• GUROBI
  * 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
• Models (Constrained) Nonlinear Least Squares Problems: cls prob, mgh prob and ls prob
  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 cons
  3 KB (473 words) - 11:30, 21 January 2012
• CGO Test Examples
  ...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
• TOMLAB Solving Unconstrained and Constrained Optimization Problems
  ...h to these files are always given in the text. Throughout this section the test problem ''Rosenbrock's banana'', ...'&sigma;'' = 0''.''9, the value must be set slightly different to fool the test:
  24 KB (3,672 words) - 14:09, 14 January 2012
• MultiMin
  ...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
• Models Nonlinear Programming Problems: con prob and chs prob
  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 defin
  3 KB (549 words) - 18:52, 17 January 2012
• CPLEX Appendix C
  ==The Matlab Interface Routines - Test Routines==
  902 bytes (77 words) - 12:21, 15 August 2011
• CPLEX cpxaircrew
  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
• CPLEX cpxiptest
  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 ineq
  2 KB (259 words) - 05:18, 16 August 2011
• CPLEX cpxKnaps
  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 defined
  1 KB (130 words) - 05:54, 16 August 2011
• CPLEX cpxKnapsTL
  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
• CPLEX cpxTestQP1
  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. Th
  1 KB (190 words) - 08:06, 16 August 2011
• SAL
  To compile the following code, in ''test.m''. function f = test
  25 KB (3,973 words) - 12:05, 21 January 2012
• CPLEX cpxTestQP2
  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 as
  1 KB (186 words) - 08:13, 16 August 2011
• Systest
  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
• MINOS File Output
  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
• Models Mixed-Integer Quadratic Programming Problems with Quadratic Constraints: miqq prob
  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
• CGO rbfSolve
  ...=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 best
  14 KB (2,236 words) - 17:15, 21 June 2014
• Models Linear Least Squares Problems: lls prob
  In <tt>lls_prob</tt> there are two linear least squares test problems with about 10 variables and a few constraints. In order to define Name='LSSOL test example'; % Problem name, not required.
  3 KB (368 words) - 18:53, 17 January 2012
• Xpress Installation
  ...n play around with. If TOMLAB is installed, to run a first test using the test examples in the TOMLAB distribution, files in ''\''tomlab''\''testprob, r
  877 bytes (145 words) - 08:12, 28 September 2011
• Models Constrained Goal Attainment Problems: goals prob and mco prob
  ...</tt> there are 9 Multi-Criterium unconstrained and constrained nonlinear test problems with up to 10 variables and few constrains. In order to define th In <tt>goals_prob</tt> there are 9 constrained goal attainment test problems with sizes to 9 variables and about 10 constrains. In order t
  3 KB (444 words) - 18:55, 17 January 2012
• TomSym Examples
  *[[TomSym Area of Hexagon Test Problem|Area of Hexagon Test Problem]]
  6 KB (776 words) - 17:03, 2 November 2011
• CPLEX cpxtomtest1
  Test of using TOMLAB to call CPLEX for problems defined in the TOMLAB IF forma Test of using TOMLAB to call CPLEX for problems defined in the TOMLAB IF forma
  426 bytes (64 words) - 05:27, 16 August 2011
• TomSym Area of Hexagon Test Problem
  ...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
• CPLEX cpxtomtest2
  Test of using TOMLAB to call CPLEX for problems defined in the TOMLAB TQ forma Test of using TOMLAB to call CPLEX for problems defined in the TOMLAB TQ forma
  641 bytes (97 words) - 05:29, 16 August 2011
• CGO solver usage
  Let the name of the problem be "CGOF Test" Prob = glcAssign('CGOF',x_L,x_U,'CGOF Test',A,b_L,b_U,'CGOC',c_L,c_U);
  5 KB (687 words) - 11:39, 20 June 2014
• CPLEX cpxTest1
  Test routine 1, calls CPLEX Matlab level 1 interface to solve a GAP problem. Running a generalized assignment problem (GAP) from Wolsey. In this test the linear sos1 constraints are defined explicitly.
  921 bytes (131 words) - 07:03, 16 August 2011
• CPLEX cpxTest2
  Test routine 2, calls CPLEX Matlab level 1 interface to solve a GAP problem. Running a generalized assignment problem (GAP) from Wolsey. In this test sos1 variables are used.
  935 bytes (134 words) - 07:40, 16 August 2011
• CPLEX cpxTest3
  Test routine 3, calls CPLEX Matlab level 1 interface to solve a GAP problem. ...eralized assignment problem (GAP) from Wolsey [1, 9.6, pp159]. In this test the linear sos1 constraints are defined explicitly.
  965 bytes (137 words) - 07:42, 16 August 2011
• TOMLAB Introduction
  ...mization environment. TOMLAB gives easy access to a large set of standard test problems, optimization solvers and utilities.
  8 KB (1,125 words) - 09:50, 15 July 2011
• PROPT
  ...ble of. The implementation of the extensive example library (more then 100 test cases are included) has eliminated most bugs, but there may still be a few
  26 KB (4,044 words) - 03:27, 7 August 2014
• Quickguide PIECE-WISE LINEAR Problem
  The following file defines a test case in TOMLAB. It is possible to use two syntax variations when defining t
  1 KB (226 words) - 18:35, 17 January 2012
• Models Mining and Processing
  % some test drillings the mine has been subdivided into exploitation units
  31 KB (3,682 words) - 18:56, 17 January 2012
• TOMLAB Approximation of Derivatives
  ...according to the MAD requirements and restrictions. Some of the predefined test problems in TOMLAB do not fulfill those requirements.
  25 KB (3,687 words) - 08:35, 16 January 2012
• Xpress Callbacks in Matlab
  ...f the standard Xpress^''MP'' example files. Running the knapsack test program ''xpknaps'', with the second input argument ''Run ''= 1 runs the kn
  4 KB (571 words) - 13:22, 22 January 2012
• Models Linear Programming Problems: lp prob
  In <tt>lp_prob</tt> there are 54 linear programming test problems with sizes to nearly 700 variables and 500 constraints. In order t
  3 KB (421 words) - 18:51, 17 January 2012
• Models Timetabling
  % undergone a test of her productivity on every machine. The table
  26 KB (3,338 words) - 19:01, 17 January 2012
• TOMLAB Utility Functions
  Run big test to check for bugs in TOMLAB.
  2 KB (290 words) - 08:04, 22 July 2011
• CGO arbfMIP
  |''eps_sn''||Relative tolerance used to test if the minimum of surface, ''min_sn'', is sufficiently lower than the best
  14 KB (2,111 words) - 17:16, 21 June 2014
• Models Mixed-Integer Linear Programming Problems: mip prob
  In <tt>mip_prob</tt> there are 47 mixed-integer linear test problems with sizes to nearly 1100 variables and nearly 1200 constraints. I
  3 KB (447 words) - 18:51, 17 January 2012
• Models Additional linear programming test problems: lp prob
  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
• MultiMINLP
  |||''xOpt''||Prob.N x k matrix with k distinct local optima, the test being norm(x k- xOpt(:,i)) ''<''= xEqTol*max(1,norm(x k)) that if fulfilled
  6 KB (938 words) - 10:16, 9 March 2015
• CGO rbfSolve description
  ...of ''sn ''is not one of the interpolation points or too close to one. The test used is
  27 KB (4,827 words) - 07:10, 4 March 2014
• Models Quadratic Programming Problems: qp prob
  In <tt>qp_prob</tt> there are 41 quadratic programming test problems with sizes to nearly 1200 variables and nearly 500 constraints. In
  3 KB (442 words) - 18:51, 17 January 2012
• Models Additional mixed-integer linear programming test problems: milp prob
  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
• Quickguide MIQQ Problem
  Name = 'MIQQ Test Problem 1';
  2 KB (324 words) - 07:48, 17 January 2012
• MINLP Solver Reference
  ....var) identifies this information sos1(1).prio sets the priority for sos1 test 1.
  65 KB (9,880 words) - 10:07, 13 August 2013
• Models Mixed-Integer Quadratic Programming Problems: mipq prob
  In <tt>mipq_prob</tt> there are 4 mixed-integer quadratic programming test problems with sizes to about 120 variables and slightly more than 100 const
  2 KB (306 words) - 18:52, 17 January 2012
• Models Additional quadratic programming test problems: qp prob
  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
• Quickguide LLS Problem
  Name='LSSOL test example'; % Problem name, not required.
  2 KB (331 words) - 07:50, 17 January 2012
• PROPT Jumbo Crane Container Control
  % Test 300 points, evenly spaced in time.
  7 KB (875 words) - 05:21, 14 February 2012
• Models Mixed-Integer Nonlinear Programming Problems: minlp prob
  In <tt>minlp_prob</tt> there are 14 mixed-integer nonlinear programming test problems with sizes to nearly 50 variables and nearly 50 constraints. In or
  4 KB (558 words) - 18:53, 17 January 2012
• CPLEX cpxSolutionPool
  Test of TOMLAB /CPLEX solution pool capabilities.
  380 bytes (48 words) - 06:20, 16 August 2011
• Quickguide MILLS Problem
  Name='MILLS test example'; % Problem name, not required.
  2 KB (326 words) - 07:50, 17 January 2012
• TomSym Assigning Personnel to Machines
  ...n a workshop. Six workers have been pre-selected. Everyone has undergone a test of her productivity on every machine. The table below lists the productivit
  5 KB (600 words) - 09:32, 8 November 2011
• Models Constrained Global Optimization Problems: glc prob
  In glc_prob there are 30 global mixed-integer nonlinear programming test problems with sizes to 20 variables and 5 constrains. In order to define t
  3 KB (390 words) - 18:54, 17 January 2012
• CPLEX cpxSolverTuning
  Test of TOMLAB /CPLEX solver tuning capabilities.
  394 bytes (48 words) - 06:22, 16 August 2011
• Quickguide MINIMAXLIN Problem
  Name = 'Linear Minimax Test 1';
  2 KB (320 words) - 18:06, 17 January 2012
• TomSym Opencast Mining
  An opencast uranium mine is being prospected. Based on the results of some test drillings the mine has been subdivided into exploitation units called block
  5 KB (657 words) - 09:34, 8 November 2011
• Models Unconstrained Optimization: uc prob and uhs prob
  The TOMLAB bundle testprob provides two sets of test problems for unconstrained optimization problems (with simple bounds): <tt
  1 KB (200 words) - 13:08, 8 December 2011
• CPLEX Appendix E
  A test routines that illustrates a simple problem is included in the TOMLAB distri
  10 KB (1,650 words) - 07:51, 13 December 2011
• Quickguide L1LIN Problem
  Name='L1LinSolve test example'; % Problem name, not required.
  2 KB (320 words) - 18:12, 17 January 2012
• MAD
  ...ctionality added as demanded; so allowing for carefully testing on user's test cases before widespread release.
  10 KB (1,449 words) - 06:43, 1 December 2011
• Models Linear Semi-Definite Programming Problem with Linear Matrix Inequalities: sdp prob
  In <tt>sdp_prob</tt> there is 1 linear semi-definite programming test problem with linear matrix inequalities with 3 variables. In order to d
  2 KB (335 words) - 18:54, 17 January 2012
• XA Solver Reference
  | | Expensive Dual Test
  59 KB (8,573 words) - 06:05, 15 December 2010
• SOL Using the SOL Solvers in TOMLAB
  ...he GUI to solve the particular user problem, it might be useful to run the test problems defined in TOMLAB to learn how to use the SOL solvers in the most
  12 KB (1,924 words) - 13:09, 22 January 2012
• Quickguide QPBLOCK Problem
  The following file defines a test case in TOMLAB.
  4 KB (508 words) - 18:34, 17 January 2012
• TomSym compared to the Symbolic Toolbox
  Each test was run 5 times, and the mean of the middle 3 is listed in the table below.
  10 KB (1,465 words) - 08:34, 21 January 2015
• Models Geometric programming problems: gp prob
  In <tt>gp_prob</tt> there are 14 geometric programming test problems with sizes to 12 variables and about 10 constrains. In order to de
  2 KB (269 words) - 18:55, 17 January 2012
• Quickguide
  ...applies to smaller problems but could also be important issues for larger test cases.
  10 KB (1,435 words) - 18:41, 17 January 2012
• QPOPT
  Every ''i''th iteration, a numerical test is made to see if the current solution ''x ''satisfies the constraints in
  45 KB (7,387 words) - 11:22, 9 December 2011
• Quickguide Binary Selection Problems
  The following files define two test cases in TOMLAB. The first case is a binary programming problem with binary
  3 KB (388 words) - 18:35, 17 January 2012
• Common input for all CGO solvers
  In the first case, a new test is made which points to use.
  9 KB (1,412 words) - 05:47, 14 July 2014
• Models Fitting of positive sums of Exponentials: exp prob
  In <tt>exp_prob</tt> there are 51 Fitting of positive sums of Exponentials test problems with up to 6 variables. In order to define the problem n and solve
  333 bytes (54 words) - 07:41, 12 August 2011