This interval is determined using linear programming techniques. Finally, bounding convex envelope approximating problems are constructed and solved globally over any remaining intervals. Intervals ...

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975 ...

This paper is devoted to studying a type of inverse second-order cone quadratic programming problems, in which the parameters in both the objective function and the constraint set of a given ...