Types Of Optimal Solutions Research Articles

A principal–agent problem with heterogeneous demand distributions for a carbon capture and storage system

Mechanism design problems optimize contract offerings from a principal to different types of agents who have private information about their demands for a product or a service. We study the implications of uncertainty in agents’ demands on the principal’s contracts. Specifically, we consider the setting where agents’ demands follow heterogeneous distributions and the principal offers a menu of contracts stipulating quantities and transfer payments for each demand distribution. We present analytical solutions for the special case when there are two distributions each taking two discrete values, as well as a method for deriving analytical solutions from numerical solutions. We describe one application of the model in carbon capture and storage systems to demonstrate various types of optimal solutions and to obtain managerial insights.

Characterizations of set order relations and constrained set optimization problems via oriented distance function

Set-valued optimization problems are important and fascinating field of optimization theory and widely applied to image processing, viability theory, optimal control and mathematical economics. There are two types of criteria of solutions for the set-valued optimization problems: the vector criterion and the set criterion. In this paper, we adopt the set criterion to study the optimality conditions of constrained set-valued optimization problems. We first present some characterizations of various set order relations using the classical oriented distance function without involving the nonempty interior assumption on the ordered cones. Then using the characterizations of set order relations, necessary and sufficient conditions are derived for four types of optimal solutions of constrained set optimization problem with respect to the set order relations. Finally, the image space analysis is employed to study the c-optimal solution of constrained set optimization problems, and then optimality conditions and an alternative result for the constrained set optimization problem are established by the classical oriented distance function.

Analytical discrete stacking sequence optimization of rectangular composite plates subjected to buckling and FPF constraints

A special type of new discrete design variables is introduced in order to find optimal stacking sequences for laminated structures. Using the proposed new design variables, we demonstrate how to find analytical (i.e. without any numerical optimization algorithm) optimal solutions for laminates made of plies having three different fibre orientations: 0◦, ±45◦, 90◦. It is proved that the definition of design variables enables us to distinguish two types of optimal solutions, i.e. unimodal and bimodal ones. The form of optimal stacking sequences affects the multiplicity (bimodal problems) or uniqueness (unimodal problems) of the solutions. The decoding procedure between membrane and flexural design variables is also proposed. The results demonstrate the effectiveness, simplicity and advantages of the use of design variables, especially in the sense of the accuracy, repeatability of results and convergence of the method.

Optimal low-thrust transfers between close near-circular coplanar orbits

Four types of optimal solutions are demonstrated to exist for transfers (time of flight is not fixed) between close near-circular coplanar orbits. One solution is realized with the help of fixed orientation of the propulsion system (PS) along a transversal in the orbital coordinate system. Another is reached at fixed orientation of the PS in the inertial coordinate system. The third and fourth types of solutions change the PS orientation in the process of executing the maneuver. Regions of existence are established for all types of solutions, and algorithms for determination of parameters of these maneuvers are suggested. The algorithms were used to calculate parameters of the maneuvers of transfer from a launching orbit to a working Sun-synchronous orbit, and to calculate the maneuvers of supporting the parameters of such an orbit in a specified range.

A Robust Approach to Optimal Power Flow With Discrete Variables

Optimal power flow (OPF) belongs to the nonlinear optimization problem with discrete variables. The interior point cutting plane method (IPCPM), which possesses the advantages of both the interior point method and the cutting plane method, becomes a very promising approach to the large-scale OPF. It employs a successive linearization process and iteratively solves the mixed integer linear programming problem. However, case studies have shown that: if the problem has multiple solutions, the optimal solutions will converge to the interior of the optimal face, and the cutting planes cannot be generated due to the failure to identify the optimal base. This paper presents a new general optimal base identification method for solving the problem. The new approach significantly improves the robustness and efficiency of IPCPM. Simulation results on IEEE test systems indicate that the algorithm proposed can not only properly deal with various types of optimal solutions but also greatly enlarge the application area of IPCPM.

Least-weight plates with constrained taper

W. Prager pointed out that rib-like formations in numerically obtained least-weight plate solutions by Cheng and Olhoff have a similar layout to optimized grillage layouts, derived earlier by Rozvany and Prager. It was then shown analytically by Rozvany, Olhoff, Cheng and Taylor that minimum-weight plastically designed solid plates with a maximum thickness constraint contain ribs of theoretically infinitesimal spacing. The current paper is based on an idea by Niordson, who suggested that ribs in plate solutions can be avoided by prescribing the maximum slope of the thickness variation (taper). After deriving general optimality criteria for axisymmetric plates from variational principles, a built-in circular sandwich plate with a uniformly distributed load is considered. It is shown that, depending on the prescribed maximum value of the taper ( S), four types of optimal solutions are possible. For S = 0 and S ⩾ 0.38271605, the optimal solutions reduce to classical results derived by Hopkins and Prager and Onat, Schumann and Shield. All solutions are confirmed by four independent methods: 1. (a) static-kinematic optimality criteria based on variational principles; 2. (b) assumed topography and differential calculus; 3. (c) direct minimization; and 4. (d) dual formulation.