2000 character limit reached
Multiple objective linear programming over the probability simplex (2412.19598v1)
Published 27 Dec 2024 in math.OC
Abstract: This paper considers the problem of maximizing multiple linear functions over the probability simplex. A classification of feasible points is indicated. A necessary and sufficient condition for a member of each class to be an efficient solution is stated. This characterization yields a computational procedure for ascertaining whether a feasible point is efficient. The procedure does not require that candidates for efficiency be extreme points. An illustration of the procedure is offered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.