In this paper we study the problem of optimization over an integer efficient set of a Multiple Objective Integer Linear Stochastic Programming problem. Once the problem is converted into a deterministic one by adapting the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$2$$</EquationSource> </InlineEquation>-levels recourse approach, a new pivoting technique is applied to...</equationsource></inlineequation>

The planning and management decisions often involve multiple objectives and multiple parties with conflicting interests due to the complexity of inter-basin water transfer systems. In this paper, the objectives, the groups involved and the corresponding conflicting interests that characterize...

We propose a steepest descent method for unconstrained multicriteria optimization and a “feasible descent direction” method for the constrained case. In the unconstrained case, the objective functions are assumed to be continuously differentiable. In the constrained case, objective and...

We study increasing quasiconcave functions which are co-radiant. Such functions have frequently been employed in microeconomic analysis. The study is carried out in the contemporary framework of abstract convexity and abstract concavity. Various properties of these functions are derived. In...

We give a generic regularity condition under which each weakly efficient decision making unit in the CCR model of data envelopment analysis is also CCR-efficient. Then we interpret the problem of finding maximal parameters which preserve efficiency of CCR-efficient DMUs under directional...

This paper presents a formalization and modification of Martin Seligman’s concept of full life, employing basic microeconomics. A class of Stone–Geary utility functions is proposed as an analytical tool for scrutinizing individual decision making with respect to a pleasant, engaged and...

A simple augmented ∊-constraint (SAUGMECON) method is put forward to generate all non-dominated solutions of multi-objective integer programming (MOIP) problems. The SAUGMECON method is a variant of the augmented ∊-constraint (AUGMECON) method proposed in 2009 and improved in 2013 by...

We study appointment scheduling problems in continuous time. A finite number of clients are scheduled such that a function of the waiting time of clients, the idle time of the server, and the lateness of the schedule is minimized. The optimal schedule is notoriously hard to derive within...

In service systems, in order to balance the server’s idle times and the customers’ waiting times, one may fix the arrival times of the customers beforehand in an appointment schedule. We propose a procedure for determining appointment schedules in such a D/G/1-type of system by sequentially...

In most multi-objective optimization problems we aim at selecting the most preferred among the generated Pareto optimal solutions (a subjective selection among objectively determined solutions). In this paper we consider the robustness of the selected Pareto optimal solution in relation to...