• Nenhum resultado encontrado

[PDF] Top 20 Polynomial Penalty Method for Solving Linear Programming Problems

Has 10000 "Polynomial Penalty Method for Solving Linear Programming Problems" found on our website. Below are the top 20 most common "Polynomial Penalty Method for Solving Linear Programming Problems".

Polynomial Penalty Method for Solving Linear Programming Problems

Polynomial Penalty Method for Solving Linear Programming Problems

... in penalty method is to eliminate some or all of the constraints and add to the objective function a penalty term which prescribes a high cost to infeasible points (Wright, 2001; Zboo, ...this ... See full document

5

Station Cone Algorithm for Linear Programming

Station Cone Algorithm for Linear Programming

... the linear programming as prove that the linear programming problem be solved in polynomial time ...ellipsoid method gives a bound of arithmetic operations on number with ... See full document

4

A NEW MODIFIED APPROACH USING BEST CANDIDATES METHOD FOR SOLVING LINEAR ASSIGNMENT PROBLEMS

A NEW MODIFIED APPROACH USING BEST CANDIDATES METHOD FOR SOLVING LINEAR ASSIGNMENT PROBLEMS

... available. Linear Assignment Problems (LAP) is one of the most important optimization problem solving methods (in Operation Research) support this ...Candidates Method (BCM) and compares the ... See full document

6

A New Polynomial Method for Solving Fredholm –Volterra Integral Equations

A New Polynomial Method for Solving Fredholm –Volterra Integral Equations

... Legendre polynomial based methods [37-43]are used to obtain the fast solutions problems of science and ...these problems to those of solving a system of linear /nonlinear algebraic ... See full document

10

Bilevel Linear Programming Problems with Quadratic Membership Functions of Fuzzy Parameters

Bilevel Linear Programming Problems with Quadratic Membership Functions of Fuzzy Parameters

... direction method for nonlinear BLPPs using the property that the steepest descent direction coincides with the optimal solution of the linear-quadratic bilevel ...bundle method using subdifferential ... See full document

5

Interior point filter method for semi- infinite programming problems

Interior point filter method for semi- infinite programming problems

... the penalty parameter is a difficult ...filter method as an alternative to a merit function to guarantee global convergence in algorithms for nonlinear ...a linear combination of those two ... See full document

31

Absolute Change Pivot Rule for the Simplex Algorithm

Absolute Change Pivot Rule for the Simplex Algorithm

... We proposed a pivot rule called the absolute change pivot rule. The idea of this rule is to have the maximum improvement in the objective value per unit step of the entering variable. We believe that the proposed ... See full document

5

Multi level Programming in Multi Site Production Systems Analysis

Multi level Programming in Multi Site Production Systems Analysis

... programming problems. A numerical example for a three-level 0–1 programming problem is provided to illustrate the proposed method(Sakawa & ...goal programming methodology for ... See full document

17

FFLP problem with symmetric trapezoidal fuzzy numbers

FFLP problem with symmetric trapezoidal fuzzy numbers

... for solving fully fuzzy linear programming (FFLP) problems is to convert them into the corresponding deterministic linear ...for solving fully fuzzy linear ... See full document

8

Solving Directly Two Point Non Linear Boundary Value Problems Using Direct Adams Moulton Method

Solving Directly Two Point Non Linear Boundary Value Problems Using Direct Adams Moulton Method

... direct method of Adams Moulton type was developed for solving non linear two point Boundary Value Problems (BVPs) ...direct method in this research will solved the second order BVPs ... See full document

5

A primal-dual exterior point algorithm for linear programming problems

A primal-dual exterior point algorithm for linear programming problems

... at problems of size 2000x2000 and 20% ...IPM method failed to solve all problems terminating either saying that the problem is unbounded or infeasible, while PDEPSA did not faced difficulties ... See full document

10

A Constrained Genetic Algorithm Based on Constraint Handling with KS Function and Grouping Penalty

A Constrained Genetic Algorithm Based on Constraint Handling with KS Function and Grouping Penalty

... optimization problems or just with simple ...design problems may have many expensive ...optimization problems, there exist some classical methods[1], such as penalty function method, ... See full document

7

An Approach to Solve Bilevel Quadratic-linear Programming Problems

An Approach to Solve Bilevel Quadratic-linear Programming Problems

... by solving a series of convex quadratic programming problems with linear ...Quadratic programming problem (5) can be solved using the Karush-Kuhn-Tucker (KKT) conditions or by any other ... See full document

4

An Algorithm for Solving Quadratic Programming Problems

An Algorithm for Solving Quadratic Programming Problems

... gramming problems where at every step a sub-problem with effec- tive constraints is ...convenient method to solve quadratic programming problems with constraint ...This method reduces ... See full document

13

Comput. Appl. Math.  vol.30 número1

Comput. Appl. Math. vol.30 número1

... optimization problems are usually converted into nonlinear pro- gramming ...the problems are huge, the iterations of the math- ematical method used in its solution must be ...sequential linear ... See full document

37

Sensitivity Analysis for Interval-valued Fully Fuzzy Linear Programming Problems

Sensitivity Analysis for Interval-valued Fully Fuzzy Linear Programming Problems

... a method to obtain the approximate solution of fully fuzzy linear programming ...new method called the bounded dual simplex method for bounded fuzzy number linear ... See full document

14

Taylor Approach for Solving Non-Linear Bi-level Programming Problem

Taylor Approach for Solving Non-Linear Bi-level Programming Problem

... for solving the BLPP [3, 4, 11, 12, 13, 21, ...for solving linear bi-level programming problems ...smooth method to BLPP are ... See full document

7

A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints

A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints

... In the present paper a KKT system transformation in a system of smooth equations, which can be solved by classical Newton method is considered. The paper is organized as follows. In Section 2 we define the ... See full document

23

Comput. Appl. Math.  vol.31 número2

Comput. Appl. Math. vol.31 número2

... SQP method for equality constrained optimization is considered. This method avoids using a penalty function or a filter, and yet can be globally convergent to first-order critical points under some ... See full document

26

Interactive Fuzzy Decision Making for Hierarchical Multiobjective Stochastic Linear Programming Problems

Interactive Fuzzy Decision Making for Hierarchical Multiobjective Stochastic Linear Programming Problems

... stochastic linear programming problems (HMOP) where multiple decision makers in a hierarchical organization have their own multiple objective linear functions together with common ... See full document

6

Show all 10000 documents...