We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as a composition of ...

A natural optimization model that formulates many online resource allocation problems is the online linear programming (LP) problem in which the constraint matrix is revealed column by column along ...

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