Resolution of dilemmas: A mathematical theory

A mathematical formulation for a dilemma (i.e. a situation in which a very difficult choice between two alternatives must be made) is given. Multiple-objective programming is assumed as the model for a single decision maker. It is shown that, in principle, any dilemma is resolvable. Furthermore, there is always more than one way in which to resolve a dilemma. Illustrative examples from non-convex optimization are presented.     

On the Structure of the Non-dominated Set for Bicriteria Programmes

In multiple-objective programming, a knowledge of the structure of the non-dominated set can aid in generating efficient solutions. We present new concepts which allow for a better understanding of the structure of the set of non-dominated solutions for non-convex bicriteria programming problems. In particular, a means of determining whether or not this set is connected is examined. Both supersets and newly defined subsets of the non-dominated set are utilized in this investigation. Of additional value is the use of the lower envelope of the set of outcomes in classifying feasible points as (properly) non-dominated solutions.     

Using Lexicographic Parametric Programming for Searching a Non-dominated Set in Multiple-Objective Linear Programming

In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the paper. The use of the approach is illustrated with a numerical example.     

Sets and Classes as Many

In this paper the view is developed that classes should not be understood as individuals, but, rather, as classes as many of individuals. To correlate classes with individuals labelling and colabelling functions are introduced and sets identified with a certain subdomain of the classes on which the labelling and colabelling functions are mutually inverse. A minimal axiomatization of the resulting system is formulated and some of its extensions are related to various systems of set theory, including nonwellfounded set theories.     

The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory

Andrzej Kisielewicz has proposed three systems of double extension set theory of which we have shown two to be inconsistent in an earlier paper. Kisielewicz presented an argument that the remaining system interprets ZF, which is defective: it actually shows that the surviving possibly consistent system of double extension set theory interprets ZF with Separation and Comprehension restricted to ₀ formulas. We show that this system does interpret ZF, using an analysis of the structure of the ordinals.     

The planning and execution of sequential eye movements: saccades do not show the one target advantage

The present experiment examined the one-target advantage (OTA) with regard to saccadic eye movements. The OTA, previously found with manual pointing responses, refers to the finding that movements are executed faster when the limb is allowed to stop on the target compared to the situation where it has to proceed and hit a second target. Using an adapted limb movement OTA task, saccades of 5 degrees and 15 degrees were made to (a) a single target (one-target), (b) one target and immediately to another target without a change in direction (two-target-extension), and (c) one target and immediately back to the start location (two-target-reversal). Unlike manual movements, the movement times for the initial saccade in the two-target-extension condition were not prolonged compared to either of the other two conditions. Moreover, this pattern of results was found for both the shorter and longer amplitude saccades. The results indicate that the OTA does not occur in the oculomotor system and therefore is not a general motor control phenomenon.     

Closing the gap between behavior and models in route choice: The role of spatiotemporal constraints and latent traits in choice set formation

A considerable gap exists between the behavioral paradigm of choice set formation in route choice and its representation in route choice modeling. While travelers form their viable choice set by retaining routes that satisfy spatiotemporal constraints, existing route generation techniques do not account for individual-related spatiotemporal constraints. This paper reduces the gap by proposing a route choice model incorporating spatiotemporal constraints and latent traits. The proposed approach combines stochastic route generation with a latent variable semi-compensatory model representing constraint-based choice set formation followed by compensatory choice. The model is applied to data focusing on habitual commuting route choice behavior in morning peak hours. Results show (i) the possibility of inferring spatiotemporal constraints from considered routes, (ii) the importance of incorporating spatiotemporal constraints and latent traits in route choice models, and (iii) the linkage between spatiotemporal constraints and time saving, spatial and mnemonic abilities.     

A Fuzzy Goal Programming Formulation with Multiple Target Levels

The essential activity of a manager is decision making, which is becoming more and more complex, mainly in the multi‐criteria problems. Multi‐choice goal programming (MCGP) is considered as a robust tool in operational research to solve this type of problem. However, in real world problems, determining precise targets for the goals is a difficult task. To deal with such situation, Tabrizi introduced and used in 2012 the concept of membership functions in the MCGP model in order to model the targets fuzziness of each goal. In their model, they considered just only one type of functions (triangular form), which does not reflect adequately the decision maker's preferences that are considered as an essential element for modelling the goal's fuzziness. Their model is called Fuzzy MCGP. In this paper, new ideas are presented to reformulate MCGP model to tackle all types of functions by introducing the (decision maker's) preferences. The concept of indifference thresholds is used in the new formulation for characterizing the imprecision and the preferences associated with all types of the goals. The proposed formulation provides useful insight about the solution of a new class of problems. A numerical example is given to demonstrate the validity and strength of the new formulation. Copyright © 2013 John Wiley & Sons, Ltd.