In linear programming, the objective function is the function that it is desired to maximize or minimize. The human interaction equivalent is what matters most.

In this paper we propose a stochastic programming model which considers the distribution of an objective function and probabilistic constraints. Applying it to a transportation type problem, we derive ...

Classification of diet models We distinguish between two classes: 1 Single-objective problems: minimize (or maximize) one linear function of Xi: Minimize.

A two-person, noncooperative game in which the players move in sequence can be modeled as a bilevel optimization problem. In this paper, we examine the case where each player tries to maximize the ...