Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  nonlinear programming
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

Decision maker's preferences modeling for multiple objective stochastic linear programming problems

100%
BELLAHCENE F.
Operations Research and Decisions
|
2019
|
vol. 29
|
issue 3
5-16
EN
A method has been suggested which solves a multiobjective stochastic linear programming problem with normal multivariate distributions in accordance with the minimum-risk criterion. The approach to the problem uses the concept of satisfaction functions for the explicit integration of the preferences of the decision-maker for different achievement level of each objective. Thereafter, a nonlinear deterministic equivalent problem is formulated and solved by the bisection method. Numerical examples with two and three objectives are given for illustration. The solutions obtained by this method are compared with the solutions given by other approaches.
2

Cost Optimal Project Scheduling

100%
Klanšek U., Pšunder M.
Organizacija
|
2008
|
vol. 41
|
issue 4
153-158
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.