This article is more than 3 years old. 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.

Fundamental Theorems Theorem 1 Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or ...

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 ...

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 ...