is a discipline to apply analytical methods for better decisions. It has many synonyms such as management science, decision science and system science.

learn more… | top users | synonyms

4
votes
1answer
2k views

Linear Programming: Three variable graphical solution

A small bank offers three type of loans: housing loans at $8.50$% interest, education loans at $13.75$% interest rates, and loans to senior citizens at $12.25$% interest. Further, it needs to ...
3
votes
1answer
92 views

simplex method standard form

i am unable to understand algebraic formulation of simplex method.when we add slack variables, and solve for finding basic feasible solution we put free variables equal to zero. My question is why ...
2
votes
1answer
30 views

optimization network models

This is a question from Wane Winston 's Book. I don't understand how to do this. I tried to do it this way but it doesn't seem to work. Let $C_{ij}$ be the cost of using box of i $ i>=j$ Then ...
1
vote
1answer
22 views

How to model a multiobjective problem with a large dataset?

I have a large dataset of businesses (around 5k venues with distance from a predefined point, average price and service quality rating) and I need to create the objective functions to minimize the ...
1
vote
1answer
36 views

Primal of Dual of LP problem

Given that the following relation holds: $$\begin{align*} &\textbf{Primal problem} \\ &\max Z = c^Tx \\ &s.t. \\ &Ax \leq b \\ & x \geq 0\end{align*}$$ $\Longrightarrow$ ...
1
vote
1answer
49 views

Relative Interiors of polyhedra

***Source article: Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464-484
1
vote
1answer
667 views

simplex M-method minimization problem

Solve using the simplex method. Identify the solution of the dual in the final simplex tableau Minimize: $$z=12x_{1}+4x_{2}+2x_{3}$$ **Constraints:**$$ x_{i}\ge 0$$ $$-6x_{1}+3x_{2}\ge 9$$ ...
1
vote
1answer
120 views

Travelling Salesman on Subset of Points

I'd like to solve the travelling salesman problem, except that the salesman only needs to travel to a subset of the locations. Each location has exactly one client, and each client has a "type". For ...
0
votes
1answer
44 views

Can a basic variable be the entering variable in Simplex method?

I have got from my teacher that "the entering variable in a maximization problem is the non-basic variable having the most negative coefficient in the Z- row" I think X1,X2 are non basic and ...
0
votes
1answer
31 views

discuss convexity of the following set?

discuss convexity of the following set ? $$M= \{(x,y)∈\Bbb R^2 : x^2+y^2≥a^2 ,x^2+y^2≤b^2 ,x>0,y>0\} $$
0
votes
1answer
33 views

How to distribute groups over activities in rounds

I typed out my problem in a Latex file and I will add an image of it here: If anyone could help me how to solve this problem that would be amazing. Thank in advance. Boris
0
votes
1answer
39 views

Euler equation for $\int_0^{\infty}e^{-rt}(x^2+2x+\dot x^2) \ \mathrm dt$? Is $\infty$ in the boundary open or closed?

I am pondering this problem here, the course Mat-2.3148 Dynamic Optimization in Aalto University, i.e. Find the function $x(t)$ such that $\int_0^{\infty}e^{-rt}(x^2+2x+\dot x^2)\ \mathrm dt$ has ...
0
votes
1answer
18 views

What if objective function $Z$ is also in the constraints?

What if objective function $Z$ is in the constraints? To construct the dual form for this problem? how do I approach to this problem? Maximize $\;\;\;\;\;\;\; z$ subject to $$\;\;\;z - ...
0
votes
1answer
78 views

Relation between arg min of two functions

When is $u_F(x) = \underset{u}{\text{argmin}}(F_1(x),\cdots,F_u(x),\cdots,F_U(x))$ $\le$ $\underset{u}{\text{argmin}}(G_1(x),\cdots,G_u(x),\cdots,G_U(x)) = u_G(x)$ where $u \in \{1,2,\cdots,U\}, x \in ...
0
votes
1answer
145 views

How to answer this linear algebra question, which is related to operations research?

I have the following question: Let $A$ be an $(m \times n)$-matrix and $b$ a vector in $\mathbb{R}^m$. The system of inequalities $Ax \leq b$ has a solution $x \geq 0$, if and only if $yb \geq 0$ for ...
0
votes
1answer
252 views

