Recently the author has given a duality theorem in multiple objective programming relating properly efficient solutions of the primal and dual problems. In this note the converse of that theorem is given showing that,...
详细信息
Recently the author has given a duality theorem in multiple objective programming relating properly efficient solutions of the primal and dual problems. In this note the converse of that theorem is given showing that, under certain assumptions, a properly efficient solution of the dual is also a properly efficient solution of the primal.
DsbA (disulfide bond formation protein A) is essential for disulfide bond formation directly affecting the nascent peptides folding to the correct conformation in vivo. In this paper, recombinant DsbA protein was empl...
详细信息
DsbA (disulfide bond formation protein A) is essential for disulfide bond formation directly affecting the nascent peptides folding to the correct conformation in vivo. In this paper, recombinant DsbA protein was employed to catalyze denatured lysozyme refolding and inhibit the aggregation of folding intermediates in vitro. Statistical methods, i.e., Plackett-Burman design and small central composite design, were adopted to screen out important factors affecting the refolding process and correlating these parameters with the refolding efficiency including both protein recovery and specific activity of refolded lysozyme. Four important parameters: initial lysozyme concentration, urea concentration. KCl concentration and GSSG (glutathione disulfide) concentration were picked out and operating conditions were optimized by introducing the effectiveness coefficient method and transforming the multiple objective programming into an ordinary constrained optimization issue. Finally, 99.7% protein recovery and 25,600 U/mg specific activity of lysozyme were achieved when 281.35 mu g/mL denatured lysozyme refolding was catalyzed by an equivalent molar of DsbA at the optimal settings. The results indicated that recombinant DsbA protein could effectively catalyze the oxidized formation and reduced isomerization of intramolecular disulfide bonds in the refolding of lysozyme in vitro. (C) 2012 Elsevier Ltd. All rights reserved.
Compromise solutions, as feasible points as close as possible to the ideal (utopia) point, are important solutions in multiple objective programming. It is known in the literature that each compromise solution is a pr...
详细信息
Compromise solutions, as feasible points as close as possible to the ideal (utopia) point, are important solutions in multiple objective programming. It is known in the literature that each compromise solution is a properly efficient solution if the sum of the image set and conical ordering cone is closed. In this paper, we prove the same result in a general setting without any assumption.
This study proposed a multiple objective programming method to solve assortment and packing problems. Instead of using a two-stage method, as proposed by Li & Tsai [7], this study integrated the two stages into a ...
详细信息
This study proposed a multiple objective programming method to solve assortment and packing problems. Instead of using a two-stage method, as proposed by Li & Tsai [7], this study integrated the two stages into a multipleobjective program to address assortment problems in one application. Moreover, this method could be extended to solve packing problems containing fewer 0-1 variables, thus, compared with Li et al. [8] the performance time of the proposed method could be decreased. The numerical examples showed that the proposed method is more efficient than Li & Tsai's [7], and Li et al.' s approaches [8].
The procedure samples the efficient set by computing the nondominated criterion vector that is closest to an ideal criterion vector according to a randomly weighted Tchebycheff metric. Using ‘filtering’ techniques, ...
详细信息
The procedure samples the efficient set by computing the nondominated criterion vector that is closest to an ideal criterion vector according to a randomly weighted Tchebycheff metric. Using ‘filtering’ techniques, maximally dispersed representatives of smaller and smaller subsets of the set of nondominated criterion vectors are presented at each iteration. The procedure has the advantage that it can converge to non-extreme final solutions. Especially suitable for multipleobjective linear programming, the procedure is also applicable to integer and nonlinear multipleobjective programs.
In this paper, we propose a simple linear multiple objective programming to deal with the fuzzy shortest path problem. The proposed approach does not need to declare 0-1 variables to solve the fuzzy shortest path prob...
详细信息
In this paper, we propose a simple linear multiple objective programming to deal with the fuzzy shortest path problem. The proposed approach does not need to declare 0-1 variables to solve the fuzzy shortest path problem because it meets the requirements of the network linear programming constraints. Therefore, the linear programming relaxation can be used to arrive at an integer solution without using the Branch and Bound technique, and the complexity of our proposed method can be reduced. A compromising non-dominated integer optimal solution, the fuzzy shortest path, can be obtained easily without adding extra constraints. This approach not only can obtain a fuzzy shortest path but also can reduce the complexity of solving the basic fuzzy shortest path problem without using 0-1 variables. Three examples with trapezoidal and triangular fuzzy numbers in arc length are used to demonstrate the proposed method in more details.
One of the essential problems of aerospace batch production management is to ensure that production material is supplied in time, and to strengthen the control management of suppliers. A Supplier selection mode of aer...
详细信息
ISBN:
(纸本)9780769538433
One of the essential problems of aerospace batch production management is to ensure that production material is supplied in time, and to strengthen the control management of suppliers. A Supplier selection mode of aerospace batch production is presented based on multiple objective programming theories. The principle, absolutely, restrictive condition and objectively restrictive condition are analyzed, according to the real demand in development suppliers' selection. Results showed that the method is valid to improve the performance of supplier selection by an existence.
Considering the restriction of physical resource and the environment, we propose a new broadcast path algorithm based on genetic algorithm and ideal point model. The proposed algorithm combines multiple constrains and...
详细信息
ISBN:
(纸本)9783037851371
Considering the restriction of physical resource and the environment, we propose a new broadcast path algorithm based on genetic algorithm and ideal point model. The proposed algorithm combines multiple constrains and utilizes the advantages of genetic algorithm in multiple objective programming. Simulation results show that the proposed algorithm reveal better performance on efficiency resource utilization.
In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection f...
详细信息
In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection function as the ideal value. Then, we construct a lexicographic order for the compromise (differences) between the ideal values and objective functions. Based on the usually lexicographic optimality structure, we discuss some theoretical properties about our approach and derive a constructing algorithm to compute such a lexicographic optimal solution.
A nonlinear multiple objective programming problem is considered where the functions involved are nondifferentiable. By considering the concept of weak minima, the Fritz John type and Karush-Kuhn-Tucker type necessary...
详细信息
A nonlinear multiple objective programming problem is considered where the functions involved are nondifferentiable. By considering the concept of weak minima, the Fritz John type and Karush-Kuhn-Tucker type necessary optimality conditions and Wolfe and Mond-Weir type duality results are given in terms of the right differentials of the functions. The duality results are stated by using the concepts of generalized semilocally convex functions.
暂无评论