• No results found

dual problem

Seeking the Optimal Solution to Bilevel Linear Programming by Dual Problem

Seeking the Optimal Solution to Bilevel Linear Programming by Dual Problem

... upper-level problem, then solved single level mathematical programming problem first in order to get the optimal solution of the original ...the dual problem’s constrained domain; this undoubtedly ...

5

On vector matrix game and symmetric dual vector optimization problem

On vector matrix game and symmetric dual vector optimization problem

... symmetric dual problem for a nonlinear vector optimization problem is ...symmetric dual problem and its related vector matrix ...

8

A Comparative study on Algorithms for Shortest-Route Problem and Some Extensions

A Comparative study on Algorithms for Shortest-Route Problem and Some Extensions

... shortest-route problem determines shortest routes from one node to ...route problem as a linear programming problem and solved it as a 0-1 integer programming ...The dual of the formulated ...

11

Higher Order Weakly Generalized Adjacent Epiderivatives and Applications to Duality of Set Valued Optimization

Higher Order Weakly Generalized Adjacent Epiderivatives and Applications to Duality of Set Valued Optimization

... type dual problem and a higher-order Wolfe type dual problem to a constrained set-valued optimization problem and establish corresponding weak duality, strong duality and converse ...

18

Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users

Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users

... general problem of optimal allocation of limited resources in a wireless telecommunication ...optimization problem with balance and capacity ...this problem, which exploit its special ...the ...

15

Linear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption

Linear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption

... In this paper we generalize the framework of the Feasible Descent Method (FDM) to a Randomized (R-FDM) and a Randomized Coordinate-wise Feasible Descent Method (RC- FDM) framework. We show that many machine learning ...

24

On the dual of a mixed H2/l1 optimisation problem

On the dual of a mixed H2/l1 optimisation problem

... maximisation problem called dual, involving a different variable, which attains the same optimal value as the original problem called ...the dual problem can be interpreted as the ...

8

Dual and Partial Primal Solution for Solving Linear Sum Feasible Fuzzy Assignment Problem

Dual and Partial Primal Solution for Solving Linear Sum Feasible Fuzzy Assignment Problem

... a dual and partial Primal feasible fuzzy assignment problem which cost coefficient is -Trapezoidal fuzzy ...programming problem of the fuzzy assignment problem is converted into fuzzy ...

7

On ϵ solutions for robust fractional optimization problems

On ϵ solutions for robust fractional optimization problems

... fractional dual prob- lem (RFD) for a robust fractional problem (RFP) in the convex constraint functions with uncertainty is ...the dual problem using opti- mality condition in Theorem ...

21

Discrete-Time Constrained Portfolio Optimization: Strong Duality Analysis

Discrete-Time Constrained Portfolio Optimization: Strong Duality Analysis

... A crucial question is the existence guarantee of such a  ˆ for achieving strong duality. Pliska states the following in [1]: The obvious candidate for such a  ˆ is  * , the solution of the dual problem ...

8

Duality in linear programming

Duality in linear programming

... the dual problem express the fact that if the value of the inputs incorporated in a product is lower than the product’s price, it is more advantageous to sell the products instead of the ...

10

Optimality and duality results for a nondifferentiable multiobjective fractional programming problem

Optimality and duality results for a nondifferentiable multiobjective fractional programming problem

... fractional problem has been estab- ...type dual problem corresponding to the multiobjective nondifferentiable fractional programming problem and established usual duality relations under the ...

18

Duality without constraint qualification in nonsmooth optimization

Duality without constraint qualification in nonsmooth optimization

... optimization problem with inequal- ity ...the dual problem corresponding to the primal problem, and some duality results are obtained without a constraint ...

11

Performance of Three Preconditioners for Image Deblurring Problem in Primal-Dual Formulation

Performance of Three Preconditioners for Image Deblurring Problem in Primal-Dual Formulation

... Since the coefficient matrix C is symmetric but not positive definite, the suitable Krylov subspace method for this system is MINRES method [16] but the convergence of this method well be slow. This slowness is resulted ...

6

Dual Based Procedures for Un Capacitated Minimum Cost Flow Problem

Dual Based Procedures for Un Capacitated Minimum Cost Flow Problem

... Sharma and Saxena [1] have posed the transshipment problem differently. We use the formulation proposed by Sharma and Saxena [1]. We then modify the dual based methods developed by them to obtain better ...

13

OD-matrix estimation based on a dual formulation of traffic assignment problem

OD-matrix estimation based on a dual formulation of traffic assignment problem

... Congestion, accidents, greenhouse gas emission and others seem to become unsolvable problems for all levels of management in modern large cities worldwide. The increasing motorization dynamics requires development of ...

6

Dual Landownership as Tax Shelter: How Did the Chinese Solve Ricardo's Problem?

Dual Landownership as Tax Shelter: How Did the Chinese Solve Ricardo's Problem?

... 2) Dual ownership was more likely to arise on double cropped plots than annually cropped plots due to peasants’ greater comparative advantage in managing double cropping ...

34

Ray's Theorem for Firmly Nonexpansive-Like Mappings and Equilibrium Problems in Banach Spaces

Ray's Theorem for Firmly Nonexpansive-Like Mappings and Equilibrium Problems in Banach Spaces

... inequality problem for a mapping A : C → E ∗ , that is, the problem of finding an element x ∈ C such that y − x, A x ≥ 0 for all y ∈ C and the set of solutions of this problem is denoted by VIC, ...

7

Evaluation of Substructure Reduction Techniques with Fixed and Free Interfaces

Evaluation of Substructure Reduction Techniques with Fixed and Free Interfaces

... In this paper the general concepts of the Craig- Bampton method (CBM), the MacNeal method (MNM), the Rubin method (RM) and the dual Craig- Bampton method (DCBM) were briefly presented, compared and discussed using ...

11

Vol 2, No 7 (2011)

Vol 2, No 7 (2011)

... For nonlinear programming problems, a number of duals have been suggested among which the Wolfe dual [6, 23] is well known. While studying duality under generalized convexity, Mond and Weir [29] proposed a number ...

8

Show all 10000 documents...

Related subjects