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.

learn more… | top users | synonyms (5)

1
vote
1answer
30 views

Find min/max values of $f(x,y)=x^3-y^3+3xy$ in the set $K=[0,4]\times[-4,0]$

Find the biggest and the smallest values of the function $f(x,y)=x^3-y^3+3xy$ in the set $K=[0,4]\times[-4,0]$. So using partial derivatives we find that the critical points are $(0,0)$ and $(1,-1)$. ...
1
vote
3answers
34 views

Finding extrema.

Find the minimum distance between point $M(0,-2)$ and points $(x,y)$ such that: $y=\frac{16}{\sqrt{3}\,x^{3}}-2$ for $x>0$ . I used the formula for distance between two points in a plane to get: ...
3
votes
2answers
119 views

finding maximum of a function on a closed set

I need to find the maximum of the function $\ f(x,y,z) = y $ on the following closed set : $\ y^2+x^2 + z^2 = 3 $ $\ y+ x + z=1$ But I don't have a clue on how to do it ... Trivially ...
0
votes
0answers
31 views

Expected probability maximization with binomial distribution

I need to solve an optimization problem that involves an expected value like $$F(n,x) = \sum_{k=0}^n \binom{n}{k} p^k(1 - p)^{n - k} f(k,x).$$ Here $f(k,x)$ is actually a probability coming from a ...
0
votes
0answers
20 views

Invex function? How can I show?

Let $\mathbb{S}^m_+$ and $\mathbb{M}^{(m,n)}$, respectively, be the closed cone of positive semidefinite matrices and space of $m\times n$-dimensional matrices. Define function $F$ as ...
0
votes
1answer
98 views

How do I show that $B$ has an infinite number of extreme points, but no faces (sides) of dimension $1$ or $2$?

Let $B = \{ (x,y,z) \in \mathbb R^3 \mid x^2 + y^2 + z^2 \le 1\}$. How do I show that $B$ has an infinite number of extreme points, but no faces (sides) of dimension $1$ or $2$ ? I've been thinking ...
3
votes
1answer
476 views

Maximum likelihood estimators, hypergeometric and binomial

I'm trying to solve a two part problem. The set up is as follows: consider a bag with $\theta$ red marbles and $7-\theta$ blue marbles, with $\theta$ being unknown. Let $x$ denote the number of red ...
0
votes
3answers
34 views

What algorithm will maximize utility when assigning of students to practicum locations

I have the following problem: Students from a class of 150 are beginning practicum training. Students have the option of either staying in an urban centre for their practicum, or optionally, they ...
0
votes
1answer
47 views

Let $S = \{ (x,y,z) \in \mathbb R^3 : x^2 + y^2 + z^2 \le 1\}$. Prove $(1-\lambda)x + \lambda y \in S$ for $x=\lambda'y$, $\lambda' < 0$.

Let $S = \{ (x,y,z) \in \mathbb R^3 : x^2 + y^2 + z^2 \le 1\}$. I've verified that $x,y \in S$ implies $(1-\lambda)x + \lambda y \in S$ when $x,y$ are linearly independent using Pythagoras and when ...
0
votes
1answer
18 views

Compute the extreme points of a polyhedron $P$ and write $(1/2,1/2,1/2)$ as a linear combination of these.

Compute the extreme points of a polyhedron $P$ and write $(1/2,1/2,1/2)$ as a linear combination of these. I want to compute all the extreme points of the set $P$ (polyhedron) in $\mathbb R^3$ ...
-3
votes
4answers
102 views

Maximum and minimum of $y = x^4 - 8x^2 + 3$ for $x \in [ -1 , 2 ]$ [closed]

I have an assignment for tomorrow and I am struggling with this. How can we find the maximum and minimum of $y = x^4 - 8x^2 + 3$ for $x \in [ -1 , 2 ]$?
0
votes
1answer
1k views

How to describe minimization of L1 norm error using linear programming?

Given a set of $n$ pair points $(x_1, y_1), ..., (x_n, y_n)$ in the plane, I need to find a line $ax + by = c$ that fits the points of the L1 norm error points as closely as possible. I need a linear ...
1
vote
1answer
42 views

Optimizing trigonometric equation

I've come across a problem from an old calculus textbook which goes like A tool shed, $250\space cm$ high and $100\space cm$ deep is build against a wall. Calculate the shortest ladder length that ...
1
vote
0answers
19 views

Max-flow-min-cut using LP duality

https://www.cs.oberlin.edu/~asharp/cs365/papers/Approximation-ch12.pdf is a chapter from Vazirani that discusses max cut-min flow using LP duality. The binary min-cut problem is: \begin{align} ...
1
vote
1answer
36 views

Simple question on maximizing a family of concave functions

