On Solving Bi-level Multi-Objective Fully Quadratic Fractional Optimization Model with Fuzzy Demands

This paper has been designed to introduce the method for solving the Bi-level Multi-objective (BL-MO) Fully Quadratic Fractional Optimization Model through Fuzzy Goal Programming (FGP) approach by utilising non-linear programming. In Fully Quadratic Fractional Optimization Model, the objective functions are in fractional form, having quadratic functions in both numerator and denominator subject to quadratic constraints set. The motive behind this paper is to provide a solution to solve the BL-MO optimization model in which number of decision-makers (DM) exists at two levels in the hierarchy. First, the fractional functions with fuzzy demand, which are in the form of fuzzy numbers, are converted into crisp models by applying the concept of α-cuts. After that, membership functions are developed which are corresponding to each decision-maker’s objective and converted into simpler form to avoid complications due to calculations. Finally, the model is simplified by applying FGP approach, and a compromised solution to the initial model is obtained. An algorithm, flowchart and example are also given at the end to explain the study of the proposed model.

Extending the Scope of Robust Quadratic Optimization

We derive computationally tractable formulations of the robust counterparts of convex quadratic and conic quadratic constraints that are concave in matrix-valued uncertain parameters. We do this for a broad range of uncertainty sets. Our results provide extensions to known results from the literature. We also consider hard quadratic constraints: those that are convex in uncertain matrix-valued parameters. For the robust counterpart of such constraints, we derive inner and outer tractable approximations. As an application, we show how to construct a natural uncertainty set based on a statistical confidence set around a sample mean vector and covariance matrix and use this to provide a tractable reformulation of the robust counterpart of an uncertain portfolio optimization problem. We also apply the results of this paper to norm approximation problems. Summary of Contribution: This paper develops new theoretical results and algorithms that extend the scope of a robust quadratic optimization problem. More specifically, we derive computationally tractable formulations of the robust counterparts of convex quadratic and conic quadratic constraints that are concave in matrix-valued uncertain parameters. We also consider hard quadratic constraints: those that are convex in uncertain matrix-valued parameters. For the robust counterpart of such constraints, we derive inner and outer tractable approximations.

On the Higher-Order Inhomogeneous Heisenberg Supermagnetic Models

This paper is concerned with the construction of the fifth-order inhomogeneous Heisenberg supermagnetic models. Moreover, the Lax representations of the models are presented. By means of the gauge transformation, we establish their gauge equivalent equations with different quadratic constraints, i.e., the super and fermionic fifth-order inhomogeneous nonlinear Schrödinger equations, respectively. In addition, we investigate their Lax representations and Bäcklund transformations from which the solutions of the super integrable systems have been discussed.

A Convex Optimization Approach for the Design of Supergain Electrically Small Antenna and Rectenna Arrays Comprising Parasitic Reactively Loaded Elements

<div><div><div><p>A convex optimization formulation is provided for antenna arrays comprising reactively loaded parasitic elements. The objective function consists of maximizing the array gain, while constraints on the admittance are provided in order to properly account for reactive loads. Topologies with two and three electrically small dipole arrays comprising one fed element and one or two parasitic elements respectively are considered and the conditions for obtaining supergain are investigated. The admittance constraints are formulated as linear constraints for specific cases as well as more general, quadratic constraints, which lead to the solution of an equivalent convex relaxation formulation. A design example for an electrically small superdirective rectenna is provided where an upper bound for the rectifier efficiency is simulated.</p></div></div></div>

A Convex Optimization Approach for the Design of Supergain Electrically Small Antenna and Rectenna Arrays Comprising Parasitic Reactively Loaded Elements

<div><div><div><p>A convex optimization formulation is provided for antenna arrays comprising reactively loaded parasitic elements. The objective function consists of maximizing the array gain, while constraints on the admittance are provided in order to properly account for reactive loads. Topologies with two and three electrically small dipole arrays comprising one fed element and one or two parasitic elements respectively are considered and the conditions for obtaining supergain are investigated. The admittance constraints are formulated as linear constraints for specific cases as well as more general, quadratic constraints, which lead to the solution of an equivalent convex relaxation formulation. A design example for an electrically small superdirective rectenna is provided where an upper bound for the rectifier efficiency is simulated.</p></div></div></div>