USING ENTERPRISE INFORMATION ARCHITECTURE METHODS TO MODEL WICKED PROBLEMS IN INFORMATION SYSTEMS DESIGN RESEARCH

Design Science is the process of solving ‘wicked problems’ through designing, developing, instantiating, and evaluating novel solutions (Hevner, March, Park and Ram, 2004). Wicked problems are described as agent finitude in combination with problem complexity and normative constraint (Farrell and Hooker, 2013). In Information Systems Design Science, determining that problems are ‘wicked’ differentiates Design Science research from Solutions Engineering (Winter, 2008) and is a necessary part of proving the relevance to Information Systems Design Science research (Hevner, 2007; Iivari, 2007). Problem complexity is characterised as many problem components with nested, dependent and co-dependent relationships interacting through multiple feedback and feed-forward loops. Farrell and Hooker (2013) specifically state for wicked problems “it will often be impossible to disentangle the consequences of specific actions from those of other co-occurring interactions”. This paper discusses the application of an Enterprise Information Architecture modelling technique to disentangle the wicked problem complexity for one case. It proposes that such a modelling technique can be applied to other wicked problems and can lay the foundations for proving relevancy to DSR, provide solution pathways for artefact development, and aid to substantiate those elements required to produce Design Theory

Multidimensional Constrained Global Optimization in Domains with Computable Boundaries

Multidimensional constrained global optimization problem with objective function under Lipschitz condition and constraints generating a feasible domain with computable boundaries is considered. For solving this problem the dimensionality reduction approach on the base of the nested optimization scheme is used. This scheme reduces initial multidimensional problem to a family of one-dimensional subproblems and allows applying univariate methods for the execution of multidimensional optimization. Sequential and parallel modifications of well-known information-statistical methods of Lipschitz optimization are proposed for solving the univariate subproblems arising inside the nested scheme in the case of domains with computable boundaries. A comparison with classical penalty function method being traditional means of taking into account the constraints is carried out. The results of experiments demonstrate a significant advantage of the methods proposed over the penalty function method

Software tools for stochastic programming: A Stochastic Programming Integrated Environment (SPInE)

SP models combine the paradigm of dynamic linear programming with modelling of random parameters, providing optimal decisions which hedge against future uncertainties. Advances in hardware as well as software techniques and solution methods have made SP a viable optimisation tool. We identify a growing need for modelling systems which support the creation and investigation of SP problems. Our SPInE system integrates a number of components which include a flexible modelling tool (based on stochastic extensions of the algebraic modelling languages AMPL and MPL), stochastic solvers, as well as special purpose scenario generators and database tools. We introduce an asset/liability management model and illustrate how SPInE can be used to create and process this model as a multistage SP application

Solving the Monge-Amp\`ere Equations for the Inverse Reflector Problem

The inverse reflector problem arises in geometrical nonimaging optics: Given a light source and a target, the question is how to design a reflecting free-form surface such that a desired light density distribution is generated on the target, e.g., a projected image on a screen. This optical problem can mathematically be understood as a problem of optimal transport and equivalently be expressed by a secondary boundary value problem of the Monge-Amp\`ere equation, which consists of a highly nonlinear partial differential equation of second order and constraints. In our approach the Monge-Amp\`ere equation is numerically solved using a collocation method based on tensor-product B-splines, in which nested iteration techniques are applied to ensure the convergence of the nonlinear solver and to speed up the calculation. In the numerical method special care has to be taken for the constraint: It enters the discrete problem formulation via a Picard-type iteration. Numerical results are presented as well for benchmark problems for the standard Monge-Amp\`ere equation as for the inverse reflector problem for various images. The designed reflector surfaces are validated by a forward simulation using ray tracing.Comment: 28 pages, 8 figures, 2 tables; Keywords: Inverse reflector problem, elliptic Monge-Amp\`ere equation, B-spline collocation method, Picard-type iteration; Minor revision: reference [59] to a recent preprint has been added and a few typos have been correcte

Scheduling Jobs in Flowshops with the Introduction of Additional Machines in the Future

This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/expert-systems-with-applications/.The problem of scheduling jobs to minimize total weighted tardiness in flowshops,\ud with the possibility of evolving into hybrid flowshops in the future, is investigated in\ud this paper. As this research is guided by a real problem in industry, the flowshop\ud considered has considerable flexibility, which stimulated the development of an\ud innovative methodology for this research. Each stage of the flowshop currently has\ud one or several identical machines. However, the manufacturing company is planning\ud to introduce additional machines with different capabilities in different stages in the\ud near future. Thus, the algorithm proposed and developed for the problem is not only\ud capable of solving the current flow line configuration but also the potential new\ud configurations that may result in the future. A meta-heuristic search algorithm based\ud on Tabu search is developed to solve this NP-hard, industry-guided problem. Six\ud different initial solution finding mechanisms are proposed. A carefully planned\ud nested split-plot design is performed to test the significance of different factors and\ud their impact on the performance of the different algorithms. To the best of our\ud knowledge, this research is the first of its kind that attempts to solve an industry-guided\ud problem with the concern for future developments