Given $x \in [0,1]$, let $f_k(x)$ be concave function in $x$ for all $k= 0,1,...,N$. Is the following two maximization formulations equivalent? $$ \max_{0 \le k \le N} f_k(x) =?= \max \{f_0(x), ...
0
votes
2answers
24 views

Resolve this system:

Im tried to resolve this problem: $$\max\quad f\left( x,y \right) =xy\quad \text{s.a}\quad \begin{cases} x^2 +y^2+z^2 -1=0 \\ x+y+z=0 \end{cases}$$ Well, i form the lagrangian and the respective ...
2
votes
0answers
91 views

The amazing lift.

I would like to ask for a program to efficiently calculate how a lift should fetch the people who need it. Most of us use lifts (or elevators) but maybe it could be programmed to be faster! Or can it? ...
0
votes
2answers
28 views

Minimum curve for the distance between two points at the plane

The problem is to determine the curve y=y(x) in the plane, the lenght of which is given by the functional: \begin{equation} I(y)=\int_{x_1}^{x_2}\sqrt{1+(y')^2}dx=\int_{x_1}^{x_2}F(x,y,y')dx ...
6
votes
0answers
605 views

Optimization / personalization within clusters

I have the following optimization problem: I have a (random and very noisy) objective function $f(A, P)$, where $A$ is a vector of "observable" parameters of the input and $P$ is the parameters that ...
4
votes
1answer
84 views

Taylor series approximation of function under norm

I am reading this paper. At page number $4$, term $||Au - f||^{2}$ is approximated by taylor series approximation around $u^{k}$. The resulting approximations are $$\|Au - f\|^{2} \approx ...
5
votes
2answers
305 views

What numerical methods are known to solve $L_1$ regularized quadratic programming problems?

What numerical methods are suitable to solve the following problem $$\min_x \tfrac{1}{2}x^T A x + b^Tx + \lambda ||x||_1$$ where $x,b\in\mathbf{R}^n$, and $A\in \mathbf{R}^{n\times n}$ is positive ...
0
votes
1answer
22 views

For given mean $\mu$ of random variable X in [0,1], what is the probability distribution function $p(X)$ that makes $VAR(X)$ maximum?

Given the conditions $\int_{0}^{1} p(x)dx=1$, $\int_{0}^{1} xp(x)dx=\mu$ and $p(x)\ge0$ for $\forall x \in [0,1]$, What probability distribution function $p(x)$ makes $Var(X)$=$\int_{0}^{1} ...
1
vote
0answers
31 views

How should I modify the initial guess for normalised version of an optimisation problem?

I am solving a large optimisation problem. The problem contains 500 decision variables and few hounderd constraints. Since the constraints are very tight and nonlinear, any random initial guess ...
5
votes
2answers
144 views

Minimum value of $\sqrt{\frac{a}{b+c}}+\sqrt{\frac{b}{c+a}}+\frac{24}{5\sqrt{5a+5b}}$

Let $a\ge b\ge c\ge 0$ such that $a+b+c=1$ Find the minimum value of $P=\sqrt{\dfrac{a}{b+c}}+\sqrt{\dfrac{b}{c+a}}+\dfrac{24}{5\sqrt{5a+5b}}$ I found that the minimum value of $P$ is ...
1
vote
0answers
34 views

Determining the optimal cost through dynamic programming.

There are $n$ houses numbered $\{1, 2, 3, \dots, n\}$. The cost of laying a cable that serves houses $j, j+1, j+2, \dots, j+k $ is $f (j, k)$. One cable can serve a maximum of 10 houses. The ...
3
votes
1answer
776 views

Linearization of a product of two decision variables

I am trying to solve a problem that involves constraints in which products of two decision variables appear. So far, I read that such products can be reformulated to a difference of two quadratic ...
0
votes
1answer
17 views

reformulating an integer quadratic problem into a linear integer problem

I am trying to solve an optimization problem, in order to find an optimal runtime schedule for a machine. It involves one boolean variable $x_{t} \in \mathbb{\{0,1\}}$, that describes whetever the ...
0
votes
0answers
40 views

Can I perform Maximum likelihood via optimization?

I have two $3 \times 3$ matrices $\mathbf{a}$ and $\mathbf{f}$. $\mathbf {f}$ is completely known to me. Also $a_{ij} \in [+1,-1]$ \begin{equation} \mathbf{f} = \left( \begin{array}{ccc} f_{11} ...
1
vote
1answer
18 views

A clarification regarding dynamic programming.

This is a question regarding dynamic programming. The document to which I am referring is this (pg 325). It says that $$v_n(s_n)=\text{Min}\{t_n(s_n)+v_{n-1}(s_{n-1})\}$$ Here $v_n(s_n)$ is the ...
0
votes
1answer
37 views

Iterative method to compute only the positive eigenvalue's and corresponding eignevectors of a very large matrix?

I have a very large dense matrix (~10000 X ~10000) which is not full rank . I want to compute only the positive eigenvalues and corresponding eigenvectors instead of computing all of them. I have ...
0
votes
0answers
35 views

The Hessian of the maximum of a function

I have an optimization problem where the inequality constraint is in the form of: $\min\limits_x f(x)$ subject to $\max\limits_{\zeta} g(x,\zeta) \leq 0$ where $x$ is the optimization variable. I ...
0
votes
0answers
22 views

A length of fence encloses an area alongside a river — what is the optimal shape to maximize area? [duplicate]

You have $100$ meters of fence . There is a perfectly straight riverbank, much longer than $100$ meters, so you have plenty of room to work with. What is the optimal shape and dimensions that ...
0
votes
1answer
11 views

Can a Convex QCQP Problem with an additional linear constraint be converted to a SOCP?

I have a quadratically constrained quadratic programming problem that I massaged into the form $$ \begin{aligned} & \underset{x}{\text{minimize}} & & x^T Q x \\ & \text{subject to} ...
0
votes
1answer
18 views

Optimization: maximizing nonconvex sum of product of constraints

I'm wondering if there is any way to convexify, approximate, and/or simplify the following problem. $\max. \sum_{k \in K} \prod_{i \in I} (a_{ik} x_{ik} + b_{ik})$ s.t. $x_{ik} \in [0,1]$ where ...
1
vote
2answers
25 views

A repository of constrained optimization test problems?

I am looking for a repository of constrained optimization problems with solutions. I want to find "benchmark" type problems to test my algorithm on and just trying to search for known problems ...
1
vote
0answers
17 views

Product expression maximization given 4 matrices as function of 2 column vectors

Hypothesis: - we are given 4 complex matrices denoted with $H_1, H_2, G_1$ and $G_2$. - the 4 matrices are not necessarily square so their size is $N$ by $M$. - we denote with $w_1$ and $w_2$ two ...
0
votes
1answer
18 views

Nocedal/Wright: Numerical Optimization, Lemma 12.3.(ii)

In the above given monograph (1999, 1E) the following parametrized system of equations $R:\mathbb{R}^n \times \mathbb{R} \rightarrow \mathbb{R}^n$ is introduced: $$ R(z,t) := \left[ \begin{array}{c} ...
3
votes
2answers
103 views

Ideal amount of piles to sort a stack of 250 cards (magic the gathering)

I'm a hobbyist working on a mechanical sorting machine to sort magic the gathering cards. I'm by no means a mathematician though, and I was wondering if you all wouldn't mind helping me out with a ...
0
votes
0answers
31 views

What is topological learning?

I am getting this term topological learning in few places for example a reference is below at section 1.1.2: http://virenjain.org/thesis/VirenJainThesis_official.pdf Can anyone point out what ...
3
votes
0answers
68 views

How to solve the Few Scientists Problem (big word problem) in its general form?

I'm trying to figure out how to solve this word problem. I'm pretty sure it involves calculus or something even harder, but I don't know how to solve the general form. Let me start with the concrete ...
0
votes
0answers
35 views

Optimisation Problem for Pipe Nesting

I work in a company where we are supposed to produce and send pipes using trucks to buyers. Pipes of smaller diameter can be nested inside pipes of larger diameter while sending to minimize number of ...
-2
votes
0answers
21 views

Convex Optimization Problem [on hold]

Can anyone please solve the following optimization problem? it should be solvable using lagrangian relaxation method.
1
vote
1answer
79 views

Optimization: KKT conditions statement

I'm currently following this material Optimization Theory: Chapter 2 Theory of Constrained Optimization And I can't understand why the following statement is true, between the equations (2.9) and ...
1
vote
0answers
17 views

Given the Hessian of a scalar function of two variables, find the function

Suppose we are given the Hessian of a scalar function of two variables, $\nabla^2_{f(x,y)}$, do there exist explicit formulas for finding $f(x,y)$? Attempt: Brute-Force method is to do double ...
1
vote
1answer
18 views

Choosing a surface that makes the flux of F maximal,

For a closed surface S in $R^3$, consider the flux of F, given by the usual flux integral. For what choice of S will the flux be maximal? So, I want to apply the divergence theorem and instead look ...
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 ...
4
votes
1answer
117 views

Module of the differential of a function

Given two triangles, $PQR$ and $P'Q'R'$ in $\mathbb{R}^2$, I want to find a bijection $f$ between $PQR$ and $P'Q'R'$ such that: 1) $f$ maps vertices in vertices and sides in sides (i.e. $P$ in $P'$, ...
0
votes
2answers
145 views

Calculus question with optimization homework

A piece of wire 30 m long is cut into two pieces. One piece is bent into a square and the other is bent into a circle. (a) How much of the wire should go to the square to maximize the total area ...
14
votes
1answer
430 views

Can a dynamic programming problem be transformed into a linear algebra problem?

Here is a simple standard economic problem: Let Robin Crusoe have an endowment $w_0$ of lembas bread. She is immortal and discounts at a rate of $\beta$ per period. Each period (from $t=0$ on) she ...
0
votes
1answer
859 views

Maximize linear equation with 2 variables

How do I maximize the following equation: $$ 150 \le 9.05x + 18.89y \\ \text{constraints: } \\ x > 0, y > 0 \\ \text{$x$ and $y$ must be whole numbers.} $$ I cannot use calculus to solve ...