Search
Search Results
-
Mehar approach to solve hesitant fuzzy linear programming problems
Recently, an approach is proposed in the literature to solve hesitant fuzzy linear programming problems (linear programming problems in which the...
-
Optimal pivot path of the simplex method for linear programming based on reinforcement learning
Based on the existing pivot rules, the simplex method for linear programming is not polynomial in the worst case. Therefore, the optimal pivot of the...
-
An Affine Scaling Algorithm for Biobjective Linear Programming
Given a biobjective linear programming problem, we develop an affine scaling algorithm with min-max direction and demonstrate its convergence for an...
-
One more proof of the first linear programming bound for binary codes and two conjectures
We give one more proof of the first linear programming bound for binary codes, following the line of work initiated by Friedman and Tillich [9]. The...
-
Exploiting the polyhedral geometry of stochastic linear bilevel programming
We study linear bilevel programming problems whose lower-level objective is given by a random cost vector with known distribution. We consider the...
-
-
Iterative MILP algorithm to find alternate solutions in linear programming models
We address in this paper linear programming (LP) models in which it is desired to find a finite set of alternate optima. An LP may have multiple...
-
Signomial Geometric Programming Approach to Solve Non-Linear Fractional Programming Problems
In the last few decades, there is a spectacular diversification in the field of mathematical programming. One domain of mathematical programming in...
-
Bi-objective multistage stochastic linear programming
We propose an algorithm for solving a class of bi-objective multistage stochastic linear programs. We show that the cost-to-go functions are saddle...
-
A Penalty Function Approach for Solving the Linear Trilevel Programming Problem
In this paper, we mainly focus on the solving approach for the linear trilevel programming (LTP) problem. Firstly, based on the lower-level problem’s...
-
A New Method to Solve Fully Intuitionistic Fuzzy Multi-objective Linear Programming Problem Through Conflict and Non-conflict
In many real-life optimization situations the parameters involve are imprecise and vague. A fuzzy environment gives a way to overcome this vagueness...
-
Data-Driven Distributionally Robust Risk-Averse Two-Stage Stochastic Linear Programming over Wasserstein Ball
In this paper, we consider a data-driven distributionally robust two-stage stochastic linear optimization problem over 1-Wasserstein ball centered at...
-
Exact Vertex Migration Model of Graph Partitioning Based on Mixed 0–1 Linear Programming and Iteration Algorithm
Graph partitioning problem is a classical NP-hard problem. The improvement of graph partitioning results by vertex migration is an important class of...
-
Convergence of successive linear programming algorithms for noisy functions
Gradient-based methods have been highly successful for solving a variety of both unconstrained and constrained nonlinear optimization problems. In...
-
Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming
This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem. For establishing this algorithm,...
-
Complexity Issues in Interval Linear Programming
Interval linear programming studies linear programming problems with interval coefficients. Herein, the intervals represent a range of possible...
-
A Version of Bundle Trust Region Method with Linear Programming
We present a general version of bundle trust region method for minimizing convex functions. The trust region is constructed by generic
... 
-
An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems
In this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear...
-
Generalization of the Carathéodory Theorem and the Maximum Principle in Averaged Problems of Non-Linear Programming
AbstractThe relationship between the averaging of functions over time and its averaging over the set of values of the required variables is...
