Study on multi-objective nonlinear programming problem with rough parameters

Rough set theory, introduced by Pawlak in 1981, is one of the important theories to express the vagueness not by means of membership but employing a boundary region of a set, i.e., an object is approximately determined based on some knowledge. In our real-life, there exists several parameters which impact simultaneously on each other and hence dealing with such different parameters and their conflictness create a multi-objective nonlinear programming problem (MONLPP). The objective of the paper is to deal with a MONLPP with rough parameters in the constraint set. The considered MONLPP with rough parameters are converted into the two-single objective problems namely, lower and upper approximate problems by using the weighted averaging and the ɛ- constraints methods and hence discussed their efficient solutions. The Karush-Kuhn-Tucker’s optimality conditions are applied to solve these two lower and upper approximate problems. In addition, the rough weights and the rough parameter ɛ are determined by the lower and upper the approximations corresponding each efficient solution. Finally, two numerical examples are considered to demonstrate the stated approach and discuss their advantages over the existing ones.

Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Flood Control Problem Example

The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of an optimal discrete-time flood control problem formulated as a nonlinear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, e.g. simplicity and intuitiveness of implementation.

Constrained Spacecraft Attitude Optimal Control via Successive Convex Optimization

Rapid attitude path planning is the key technique in autonomous spacecraft operation missions. An efficient method is proposed for energy-optimal spacecraft attitude control in presence of constraints. Firstly, Gauss pseudospectral method is utilized to discretize and transcribe the primal continuous problem to a nonlinear programming problem. Then a set of convexification techniques are used to convexity the nonlinear programming problem to a series of second-order cone programming problems, which can be solved iteratively by the interior-point method. A solution to the nonlinear programming problem is obtained as the iteration converges. Numerical results show the method could obtain a valid energy-optimal attitude control plan more rapidly than traditional methods.

A Manipulation Game Based on Machiavellian Strategies

This paper suggests a manipulation game based on Machiavellianism, which is characterized by three concepts: views, tactics, and immorality. We consider a framework where manipulating players can partially control manipulated players’ information and affect both manipulated players’ information and their allocations. The parties involved are constrained both by adverse selection and moral hazard (immorality) restricted to a class of ergodic Bayesian–Markov problems. We investigate a mechanism that maximize the probability that the manipulated players accept the proposal of the manipulators. We show that a mechanism exists and can be found by solving a nonlinear programming problem for a set of constraints. The mechanism is obtained by introducing an auxiliary variable in the nonlinear programming problem and we develop the relations needed to derive the variables of interest. For the manipulation process, players learn their behavior through a sequence of interactions in a repeated game. The manipulators possess and benefit from some commitment power, which describes the distinctive nature of a manipulation game (views). Then, we represent the game using a Stackelberg model. We also compute the Stackelberg equilibrium (tactics) for our game of incomplete information. This novel perspective is of interest for the Bayesian manipulation and persuasion literature. A simulation and analysis over an example for manipulating emotions in negotiation verify the applicability of proposed model.

Controlled Change in the Dimensions of an Axisymmetric Spacecraft Descending in the Atmosphere of Mars

In the presented work, a controlled change by dimensions of a spacecraft descending in the atmosphere of Mars is considered. The aim of the work is to obtain a method for calculating the mass and mass-geometric characteristics of a spacecraft when changing its dimensions, which provides angular velocity passive control during the descent of this spacecraft in a low-density atmosphere. In the process of solving this problem, the geometric and mass-geometric characteristics of the descent spacecraft (volume, cross-sectional area, moments of inertia) were calculated. It is assumed that the outer shape of the spacecraft posterior to the incoming flow is a one-sheet rotational hyperboloid, which changes its dimensions during the spacecraft descent in the low-density atmosphere of Mars. As a result of solving the nonlinear programming problem, the minimum and maximum values of the main axial moments of inertia are obtained, which able to spin the spacecraft relative to the longitudinal axis of symmetry. The initial data for solving the nonlinear programming problem are the minimum volume and the maximum cross-sectional area of the hyperboloid, calculated according to the specified intervals of the variable controlling the dimensions of this surface. The method for calculating the mass and mass-geometric characteristics of a spacecraft when changing its dimensions ispresented, which makes it possible to control the magnitude of the angular velocity of a symmetric spacecraft in the low-density atmosphere of Mars without the use of onboard jet engines. In particular, it is shown in the work that as the height of the hyperboloid increases, the moment of inertia about the spacecraft longitudinal axis of symmetry decreases, accompanied by an increase in the moments of inertia about the transverse axes of symmetry. It can be shown that in this case there is an increase in the angular velocity of the spacecraft about the longitudinal axis, which makes it possible to achieve a stable orientation of the spacecraft upon entering the atmosphere. However, a more detailed study of the dynamics ofthe spacecraft relative motionwith a changeable shape in the atmosphere is beyond the scope of this work, but it can be presented in further publications.

