Stack Overflow
Stack Overflow

Questions tagged [convex]

Anything related to convex geometric shapes. A shape in an Euclidean space is convex if, given two points A and B, every point of the segment AB belongs to the shape, i.e. AB is a subset of the shape.

Anything related to convex geometric shapes.

A shape in an Euclidean space is convex if, given two points A and B, every point of the segment AB belongs to the shape, i.e. AB is a subset of the shape.

See Wikipedia on:

139 questions
0
votes
0 answers

How to resolve the error Exception from IBM ILOG CPLEX: CPLEX Error 5002: objective is not convex.?

minimize sum(j in tavail) (ptn[j]*1000000-pln[j]*1000000+sum(k in nport)pevch[j][k]-sum(k in nport)(DOD1[k][j]-dod[k][j])*cap[k][j]*1000) +(sum(j in tavail)(-sum(k in nport)(-32768*DOD1[k][j]+49546)*(DOD1[k][j]-dod[k][j])*cap[k][j]*1000-sum(k in…
haripriya
  • 21
  • 4
0
votes
0 answers

My largest bound violation is CPLEX showing in e^6 range. What does it indicates? But the solutions are within my expectations

The solution tab of my problem is as shown above. How can I interpret the quality of my model . Solutions are upto my expectations but the maximum bound infeasibility shows a larger value.nHow can I reduce the bound violation
haripriya
  • 21
  • 4
0
votes
1 answer

Termination condition infeasible for pyomo (solver glpk)

I am trying to solve a power flow optimisation with N-1 reliability constraint, which means that the power from the four generators can still supply the 8 loads through the remaining 17 power lines when 1 line is down. To solve this questions, I…
Bubblytwo
  • 3
  • 2
0
votes
1 answer

L1 regularisation in cplex

I am trying to perform optimization which uses the L1 regularisation method. However, I am using cplex and I do not see an obvious way of performing L1 regularisation when I use cplex. Can someone please help?
P. Khoza
  • 21
  • 4
0
votes
2 answers

Merging two Convex Hulls with minimum perimeter

assume that we have two (or more) convex hulls in the plane and we want merging them. but the convex hull result has minimum perimeter. is any algorithm available for this?
erfan30
  • 105
  • 7
0
votes
0 answers

How to constraint at most one element of variable vector could be non-zero in mosek?

I'm solving a problem like this: Variable X = {x0, x1} maximize AX + B subject to 0 <= x0 <= c0, 0 <= x1 <= c1, x0 * x1 <= 0 It's to say that, I want to get a solution of X with at most one non-zero…
Makai
  • 11
  • 1
0
votes
1 answer

How to determine the reference point of a Non-Fit Polygon for two convex polygons

I would like to calculate Non-Fit Polygon (NFP) for two convex polygons. I have read the article below and found an algorithm (Algorithm 1, pp. 18, See also the picture). https://www.diva-portal.org/smash/get/diva2:699750/FULLTEXT01.pdf Intuitively,…
kenmark
  • 1
  • 1
0
votes
1 answer

How to determine if Quadrilateral is convex or not by given points

Is there any way to determine whether quadrilateral is convex or not? (meaning each of its angles are less than 180 degree) by using points. For example A(0,0) B(2,0) C(2,2) D(-1,3). How can we determine that all of the angles in ABCD quadrilateral…
givexa
  • 109
  • 2
  • 10
0
votes
0 answers

Quadratic Form (quad_form) over Expressions in CVXPY

I am building risk term in a quadratic optimization problem (QP) using CVXPY and I'm struggling to combine expressions with a covariance matrix using quad_form. from cvxpy import Variable, quad_form from numpy import identity from pandas import…
rhaskett
  • 1,864
  • 3
  • 29
  • 48
0
votes
0 answers

Using matlab to find supremum and infimum of two variable function

I am writing a matlab program to find the convexity of a two variable function using its supremum and infimum This is the two variable function that i had f(x,y)=(x-2)^2 +(y-2)^2 and both x and y are from 0 to 4. The Code i wrote for plotting the…
wajid sharif
  • 11
  • 1
0
votes
2 answers

Find missing points in N dimensional grid

I've got an N dimensional (regular) grid with data, which doesn't fill it's volume completely, but should be convex. So, for example, in 2D this is okay (1=exists, 0=missing): 0011111100 0111111110 1111111111 0011111100 0000011100 But this is…
The_Fallen
  • 257
  • 1
  • 3
  • 10
0
votes
1 answer

Create convex path for outline provider

I try to create convex path for outline provider. I need a rectangular with rounded top left and top right corners. There are one method which able to do this, but question: what wrong with my convex path?. It draws on paint like a convex, and…
ins1der12111991
  • 146
  • 1
  • 4
0
votes
1 answer

C++: Why does this basic 2D Quickhull algorithm return points in the incorrect order?

The following is a C++ implementation of a 2D Quickhull algorithm for Convex Hulls taken from geeksforgeeks.org: https://www.geeksforgeeks.org/quickhull-algorithm-convex-hull/ #include using namespace std; // iPair is integer pairs…
Carl Artino
  • 77
  • 5
0
votes
1 answer

CPLEX says a sum of squares is not convex

I want to solve a maximisation problem with objective f(x, y, z) = 0.5 * (x^2 + y^2 + z^2) with x, y, z in [0, 1]. However when feeding this problem to CPLEX with the code below, it prompts an error saying that my objective is non-convex. Also I…
Xb19
  • 130
  • 2
  • 10
0
votes
1 answer

3D continuous moving AABB against static convex polyhedron collision detection

I am currently trying to implement a simple continuous collision detection system. I wondered whether it was possible, for a moving AABB, to compute the distance it can translate in an arbitrary direction d before it intersects a convex polyhedron.…
Marc Perlade
  • 123
  • 1
  • 7
1 2 3
…
9 10