• Journal of the military operations research society of Korea
• /
• v.28 no.1
• /
• pp.47-66
• /
• 2002

Instead of using signal-to-noise ratio, we attempt to optimize both the mean and variance responses using dual response optimization technique. The alternative experimental strategy analyzes a robust parameter design problem to obtain the best settings that give a target condition on the mean while minimizing its variance. The mean and variance are treated as the two responses of interest to be optimized. Unlike to the crossed array and combined array approaches, our experimental setup requires replicated runs for each control factor's treatment under noise sampling. When the postulated response models are true, they enable the coefficients to be estimated and the desired performance measure to be analyzed more efficiently. The procedure and illustrative example are given for the dual response optimization techniques of nonlinear goal programming.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4595-4610
• /
• 2020

In the practical communication environment, the accurate channel state information (CSI) is difficult to obtain, which will cause the mismatch of resource and degrade the system performance. In this paper, to account for the channel uncertainties, a robust power allocation scheme for a downlink Non-orthogonal multiple access (NOMA) heterogeneous network (HetNet) is designed to maximize energy efficiency (EE), which can ensure the quality of service (QoS) of users. We conduct the robust optimization model based on worse-case method, in which the channel gains belong to certain ellipsoid sets. To solve the non-convex non-liner optimization, we transform the optimization problem via Dinkelbach method and sequential convex programming, and the power allocation of small cell users (SCUs) is achieved by Lagrange dual approach. Finally, we analysis the convergence performance of proposed scheme. The simulation results demonstrate that the proposed algorithm can improve total EE of SCUs, and has a fast convergence performance.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.16-26
• /
• 1989

The terminal layout problem is fundamental in may centralized computer networks, which is generated formulated as the capaciated minimum spanning tree problem (CMSTP). We present an implementation of the dual-based procedure to solve the CMSTP. Dual ascent procedure generates a good feasible solutions to the dual of the linear programming relaxation of CMSTP. A feasible primal solution to CMSTP can then be constructed based on this dual solution. This procedure can be used either as a stand-alone heuristic or, else, it can be incorporated into a branch and bound algorithm. A numerical result is given with quite favorable results.

• Journal of Korean Society for Quality Management
• /
• v.5 no.1
• /
• pp.23-29
• /
• 1977

Geometric programming is very useful for the solution of certain nonlinear programming problems in which the objective function and the constraints are posynomial expressions. By solving the dual program, it can be obtained that the solution of the primal program of Geometric programming. And, more efficient solution is to form an Augmented program possessing degree of difficult zero. A regional water-quality management problem may involve a multistage constrained optimization with many decision variables. In this problem, especially, appling that solution to it is also useful. This paper is described that : 1) the efficient solution of a water-quality management model formed by Geometric programming and 2) the algorithm developed to apply easily a real system by modifing and simplifing the solution.

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.359-375
• /
• 2014

In this paper, a multiobjective nondifferentiable fractional programming problem (MFP) is considered where the objective function contains a term involving the support function of a compact convex set. A vector valued (generalized) ${\alpha}$-univex function is defined to extend the concept of a real valued (generalized) ${\alpha}$-univex function. Using these functions, sufficient optimality criteria are obtained for a feasible solution of (MFP) to be an efficient or weakly efficient solution of (MFP). Duality results are obtained for a Mond-Weir type dual under (generalized) ${\alpha}$-univexity assumptions.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.245-257
• /
• 2009

A mixed type dual for multiobjective variational problem involving higher order derivatives is formulated and various duality results under generalized invexity are established. Special cases are generated and it is also pointed out that our results can be viewed as a dynamic generalization of existing results in the static programming.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.469-481
• /
• 1997

In this paper we consider TU-cooperative games in the form of characteristic function. We notice that if one uses the necessary and sufficient condition for the core to be not empty in a dual form, it may be used for selecting the final outcome in the core. Using the linear programming approach for constructing the subcore, which is a subset of the core, we represent it in a simple form. We consider reduced games due to Davis-Mashler, Moulin and Funaki and formulate the sufficient conditions for the subcore to be S-consistent.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.361-376
• /
• 2005

Optimality conditions are derived for a nonlinear fractional program in which a support function appears in the numerator and denominator of the objective function as well as in each constraint function. As an application of these optimality conditions, a dual to this program is formulated and various duality results are established under generalized convexity. Several known results are deduced as special cases.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.351-360
• /
• 2005

This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

• Bulletin of the Korean Chemical Society
• /
• v.28 no.12
• /
• pp.2489-2492
• /
• 2007