This paper presents the essentials of a method designed to solve optimization problems whose objective functions are of the form g ( x )+ ψ ( u ( x )), where ψ is differentiable and either concave or convex. It is s...
详细信息
This paper presents the essentials of a method designed to solve optimization problems whose objective functions are of the form g ( x )+ ψ ( u ( x )), where ψ is differentiable and either concave or convex. It is shown that solutions to such problems can be obtained through the solutions of the Lagrangian problem whose objective function is of the form g ( x )+ λu ( x ).
Optimization problems requiring the minimization of pseudolinear functions and additive concave functions are examined from the standpoint of c-programming. A simple algorithm designed for pseudolinear problems is set...
详细信息
Optimization problems requiring the minimization of pseudolinear functions and additive concave functions are examined from the standpoint of c-programming. A simple algorithm designed for pseudolinear problems is set out, and an exlusionary rule for additive separable concave problems is formulated.
Ln this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the m...
详细信息
Ln this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kuno et al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]-[8] and its techniques.
In this paper we give a brief account of the important role that the conventional simplex method of linear programmingcan play in global optimization, focusing on its collaboration with composite concave programming ...
详细信息
In this paper we give a brief account of the important role that the conventional simplex method of linear programmingcan play in global optimization, focusing on its collaboration with composite concave programming techniques. In particular, we demonstrate how rich and powerful the c-programming format is in cases where its parametric problem is a standard linear programming problem.
In this short note we comment on the mean-standard deviation ratio problem analyzed recently by chung (1992) and present an alternative framework for its treatment. It is shown that this problem is just one of the man...
详细信息
Water-Decision Support System (DSS) tools enhance decision-makings towards improved water supply in a given region. The rigours of manual design of the conventional water treatment plants are easily eliminated with th...
详细信息
Water-Decision Support System (DSS) tools enhance decision-makings towards improved water supply in a given region. The rigours of manual design of the conventional water treatment plants are easily eliminated with the use of softwares as in the case of DSS. Therefore, this paper focuses on the development of a Water-DSS for design of treatment plant in Karkala Town, Udupi District of India. A four-decade population projection was made using the baseline data of 1971 till date. The manual computation for water demand, unit operations and adjoining facilities was carried out and later coded in c-programming language for development of a DSS for easier design and process selection. Data validation was done and results from the two approaches were compared. With the c-programming technique, a decision support tool for design and process selection of drinking water treatment plant using conventional method has been developed and named Water-DSS1. The designed tool is simple, accurate, flexible, efficient and universal, easily adaptable to any similar conventional treatment plant. Water-DSS1 is thus recommended for general use in ultimately alleviating water supply challenges.
A solution procedure is proposed for a class of deterministic sequential decision problems whose objective functions are of the form Σf n(x n)+Φ(Σg n(x n)) where Φ is differentiable and either concave or convex. T...
详细信息
A solution procedure is proposed for a class of deterministic sequential decision problems whose objective functions are of the form Σf class="a-plus-plus">n(x class="a-plus-plus">n)+Φ(Σg class="a-plus-plus">n(x class="a-plus-plus">n)) where Φ is differentiable and either concave or convex. The procedure calls for the collaboration between dynamicprogramming and c-programming, and is demonstrated in our treatment of a minimum variance type problem.
In this paper we report on numerical experiments with dynamicprogramming algorithms designed for solving problems with nonseparable objective functions of the c-programming type. The experiments were conducted with t...
详细信息
In this paper we report on numerical experiments with dynamicprogramming algorithms designed for solving problems with nonseparable objective functions of the c-programming type. The experiments were conducted with the view to evaluate the efficiency of c-programming's exclusionary rules when they are incorporated in the conventional parametric Lagrangian search method. Two classical nonseparable problems are considered: (1) the variance minimization problem and (2) the nonlinear fractional knapsack problem. The results indicate that the incorporation of c-programming's exclusionary rules in the Lagrangian procedure significantly improves the efficiency of the line search procedure.
In this paper a new teaching-learning-method including the LEGO Mindstorms EV3 is presented. This computer sciences course is part of the studies of mechatronics in the first two semesters. The programming language be...
详细信息
ISBN:
(纸本)9781479987078
In this paper a new teaching-learning-method including the LEGO Mindstorms EV3 is presented. This computer sciences course is part of the studies of mechatronics in the first two semesters. The programming language being mediated is ANSI-c. computer science is not the most popular subject in the interdisciplinary engineering field of mechatronics, therefore the EV3 should be included to increase motivation. For the new approach the former course - without the usage of EV3s - was evaluated and a competency profile was identified. On this basis a new didactical method was designed and implemented. The EV3 is programmed with the IDE Eclipse and with a self programmed plug-in.
作者：
SNIEDOVIcH, MCSIR
NATL RES INST MATH SCIPOB 395PRETORIA 0001SOUTH AFRICA
A new format is proposed for fractional programming problems. This format gives full expression to the fact that the parametric approach to fractional programming problems is rooted in a first-order necessary and suff...
详细信息
A new format is proposed for fractional programming problems. This format gives full expression to the fact that the parametric approach to fractional programming problems is rooted in a first-order necessary and sufficient optimality condition. It is thus shown that although traditionally it has not been construed as such, the parametric approach is in fact classical par excellence. [ABSTRAcT FROM AUTHOR]
暂无评论