| Thread | Last Post | Replies |
|
| CPLEX C++ API | 27 Apr 2006 22:10 GMT | 1 |
Anyone knows how to create a 3 dimensional array of boolean variables?
|
| calling a solver from a program | 27 Apr 2006 01:07 GMT | 4 |
I am working on a heuristic algorithm for a routing problem. I need to develop a program that calls a solver (XA or Cplex) numerous times to solve an optimization subproblem. I need to send input to and receive output from the solver numerous times as the algorithm proceeds.
|
| Quadratic Programming | 25 Apr 2006 16:39 GMT | 4 |
I have been front of optimization problem of a quadratic form: Given semi-positive definite n by n matrix A (rank of A is less than n) and n by 1 vector b, find n by 1 vector w such that 'MAXIMIZES'
|
| Cplex in Netbeans | 24 Apr 2006 16:14 GMT | 1 |
Does anybody know how to set Netbeans up for CPLEX? I want to set it up as acting like javamake. For example, -Djava.library.path=..\..\..\bin\win32\ -classpath "..\..\lib\cplex.jar"
|
| How to minimize a difference of two Exponential Functions? Thanks! | 20 Apr 2006 22:44 GMT | 2 |
The objective function to be minimized is a difference of two Exponential Functions: f(x)=-exp(-(x-2)^2/2 - x^2/2) - exp(-(x+2)^2/2 - x^2/2) In Matlab, I used fminunc() as following:
|
| Motzkin's transportation theorem | 19 Apr 2006 23:49 GMT | 2 |
Let A,B,C be matrices with the same number of rows. Then show that either the system A'x<0, B'x<=0, C'x=0 ( ' means transpose of matrix) is consistent, or the system Ay1 + By2 + Cy3 = 0 , y1>=0, y1 not= 0,
|
| checking for linear independence inside an optimization problem | 19 Apr 2006 11:42 GMT | 1 |
The solution of my optimization problem is a matrix (i.e., n vectors). However, the solution I am looking for should be such that the n vectors are linearly independent. Therefore, I am trying to model the linear independence check as a set of constraints. Thus far, I have
|
| Linear vs None-linear Multiobjective Optimization? | 11 Apr 2006 22:22 GMT | 2 |
In none-linear multiobjective optimization, while searching for Pareto solutions, solvers might deliver dominated solutions instead. In single objective, this is equivalent to local optimal solutions! However, in linear multiobjective optimization, could such thing
|
| Initial solution in CPLEX | 11 Apr 2006 12:37 GMT | 2 |
I am using CPLEX through the C callable library. I wanted to know if there is a way to assign an initial value to the LP variables? Also, how will it behave if the initial point does not satisfy all constraints? Any help will be greatly appreciated.
|
| Is this a special type of IP? | 10 Apr 2006 00:36 GMT | 2 |
We have a problem where we have different price bands for buying and/or selling an item from an external market. The model (LP) can either make this item to meet some internal requirement and sell the surplus, or not make this item and purchase the shortfall from this external ...
|
| About Mathematical Programming Software | 07 Apr 2006 13:47 GMT | 4 |
Is there any software or program which will help in determining the convexity/linearity of the function (of two variables only) ??? Thanks and Regards, Ravi
|
| Help about fsolve | 07 Apr 2006 13:45 GMT | 1 |
I want to use "fsolve" in order to check my user-supplied derivative and finite difference derivative obtained from computer. But unfortunately, Matlab says Warning: Trust region algorithm does not currently check user-supplied
|
| Existence of Integer solution in LP relaxed solutions | 02 Apr 2006 14:48 GMT | 8 |
Suppose I solve the LP relaxation of an IP problem. If there are multiple optimal solutions to the LP relaxation, how can I be sure that there are no integer solutions in it? Is it possible to establish the existence (or non-existence) of such a
|