Maximum sum on segments
Source:
September 24, 2014
combinatorics unsolvedcombinatorics
Problem Statement
points are placed on a circumference. On each of the segments with end points on two of the points is written a non-negative real number. For any convex polygon with vertices on some of the points, the sum of the numbers written on their sides is less or equal than . Find the maximum possible value for the sum of all the written numbers.