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

The following problem is discussed: Is it possible to represent the nucleolus of an n-person game as a solution of a linear programming problem? An affirmative answer is given for the case that the ...

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