| Thread | Last Post | Replies |
|
| Decision problem and optimization problem | 31 Dec 2008 21:09 GMT | 1 |
Hi all, it is a question about complexity: if a decision problem can
be solved in polynomial time, does it mean that the associated
optimization problem can be solved in polynomial time too?
Thanks in advance!
|
| who knows this format ? | 22 Dec 2008 01:22 GMT | 1 |
I am attaching a few lines of a SAT problem that an application
outputs to a very old SAT solver called SatSol.
Has this format a name ?
Are there other solvers that use it ?
|
| Dual of a linear program with bounded variables | 20 Dec 2008 18:35 GMT | 4 |
Is there any way of writing the dual of a linear program as following
without considering LB <= x <= UB as two different constraints and
assigning dual variables to them?
minimize cx
|
| MIP runs too slow in the latest version of CPLEX | 19 Dec 2008 10:24 GMT | 12 |
Is there any trick for quickly getting a feasible integer solution
with some gap? Thanks.
|
| non-anticipativity in Stochastic programming | 15 Dec 2008 22:42 GMT | 1 |
Hi all, could anybody explain the concept of non-anticipativity in
Stochastic programming, and it's impact on modeling?
Thanks a lot!
|
| special knapsack problem | 10 Dec 2008 01:12 GMT | 1 |
I need for the following problem an optimal solution.
Basically it is the multiple-choice knapsack problem with only one
modification.
The weight of an item is not fix but is has a constant and a variable
|
| ilog Cplex 11.2: equally divide two decision variables | 07 Dec 2008 09:52 GMT | 3 |
we are working on an optimization model that represents transportation
network of water waste.
The waste consists of water and waste.
If there is 100 kg waste it may for example consist out of 99 kg water
|
| IloCplex::IISStatusArray | 06 Dec 2008 02:01 GMT | 1 |
I am recently working on solution of an MIP with a very bad LP bound.
Following a decomposition scheme I have to generate cuts to be added
to the Master problem.
These cuts are going to be generated from "irreducibly Infeasible Set"
|
| integer programming vs "real" programming? | 05 Dec 2008 22:47 GMT | 3 |
I have been using a direct search algorithm and it, as other regular
opt algorithms, is developed for case when the independent variables
are real numbers. Let's call it "real" programming to distinguish it
from the "integer prgramming" when the independent variables are
|
| Complexity of Convex Programming | 04 Dec 2008 16:56 GMT | 6 |
[ repost from sci.math ]
"Convex programs can be solved in polynomial time, up to an
arbitrarily small error." I doubt that this is true in that
generality.
|
| Error in IloInfinity (it is Negative ) | 03 Dec 2008 20:30 GMT | 3 |
I have been using the older version of ILOG concert without any
problem.
Recently I have to use a newer version of it and tried it with VC++
in both VS2005 and VS2008.
|
Sign In
Join
My Latest Posts
My Monitored Threads
My Blog
My Photo Gallery
My Profile
My Homepage
Start New Thread