Operations research - linear programming help appreciated.

George Weasley, the owner of Weasleys' Wizard Wheezes, recently found that his Skiving Snackboxes have become extremely popular amongst the students at Hogwarts School of Witchcraft and Wizardry, and ...
0
votes
1answer
301 views

Edge weight function for graph instance of scheduling and allocation problem

I have difficulties developing a proper (non-scalar) edge cost function $c_e$ for my resource scheduling problem, which I mapped into a graph problem. Processes $P_i$ need resources $R_i \in ...
3
votes
0answers
95 views

A basic question related with the solutions of linear programming problems

I have to select one option from the problem statement given below. Which of the following statements is true in case of linear programming. $1$: An optimal solution exists at extreme points of a ...
3
votes
0answers
68 views

Operational Research. (Ressource Management)

I am looking for a solution that i know exists already in the field of "Operational Research"... I Just can't put my finger on the name of the thing. An heuristic to solve a very common and simple ...
2
votes
0answers
42 views

Find Solution regarding 2-Norm

I try to understand that, but I have no clue what do to and how to do it. $A$ is a $m \times n$ matrix with $rg(A)=m$. Find the solution for $Ax = b$, which is regarding to the $2$-norm (I guess ...
2
votes
0answers
37 views

What subjects properly belong in operations research as their “owning” discipline?

Warning: This is a soft question, hence I would make it a wiki-community post if I could. Operations Research involves a broad swath of disciplines, ranging from probability and statistics/stochastic ...
2
votes
0answers
59 views

Assignment problem with multiple types, capacities and costs

I am trying to solve an optimization problem (variation of assignment problem). I'm stuck with how to represent this problem (as an LP or graph based). If it's formulated as a LP, I'm unsure of how to ...
2
votes
0answers
138 views

Is optimal solution to dual not unique if optimal solution to the primal is degenerate?

If optimal solution to the primal is degenerate, does it necessarily follow that optimal solution to dual not unique? That is, is uniqueness an unnecessary assumption? Spin-off from here. In my ...
2
votes
0answers
60 views

Linear programming of sperner lemma

How can you formulate the 2-D proof of Sperner lemma as a linear programming problem? I know that you have to divide the triangle up into smalled triangles with the original triangle having vertices ...
2
votes
0answers
145 views

Changing a queueing processes

Situation Consider a general queueing system $\mathscr{S}$, whose customer arrival times are independent, and whose service times are independent; both of these are allowed to have general ...
2
votes
0answers
448 views

Reconstructing an optimal Simplex tableau from an optimal solution

I have here a bounded LP with infinite optimal solutions: ...
1
vote
0answers
118 views

Primal and dual problem (Optimal solution) - Operations research

I'm currently studying operations research and I want to know and understand how we find an optial solution to the dual problem with minimum effort. Lets say we have this primal and dual problem: ...
1
vote
0answers
13 views

Say optimal solution to the primal is degenerate. Does it hold that optimal solution to dual not unique?

I think it's supposed to be that existence of a degenerate and unique solution of the primal implies multiple solutions to the dual, according to this book (pages 141-145, proof of Theorem 4.5). In ...
1
vote
0answers
46 views

Assignment problem with serval 'rounds' and additional constraints

Suppose we have an office with $n$ employees and we want to make a planning for the upcoming $T$ weeks. In each week there are $m_t, t\in \{1, 2, \ldots, T\},$ jobs to do. Each employee can give a ...
1
vote
0answers
84 views

Prove an artificial variable that leaves the basis will never return.

Prove an artificial variable that leaves the basis will never return. Edit: This is for the simplex method (I think). I have no idea how to start this. Anyone know any books with these kinds of ...
1
vote
0answers
118 views

Formulating linear programming treatment plan based on costs, periods, and condition

Note that this question is cross posted from OR-exchange Although we have a software that solves this for us, I'd like to understand the background behind the scenes as well as build a validation ...
1
vote
0answers
30 views

Poisson Distribution Research Question in R

I am working on doing a Poisson distribution based upon the number of potholes and accidents on a given road. The problem I currently have is that I am basing a general linear model off of only the ...
1
vote
0answers
23 views

Need guidance on a Queuing problem

I can't really go into specifics, I'm more just looking for terms that I can research to get on the right track. Classes of model/processes etc. A close analogy to my problem: I need to optimally ...
1
vote
0answers
57 views

Sensitivity of coefficients in ODE

I am trying to formulate a mathematical model as part of an op-research problem, and I'm running into a roadblock concerning differential equations of a certain kind; I was hoping to understand if ...
1
vote
0answers
30 views

Highest (lowest) index of positive time-indexed variable

I have a simple problem involving a variable $x_{it}$ representing the amount of a resource allotted to a task $i$ in time $t$. The quantity of the (renewable) resource is constrained at a value $R$ ...
1
vote
0answers
837 views

Graphically solving a Linear Programming Problem?

I was given the following linear programming problem and have been asked to find all optimal solutions graphically. I am quite new to the subject, so please forgive my naivety. ...
1
vote
0answers
32 views

Complexity of Earlist Avaible Due Date for Scheduling Problem 1|ri, pi=1|Lmax

Let us consider the scheduling problem 1|ri,pi=1|Lmax (basically, this means there is one machine on which we have to schedule n jobs (all with identical procssing time 1) in such a way that the ...
1
vote
0answers
67 views

Infinite loop in column generation algortihm

I have to program the following: Input: I have k commodities that have to go from place i to j with a certain demand There are n nodes and the cost for traveling one piece between the nodes i and j ...
1
vote
0answers
598 views

Introduction into Operations Research

I am a first year graduate student who advisor wants me to learn about operations research and to use stochastic integer programming in my research. He keeps giving me papers to read but they ...
1
vote
0answers
17 views

Differential rents problem solving for transport problem

Sorry if question was asked, but I was unable to find the exact duplicate. Let's assume that we have transport problem. Will optimal plan for transport problem be the same regardless the method I ...
0
votes
0answers
19 views

How to model the following banking question?

A group has 200 members. Each member settles up 100,000 S each month. The group runs a lottery every month and pays 10,000,000 $ to one member of the group i.e.,winner. The winner do not settle up ...
0
votes
0answers
21 views

Not every correlated equilibrium is equivalent to a Nash equilibrium?

This is a statement made under Theorem 3.4.13 on page 84 in the book by Yoav Shoham and Kevin Leyton-Brown, Multiagent Systems. Could someone explain this to a lay-man and also elaborate on why they ...
0
votes
0answers
14 views

Minimizing handling costs in the one-to-one TSPPD

Currently I'm reading about the Traveling Salesman Problem with Pickups and deliveries. This is similar to the classical TSP but there are $n$ requests and each request has a pickup location and a ...
0
votes
0answers
35 views

Simplex Method, which step is wrong?

Question: Maximize $z=2x_1-6x_2$, Subject to $-x_1-x_2-x_3\le-2$ and $2x_1-x_2+x_3\le1$. $x_1,x_2,x_3\ge0$. My work: $-2x_1+6x_2+z=0$ Then ${R_2\over2}\Rightarrow new R_2$, $new ...
0
votes
0answers
23 views

Consider the maximum flow problem with n nodes and m arcs. You are writing a formulation with f as the maximum flow.

Consider the maximum flow problem with n nodes and m arcs. You are writing a formulation with f as the maximum flow. How many terms the objective function will have?
0
votes
0answers
24 views

Is this variant of the Stable Roommate problem NP-hard?

I want to organize $2n$ people ${A, B, C, \dots}$ in pairs. Each people rates every other one with an integer number going from 0 to 10. The ratings may not be reciprocal (i.e., A may rate B a 10, and ...
0
votes
0answers
60 views

Nonlinear non-convex semi-infinite programming with norm equality constraint

In optimization theory, semi-infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, or an infinite number of variables and a ...
0
votes
0answers
44 views

Difference between CPM and PERT

What is the difference between Critical Path Method and Program Evaluation and Review Technique?
0
votes
0answers
20 views

Is “nonanticipating” a measurability property of a function or something more?

I have been reading some operations research papers that throw in the term "nonanticipating" at key points in the exposition, but I can't figure out precisely what they mean. My best guess is that ...
0
votes
0answers
44 views

Scheduling Algorithm for a multi-server queue problem

I have 4 servers, n customers and m reports. At any time, a customer may request one of m reports. There are only 4 servers which are capable of generating reports. Each server can only process one ...