No abstract

No abstract

Abstract. The aim of this paper is to present the suitability of three different global optimization methods for specifically the exact optimum solution of the nonlinear transportation problem (NTP). The evaluated global optimization methods include the branch and reduce method, the branch and cut method and the combination of global and local search strategies. The considered global optimization methods were applied to solve NTPs with reference to literature. NTPs were formulated as nonlinear programming (NLP) optimization problems. The obtained optimal results were compared with those got from literature. A comparative evaluation of global optimization methods is presented at the end of the paper to show their suitability for solving NTPs.

The focus of this paper is to represent some important mobile computing potential which help tackle project collaboration and information dissemination problems. Especially in the construction industry where workers have no steady working places mobile computing is shown as a chance for optimising the traditional ways of organizing Construction Company. Special attention is given to the description of changing the current information system as well as to the hierarchical organization structure based on mobile computing. Applying the “reengineering” as a tool forward business reorganization, optimised network organizational structure for Construction Company is being designed. Using our flat organization structure project partners can decide directly about particular matters and thus optimal decision-making is ensured. Therefore, certain decisions can be made in due time and nearer to the point in the organization structure. As a result of study, our findings about the cost/time savings are represented

This paper presents the cost optimal project scheduling. The optimization was performed by the nonlinear programming approach, NLP. The nonlinear total project cost objective function is subjected to the rigorous system of the activity precedence relationship constraints, the activity duration constraints and the project duration constraints. The set of activity precedence relationship constraints was defined to comprise Finish-to-Start, Start-to-Start, Start-to-Finish and Finish-to-Finish precedence relationships between activities. The activity duration constraints determine relationships between minimum, maximum and possible duration of the project activities. The project duration constraints define the maximum feasible project duration. A numerical example is presented at the end of the paper in order to present the applicability of the proposed approach.