Trust-Region Based Penalty Barrier Algorithm for Constrained Nonlinear Programming Problems: An Application of Design of Minimum Cost Canal Sections

In this paper, a penalty method is used together with a barrier method to transform a constrained nonlinear programming problem into an unconstrained nonlinear programming problem. In the proposed approach, Newton’s method is applied to the barrier Karush–Kuhn–Tucker conditions. To ensure global convergence from any starting point, a trust-region globalization strategy is used. A global convergence theory of the penalty–barrier trust-region (PBTR) algorithm is studied under four standard assumptions. The PBTR has new features; it is simpler, has rapid convergerce, and is easy to implement. Numerical simulation was performed on some benchmark problems. The proposed algorithm was implemented to find the optimal design of a canal section for minimum water loss for a triangle cross-section application. The results are promising when compared with well-known algorithms.

Nucleolus of Vague Payoff Cooperative Game

This paper focuses on the problem of cooperative game with payoff of vague value and its nucleolus. Firstly, the paper defines the score function and accuracy function of vague sets and the method for ranking of vague sets and proposes the concept of core and nucleolus of vague payoff cooperative game. Based on this, the model of vague payoff cooperative game is built. Then, the relationship between the core and the nucleolus of vague payoff cooperative game is further discussed, and the existence and unique characteristics of the nucleolus are proved. We use the ranking method defined in the paper to transform the problem of finding the nucleolus solution into a nonlinear programming problem. Finally, the paper verifies the feasibility and effectiveness of the method for finding the nucleolus with an experimental analysis.

Approaches for Solving Fully Fuzzy Rough Multi-Objective Nonlinear Programming Problems

Practical nonlinear programming problem often encounters uncertainty and indecision due to various factors that cannot be controlled. To overcome these limitations, fully fuzzy rough approaches are applied to such a problem. In this paper, an effective two approaches are proposed to solve fully fuzzy rough multi-objective nonlinear programming problems (FFRMONLP) where all the variables and parameters are fuzzy rough triangular numbers. The first, based on a slice sum technique, a fully fuzzy rough multi-objective nonlinear problem has turned into five equivalent multi-objective nonlinear programming (FFMONLP) problems. The second proposed method for solving FFRMONLP problems is α-cut approach, where the triangular fuzzy rough variables and parameters of the FFRMONLP problem are converted into rough interval variables and parameters by α-level cut, moreover the rough MONLP problem turns into four MONLP problems. Furthermore, the weighted sum method is used in both proposed approaches to convert multi-objective nonlinear problems into an equivalent nonlinear programming problem. Finally, the effectiveness of the proposed procedure is demonstrated by numerical examples.

Geodesic $ \mathcal{E} $-prequasi-invex function and its applications to non-linear programming problems

<p style='text-indent:20px;'>In this article, we define a new class of functions on Riemannian manifolds, called geodesic <inline-formula><tex-math id="M2">\begin{document}$ \mathcal{E} $\end{document}</tex-math></inline-formula>-prequasi-invex functions. By a suitable example it has been shown that it is more generalized class of convex functions. Some of its characteristics are studied on a nonlinear programming problem. We also define a new class of sets, named geodesic slack invex set. Furthermore, a sufficient optimality condition is obtained for a nonlinear programming problem defined on a geodesic local <inline-formula><tex-math id="M3">\begin{document}$ \mathcal{E} $\end{document}</tex-math></inline-formula>-invex set.</p>