Questions tagged [optimization]

Optimization is the process of choosing the "best" value among possible values. They are often formulated as questions on the minimization/maximization of functions, with or without constraints.

In mathematics, computer science, economics, or management science, mathematical optimization (alternatively, optimization or mathematical programming) is the selection of a best element (with regard to some criteria) from some set of available alternatives.

An optimization problem can be represented in the following way: given a function $f:A\to\mathbb{R}$ from some set $A$ to the real numbers, we want to find an element $x_0\in A$ such that $f(x_0)\le f(x)$ for all $x \in A$ ("minimization") or such that $f(x_0)\ge f(x)$ for all $x \in A$ ("maximization").

22512 questions
0
votes
0 answers

Differential calculus: Gradient and hessian local minimum point

Let the function defined on E = R$^2$ by J(x,y)=$x^2-xy +y^2+3x-2y+1$ Calculate the associated gradient and hessian? Deduce, the value of a local mimi point is what a strict mimimum So the gradiant is : $(2x-y+3,2y-x-2)$ $1) 2x-y=-3$ and $2) …
0
votes
2 answers

minimal cost to get a square from four sides

Suppose I have four sides, and I want to make a square out of them. Each of the sides can be decreased or increased, and a price needs to be payed for such an action: increasing or decreasing a side by one unit has a cost of one unit. What is the…
0
votes
0 answers

Maximise the distance between a set of points and a line passing through a particular point.

Problem I want to find a line that maximises the sum of perpendicular distances from a set of points to the line such that the line passes through a fixed given point. I have tried formulating the problem as follows: $$\max\frac{\Vert Aw+eb…
0
votes
1 answer

Decomposition methods used in operations research

I want to know when and where to use the decomposition methods such as lagrangean decomposition, Dantzig-wolfe decomposition and Bender's decomposition are used and advantageous. I also want to know the application areas where these techniques are…
0
votes
2 answers

Explain this statement $\bar 0 \in \partial f(x^*)$ where $\partial f(x^*)$ is subgradient

I haven't understood this theorem "$x^*$ is global minimum iff $\bar 0\in \partial f(x^*)$". What does it mean? Visually? P.s. Studying Nonlinear-optimization -course, 2.3139.
hhh
  • 5,469
0
votes
0 answers

Best fit assemble a geometric model to another model according to the geometric variation

If I have a geometric model that has geometric variation from the nominal dimensions and I want to assemble it to a second geometric model with variation, how do I best fit them together to minimise the variation?
Vinal
  • 1
0
votes
0 answers

What is the function $\psi$ inside level set definitions for shape functionals?

In the level set method for shape optimization the shape functionals are defined as: $$J_{dom}(\Omega) = \int_{\Omega} \psi (x) dx, J_{bd}(\Omega) = \int_{\partial \Omega} \psi(x) d \mathcal{H}^{d-1}$$ and $\Omega$ is related via a level set…
mavavilj
  • 7,270
0
votes
0 answers

Equality constraints in Optimization Problems

Why equality constraints are not a problem for Constrained optimization problems (some methods just ignore them and focus on inequalities) Thank you!
0
votes
1 answer

Setting up related system of constraints for an optimization problem

I'm working on an optimization problem that and I am having trouble figuring out how to set up some of the constraints required. To make it easier for me to explain, I'm going to describe a scenario that closely matches the problem I am…
Don L
  • 1
0
votes
0 answers

Optimization of polynomial coefficients

Which methods exist to find a integer monic polynomial whose roots are closest to those of a given real monic polynomial?
0
votes
1 answer

Minimising a function over the positive integers

I would like to find $\min_{n\in\mathbb{N}} (n!\cdot x^n)$ for $0
ocstat
  • 33
0
votes
1 answer

minimize pairwise differences

I am trying to solve minimization problem with these conditions. Given all pair of n users, I want to minimize all f(A) - f(B) pairs for distinct n users. Since I only need the difference, it will be absolute value of f(A) - f(B) for all pairs. f(A)…
ejshin1
  • 101
  • 2
0
votes
1 answer

Calculus optimization garden problem

Plan to enclose a rectangular garden that includes a fence dividing the interior into two separate pieces. The fencing on the outside will cost $5 per linear foot, but the fencing inside will only cost $2 per linear foot. I have budgeted a total of…
Fiona Lu
  • 137
  • 1
  • 3
  • 8
0
votes
1 answer

Tool for Integer Optimization

I have the following problem: A reward function $R(i)$ defined as $$ R(i) > R(j) \iff i > j $$ and a cost function $C(i)$ $$ C(i) > C(j) \iff i > j $$ Both functions are defined on positive integers. I cannot change the sequence $C(i)$ for $i \in…
M. G.
  • 141
  • 3