TransWikia.com
  1. All Categories
  2. Operations Research

Operations Research : Recent Questions and Answers (Page 3)

Find answers to your questions about Operations Research or help others by answering their Operations Research questions.

What is a general procedure to prove that the LP relaxation of an IP delivers the optimal IP solution?

Say that I have a binary IP$$z=max_x {c^top x: Ax=b, xin B^n}$$where $B^n$ is the set of $n$-dimensional $0-1$ vectors.Its LP relaxation will...

Asked on 08/19/2021 by k88074

2 answer

CPLEX MIP warm start seems slow down the program?

I have been working on a combinatorial optimization problem which can be modeled as an integer linear programming. I implemented it as a c++ project in visual studio 2017 and...

Asked on 08/19/2021 by Mengfan Ma

1 answer

(Iterative?) Solutions to a certain quadratic program with non-convex constraints

Let $yinmathbb{R}^m$, $tauinmathbb{R}$ and $Xinmathbb{R}^{mtimes n}$, with $tau>0$ I would like to efficiently solve the following problem:Problem 1Choose $alpha,zinmathbb{R}^m,betainmathbb{R}^n$ to minimize:$$(y-alpha)^top (y-alpha)...

Asked on 08/19/2021 by cfp

2 answer

Problem with implementing squared terms in the objective function

I'm trying to implement either one of these objective functions, but I'm having a hard time with the squared terms. I'm attaching both so you can take a look at...

Asked on 08/19/2021 by PoofyBridge

1 answer

Two M/M/1 queues working independently

If two M/M/1 queues with arrival rate $lambda$ and service rate $mu$ are working independently. Is the system equivalent to a single M/M/1 queue with arrival rate ...

Asked on 08/19/2021 by cookiemonster

0 answer

Scheduling with setup cost

I have a single worker that can work on N different tasks, but his total time T is limited. Let's assume time is in steps of 10 minutes (1 step...

Asked on 08/19/2021 by Dirk Nachbar

0 answer

Is a convex or MILP (without big-M) formulation possible for this problem

Assume we are given a directed acyclic graph (DAG) $G(V, A)$, where $|V| = n, |A| = m$, and the graph contains a source node $mathbf{s}$ (i.e....

Asked on 08/19/2021 by batwing

1 answer

MINLP Solution same as Global Optimum?

Is the solution to an MINLP problem the global optimum to this problem?...

Asked on 08/19/2021 by Clement

2 answer

Linear objective function with non-linear constraints

I would like to choose a set of $beta_j$s that maximizes a simple linear objective function of the type $$underset{beta_j}{operatorname{max}}sum_{j=1}^{J}X_jbeta_j \$$ subject to the following constraints...

Asked on 08/19/2021 by FightMilk

2 answer

Meta papers on operations research

Some time ago, I wrote this answer: https://or.stackexchange.com/a/3323/405 to a question here on this stack exchange. I've had similar discussions with colleges, but I never found anything written down...

Asked on 08/19/2021 by Luke599999

2 answer

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP