1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
|
// Copyright (C) 2016 - IIT Bombay - FOSSEE
//
// This file must be used under the terms of the CeCILL.
// This source file is licensed as described in the file COPYING, which
// you should have received as part of this distribution. The terms
// are also available at
// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
// Author: Harpreet Singh, Pranav Deshpande and Akshay Miterani
// Organization: FOSSEE, IIT Bombay
// Email: toolbox@scilab.in
#include <iomanip>
#include <fstream>
#include <iostream>
#include "CoinPragma.hpp"
#include "CoinTime.hpp"
#include "CoinError.hpp"
#include "BonOsiTMINLPInterface.hpp"
#include "BonIpoptSolver.hpp"
#include "QuadTMINLP.hpp"
#include "BonCbc.hpp"
#include "BonBonminSetup.hpp"
#include "BonOACutGenerator2.hpp"
#include "BonEcpCuts.hpp"
#include "BonOaNlpOptim.hpp"
#include "sci_iofunc.hpp"
extern "C"
{
#include <api_scilab.h>
#include <Scierror.h>
#include <BOOL.h>
#include <localization.h>
#include <sciprint.h>
int cpp_intqpipopt(char *fname)
{
using namespace Ipopt;
using namespace Bonmin;
CheckInputArgument(pvApiCtx, 15, 15); // We need total 15 input arguments.
CheckOutputArgument(pvApiCtx, 3, 3); // 3 output arguments
// Error management variable
SciErr sciErr;
// Input arguments
double *QItems=NULL,*PItems=NULL, *intcon = NULL, *ConItems=NULL,*conUB=NULL,*conLB=NULL;
double *varUB=NULL,*varLB=NULL,*init_guess=NULL,*options=NULL, *ifval=NULL;
static unsigned int nVars = 0,nCons = 0, intconSize = 0;
unsigned int temp1 = 0,temp2 = 0;
char *bonmin_options_file = NULL;
// Output arguments
double *fX = NULL, ObjVal = 0,iteration=0;
int rstatus = 0;
//Number of Variables
if(getIntFromScilab(1,&nVars))
{
return 1;
}
//Number of Constraints
if (getIntFromScilab(2,&nCons))
{
return 1;
}
//Number of variables constrained to be integers
if (getIntFromScilab(3,&intconSize))
{
return 1;
}
//Q matrix from scilab
temp1 = nVars;
temp2 = nVars;
if (getFixedSizeDoubleMatrixFromScilab(4,temp1,temp1,&QItems))
{
return 1;
}
//P matrix from scilab
temp1 = 1;
temp2 = nVars;
if (getFixedSizeDoubleMatrixFromScilab(5,temp1,temp2,&PItems))
{
return 1;
}
temp1 = 1;
temp2 = intconSize;
// Getting intcon
if (getDoubleMatrixFromScilab(6,&temp1,&temp2,&intcon))
{
return 1;
}
if (nCons!=0)
{
//conMatrix matrix from scilab
temp1 = nCons;
temp2 = nVars;
if (getFixedSizeDoubleMatrixFromScilab(7,temp1,temp2,&ConItems))
{
return 1;
}
//conLB matrix from scilab
temp1 = 1;
temp2 = nCons;
if (getFixedSizeDoubleMatrixFromScilab(8,temp1,temp2,&conLB))
{
return 1;
}
//conUB matrix from scilab
if (getFixedSizeDoubleMatrixFromScilab(9,temp1,temp2,&conUB))
{
return 1;
}
}
//varLB matrix from scilab
temp1 = 1;
temp2 = nVars;
if (getFixedSizeDoubleMatrixFromScilab(10,temp1,temp2,&varLB))
{
return 1;
}
//varUB matrix from scilab
if (getFixedSizeDoubleMatrixFromScilab(11,temp1,temp2,&varUB))
{
return 1;
}
//Initial Value of variables from scilab
if (getFixedSizeDoubleMatrixFromScilab( 12,temp1,temp2,&init_guess))
{
return 1;
}
temp1=1;
temp2=5;
if (getFixedSizeDoubleMatrixFromScilab(13,temp1,temp2,&options))
{
return 1;
}
temp1=1;
temp2=5;
if (getFixedSizeDoubleMatrixFromScilab(14,temp1,temp2,&ifval))
{
return 1;
}
if (getStringFromScilab(15, &bonmin_options_file))
{
return 1;
}
SmartPtr<QuadTMINLP> tminlp = new QuadTMINLP(nVars,nCons,intconSize,QItems, PItems, intcon,ConItems,conLB,conUB,varLB,varUB,init_guess);
BonminSetup bonmin;
bonmin.initializeOptionsAndJournalist();
// Here we can change the default value of some Bonmin or Ipopt option
bonmin.options()->SetStringValue("mu_oracle","loqo");
//Register an additional option
if((int)ifval[0])
bonmin.options()->SetNumericValue("bonmin.integer_tolerance", (options[0]));
if((int)ifval[1])
bonmin.options()->SetIntegerValue("bonmin.node_limit", (int)(options[1]));
if((int)ifval[2])
bonmin.options()->SetNumericValue("bonmin.time_limit", (options[2]));
if((int)ifval[3])
bonmin.options()->SetNumericValue("bonmin.allowable_gap", (options[3]));
if((int)ifval[4])
bonmin.options()->SetIntegerValue("bonmin.iteration_limit", (int)(options[4]));
//Here we read the option file
//if ( bonmin_options_file!=NULL )
// bonmin.readOptionsFile(bonmin_options_file);
//Now initialize from tminlp
bonmin.initialize(GetRawPtr(tminlp));
//Set up done, now let's branch and bound
try {
Bab bb;
bb(bonmin);//process parameter file using Ipopt and do branch and bound using Cbc
}
catch(TNLPSolver::UnsolvedError *E) {
//There has been a failure to solve a problem with Ipopt.
std::cerr<<"Ipopt has failed to solve a problem!"<<std::endl;
sciprint(999, "\nIpopt has failed to solve the problem!\n");
}
catch(OsiTMINLPInterface::SimpleError &E) {
std::cerr<<E.className()<<"::"<<E.methodName()
<<std::endl
<<E.message()<<std::endl;
sciprint(999, "\nFailed to solve a problem!\n");
}
catch(CoinError &E) {
std::cerr<<E.className()<<"::"<<E.methodName()
<<std::endl
<<E.message()<<std::endl;
sciprint(999, "\nFailed to solve a problem!\n");
}
rstatus=tminlp->returnStatus();
if (rstatus >= 0 | rstatus <= 5){
fX = tminlp->getX();
ObjVal = tminlp->getObjVal();
if (returnDoubleMatrixToScilab(1, 1, nVars, fX))
{
return 1;
}
if (returnDoubleMatrixToScilab(2, 1, 1, &ObjVal))
{
return 1;
}
if (returnIntegerMatrixToScilab(3, 1, 1, &rstatus))
{
return 1;
}
}
else
{
if (returnDoubleMatrixToScilab(1, 0, 0, fX))
{
return 1;
}
if (returnDoubleMatrixToScilab(2, 1, 1, &ObjVal))
{
return 1;
}
if (returnIntegerMatrixToScilab(3, 1, 1, &rstatus))
{
return 1;
}
sciprint(999, "\nThe problem could not be solved!\n");
}
// As the SmartPtrs go out of scope, the reference count
// will be decremented and the objects will automatically
// be deleted(No memory leakage).
return 0;
}
}
|
