Operations Research Stack Exchange

1

vote

2

answers

31

views

Piece-wise linear approximation of a constraint

mixed-integer-programming modeling linearization

answered 6 hours ago prubin 24.1k

3

votes

1

answer

83

views

min max inside a linear program

linear-programming duality

modified 6 hours ago ericf 139

-2

votes

1

answer

79

views

Modelling constraint

mixed-integer-programming linear-programming modeling integer-programming

modified yesterday nostres 7

1

vote

0

answers

31

views

Simple inventory control with stochastic demand

inventory dynamic-programming stochastic-process optimal-control

modified yesterday RobPratt 19k

4

votes

1

answer

80

views

Exploiting ordering to removing infeasible solutions in MILP

mixed-integer-programming integer-programming branch-and-cut cutting-planes valid-inequalities

answered yesterday prubin 24.1k

11

votes

5

answers

1k

views

Dividing machines into groups of equal sizes so that each group has approximately same productivity

mixed-integer-programming linear-programming modeling mosek

modified yesterday dipak narayanan 2,121

2

votes

1

answer

40

views

Master Problem Infeasible after Iterations of Unbounded Sub Problem (Generic Benders Decomposition in non Stochastic MILP)

modeling combinatorial-optimization benders-decomposition

answered 2 days ago prubin 24.1k

2

votes

1

answer

73

views

How to introduce an optional decision variable

modeling

modified 2 days ago Alex Fleischer 3,177

2

votes

1

answer

44

views

A variable being a set...?

knapsack minizinc

answered Jan 19 at 23:14 prubin 24.1k

1

vote

1

answer

31

views

Assignment Problems With More than One Class of Resource

optimization vehicle-routing assignment-problem

answered Jan 19 at 22:21 prubin 24.1k

3

votes

2

answers

145

views

Eliminating Variables in Semidefinite Programs Using Equality Constraints

optimization convex-optimization

answered Jan 19 at 14:11 Johan Löfberg 1,582

4

votes

2

answers

133

views

Linearizing $x^2/(1-x)$ by partitioning the interval $0<x\le X$

linearization nonlinear-programming

modified Jan 19 at 9:06 TheSimpliFire♦ 4,844

8

votes

1

answer

456

views

Optimization software for ARM Architecture

cplex gurobi

modified Jan 19 at 2:15 SecretAgentMan 1,695

0

votes

0

answers

47

views

What does it mean to derive and/or analyze the optimality condition (in the context of dynamic programming)?

dynamic-programming

asked Jan 18 at 20:56 Vultra Uiolet 21

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Piece-wise linear approximation of a constraint

min max inside a linear program

Modelling constraint

Simple inventory control with stochastic demand

Exploiting ordering to removing infeasible solutions in MILP

Dividing machines into groups of equal sizes so that each group has approximately same productivity

Master Problem Infeasible after Iterations of Unbounded Sub Problem (Generic Benders Decomposition in non Stochastic MILP)

How to introduce an optional decision variable

A variable being a set...?

Assignment Problems With More than One Class of Resource

Eliminating Variables in Semidefinite Programs Using Equality Constraints

Linearizing $x^2/(1-x)$ by partitioning the interval $0<x\le X$

Optimization software for ARM Architecture

What does it mean to derive and/or analyze the optimality condition (in the context of dynamic programming)?

Hot Network Questions