Home | Contact Us | FAQ | Search & Site Map | Link to Us
Sign In | Join | Other 45 Sites in Network
Home
Discussion Groups
Mathematics
General TopicsResearchOperations ResearchStatisticsMathematical LogicNumerical AnalysisUndergraduate MathAlgebra HelpRecreational Math
Math Software
MapleMathematicaMATLABScilabSASSPSS

Math Forum / Mathematics / Operations Research / July 2006



Tip: Looking for answers? Try searching our database.

ThreadLast Post  Replies
Using the max{}-operator31 Jul 2006 23:40 GMT2
I am using CPLEX in connection with Java for my thesis.
Now I am facing the problem to have a max{x1, x2,....}-operator in my
mathematical formulation and I don't know how to tell CPLEX to pick the
maximum of a set.
Boolean formula as integer linear program31 Jul 2006 20:16 GMT1
I am currently enrolled in a research program. Let X_1, ..., X_n be n
sets of boolean variables which have to satisfy some linear
constraints. Let y_1, ..., y_n be n boolean variables such that y_i =
AND(x \in X_i) x, i.e. the conjunction of all x in X_i.
It it possible to solve? Is it MINLP?30 Jul 2006 10:03 GMT3
Hello, I would say my problem can be solved with MINLP, but I'm not
sure because I've been approaching the subject only recently an I'm
looking for advice.
Firstly, is it possible to have, in the objective function, a product
convexity29 Jul 2006 17:28 GMT4
Suppouse f: R->R is a differentiable, strictly convex, strictly
increasing function with f(0)=1. We need to show that if f'(-a)>f'(a)
for some a in R, then a<0
[cplex 10] A *reliable* way to get an upper bound of the solution of an IP28 Jul 2006 16:25 GMT2
I'm using Cplex 10 through the Java API, and I am considering pure
integer maximisation problem.
The method IloCplex.getBestObjValue is supposed to return an upper bound
on the objective function of the IP. But what it returns ---the best
how to handle inequality constraints in optimization?23 Jul 2006 11:33 GMT11
Optimization programs often accept only standard form of constaints:   A x
<=b, or L <= x <= U, f(x) <= c,
But how do I create inequalities, such as:
f(x)<c,
Upper limit of param23 Jul 2006 04:01 GMT1
I am trying to find the parameters of a triangular distribution (min,likely,max), given 3 percentile points. I have access to an NLP solver, so planning to use simple NLP which will minimize the distance from the percentile points. This works, but the search space (each variable ...
Objective values in Column geneartion (Dantzig-Wolfe Decomposition) method22 Jul 2006 17:57 GMT2
I'm not sure about the following observation:
In the minimization problem, say Column Generation Method (DW
decomposition method) is used here, the objective values of the master
problem are getting smaller and those of the subproblem are getting
Fabry Pérot etalon as frequency marker?22 Jul 2006 12:01 GMT1
I spent a significant part of the last week searching for a company that
would sell me a solid state Fabry Pérot etalon, with specified free
spectral range, finesse and central wavelength, but until now, I have
only got two very expensive looking quotes, as they seem to ...
queue theory help needed21 Jul 2006 14:52 GMT2
Is there a good book on this topic?  (cliff notes version?)
Here is my problem:
I have 20 cash registers.  There is 1 line to the cash registers (like
BestBuy). One cashier is working and the rest are on break.
nonlinear programming21 Jul 2006 03:52 GMT2
Hi my name is mario, I am from Peru. Well, i'd like to talk about
transportation research, one of the most difficult problem in mycountry
is the transportation. This activity is generating economic problens
due to every year my country import oil from foreigner countries, so
commercial software for MIP19 Jul 2006 20:24 GMT7
I'm looking for commercial softwares for large-scale mixed-integer
programs.  I have considered CPLEX, LINDO, and Premium Solver Platform
by Frontline with different plug-in solver engines.  Does anyone know
of more alternatives?  I am also wondering if there are any resources
Optimisation Problem19 Jul 2006 16:25 GMT3
I have an optimization problem which can be solved using Simplex
Method.
But i need to incorporate one more constraint which is an either-or
constraint into the existing problem.
Either-Or Constraints19 Jul 2006 16:09 GMT1
I have an optimization problem which can be solved using Simplex
Method.
But i need to incorporate one more constraint which is an either-or
constraint into the existing problem.
ruler puzzle19 Jul 2006 02:59 GMT1
    I would like to know if the following problem has already been studied:
I have two rulers of equal length, each cut into pieces of (typically of
different length and not necessarily  in the same number for the two
rulers). I would like to find a way of dividing the pieces of one ...
Pages: 1 2 3 June, 2006
 
Sign In
Join
My Latest Posts
My Monitored Threads
My Blog
My Photo Gallery
My Profile
My Homepage

Start New Thread



©2010 Advenet LLC   Privacy Policy - Terms of Use
This website includes both content owned or controlled by Advenet as well as content owned or controlled by third parties.