☆ 4.7 Article

Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems

MATHEMATICS (2022)

Related references

Note: Only part of the references are listed.

Article Operations Research & Management Science

Characterization results of solutions in interval-valued optimization problems with mixed constraints

Savin Treanta

Summary: This paper establishes characterization results of solutions associated with a class of interval-valued optimization problems with mixed constraints, exploring the connections between different problems and providing illustrative examples.

JOURNAL OF GLOBAL OPTIMIZATION (2022)

Add to Collection

Article Mathematics, Interdisciplinary Applications

Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators

Kin Keung Lai et al.

Summary: In this paper, the Fritz John stationary conditions are established for nonsmooth, nonlinear, semidefinite, multiobjective programs with vanishing constraints. The study also introduces generalized constraints qualification to achieve strong S-stationary conditions. Moreover, strong S-stationary necessary and sufficient conditions are independently established. The optimality results in this paper are related to Treanta's recent articles in 2021 and can be extended to interval-valued optimization problems.

FRACTAL AND FRACTIONAL (2022)

Add to Collection

Article Computer Science, Software Engineering

Relaxation schemes for mathematical programmes with switching constraints

Christian Kanzow et al.

Summary: This paper investigates the solution methods for switching-constrained optimization problems by adapting relaxation methods from numerical mathematical programs. Detailed convergence analysis is provided for these adapted relaxation schemes. It is shown that certain methods are capable of identifying stationary points of switching-constrained programs under suitable assumptions.

OPTIMIZATION METHODS & SOFTWARE (2021)

Add to Collection

Article Mathematics, Applied

Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials

Xian-Jun Long et al.

Summary: This paper studies the characterization of the solution set for nonconvex semi-infinite programming problems related to tangential subdifferentials, providing a necessary optimality condition and proving the constancy of the Lagrangian function on the solution set. By using Dini pseudoconvexity, two characterizations of the solution set are obtained, with examples to illustrate the results.

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION (2021)

Add to Collection

Article Operations Research & Management Science

Characterizations of robust ε-quasi optimal solutions for nonsmooth optimization problems with uncertain data

Xiang-Kai Sun et al.

Summary: This paper discusses robust epsilon-quasi optimal solutions for nonsmooth optimization problems with uncertain data, establishing approximate optimality conditions and exploring relationships through robust optimization and a mixed-type robust approximate dual problem. Optimal conditions for robust weakly approximate efficient solutions for an uncertain nonsmooth multiobjective optimization problem are derived using a scalarization method, along with approximate duality theorems for the problem.

OPTIMIZATION (2021)

Add to Collection

Article Mathematics, Applied

On semidifferentiable interval-valued programming problems

Kin Keung Lai et al.

Summary: In this paper, the semidifferentiable case of an interval-valued minimization problem was considered, and sufficient optimality conditions and Wolfe type as well as Mond-Weir type duality theorems were established under semilocal E-preinvex functions. Additionally, saddle-point optimality criteria were presented to relate an optimal solution of the semidifferentiable interval-valued programming problem and a saddle point of the Lagrangian function.

JOURNAL OF INEQUALITIES AND APPLICATIONS (2021)

Add to Collection

Article Mathematics, Applied

Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints

Haijun Wang et al.

Summary: This paper studies the duality theorems of a nondifferentiable semi-infinite interval-valued optimization problem with vanishing constraints, by constructing dual models under the assumptions of generalized convexity. It presents weak duality, strong duality, converse duality, restricted converse duality, and strict converse duality theorems between the problem and its dual models.

JOURNAL OF INEQUALITIES AND APPLICATIONS (2021)

Add to Collection

Article Operations Research & Management Science

Optimality Conditions and Exact Penalty for Mathematical Programs with Switching Constraints

Yan-Chao Liang et al.

Summary: This paper gives an overview on optimality conditions and exact penalization for the mathematical program with switching constraints (MPSC), which is a new class of optimization problems with important applications. It discusses how to reformulate MPSC as a mathematical program with disjunctive constraints (MPDC) to address potential failure of usual constraint qualifications, provides two types of sufficient conditions for the local error bound and exact penalty results for MPSC, and surveys recent results on constraint qualifications and optimality conditions for MPDC.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2021)

Add to Collection

Article Mathematics, Applied

Hermite-Hadamard-type inequalities for interval-valued preinvex functions via Riemann-Liouville fractional integrals

Nidhi Sharma et al.

Summary: This paper introduces a new type of preinvex interval-valued function and establishes corresponding inequalities using interval-valued fractional integrals. The theoretical results are supported by examples provided in the paper.

JOURNAL OF INEQUALITIES AND APPLICATIONS (2021)

Add to Collection

Article Computer Science, Software Engineering

Stationarity conditions and constraint qualifications for mathematical programs with switching constraints With applications to either-or-constrained programming

Patrick Mehlitz

MATHEMATICAL PROGRAMMING (2020)

Add to Collection

Article Operations Research & Management Science

Characterizing the solution set of convex optimization problems without convexity of constraints

Nithirat Sisarat et al.

OPTIMIZATION LETTERS (2020)

Add to Collection

Article Mathematics, Applied

Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications

Tran Van Su et al.

COMPUTATIONAL & APPLIED MATHEMATICS (2020)

Add to Collection

Article Engineering, Multidisciplinary

SOME CHARACTERIZATIONS OF ROBUST SOLUTION SETS FOR UNCERTAIN CONVEX OPTIMIZATION PROBLEMS WITH LOCALLY LIPSCHITZ INEQUALITY CONSTRAINTS

Nithirat Sisarat et al.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2020)

Add to Collection

Article Operations Research & Management Science

Characterizations of Solution Sets of Differentiable Quasiconvex Programming Problems

Vsevolod I. Ivanov

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2019)

Add to Collection

Article Operations Research & Management Science

Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems

Xiangkai Sun et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2019)

Add to Collection

Article Operations Research & Management Science

Characterizations of robust solution set of convex programs with uncertain data

Xiao-Bing Li et al.

OPTIMIZATION LETTERS (2018)

Add to Collection

Article Operations Research & Management Science

Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators

Yogendra Pandey et al.

ANNALS OF OPERATIONS RESEARCH (2018)

Add to Collection

Article Operations Research & Management Science

Saddle point optimality criteria for mathematical programming problems with equilibrium constraints

Yadvendra Singh et al.

OPERATIONS RESEARCH LETTERS (2017)

Add to Collection

Article Mathematics, Applied

On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints

Sy-Ming Guu et al.

JOURNAL OF INEQUALITIES AND APPLICATIONS (2017)

Add to Collection

Article Operations Research & Management Science

On duality for mathematical programs with vanishing constraints

S. K. Mishra et al.

ANNALS OF OPERATIONS RESEARCH (2016)

Add to Collection

Article Computer Science, Artificial Intelligence

Relationships between interval-valued vector optimization problems and vector variational inequalities

Jianke Zhang et al.

FUZZY OPTIMIZATION AND DECISION MAKING (2016)

Add to Collection

Article Operations Research & Management Science

Duality for Nonsmooth Optimization Problems with Equilibrium Constraints, Using Convexificators

Yogendra Pandey et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2016)

Add to Collection

Article Operations Research & Management Science

On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints

Yogendra Pandey et al.

OPERATIONS RESEARCH LETTERS (2016)

Add to Collection

Article Operations Research & Management Science

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

V. Jeyakumar et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2015)

Add to Collection

Article Mathematics, Applied

A new approach to characterize the solution set of a pseudoconvex programming problem

T. Q. Son et al.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2014)

Add to Collection

Article Operations Research & Management Science

Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems

S. K. Mishra et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2014)

Add to Collection

Article Operations Research & Management Science

Characterizations of the solution set for a class of nonsmooth optimization problems

Ke Quan Zhao et al.

OPTIMIZATION LETTERS (2013)

Add to Collection

Article Management

The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions

Hsien-Chung Wu

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)

Add to Collection

Article Operations Research & Management Science

On Characterizing the Solution Sets of Pseudoinvex Extremum Problems

X. M. Yang

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2009)

Add to Collection

Article Operations Research & Management Science

Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers

C. S. Lalitha et al.

OPTIMIZATION (2009)

Add to Collection

Article Mathematics, Applied

On interval-valued nonlinear programming problems

Hsien-Chung Wu

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS (2008)

Add to Collection

Article Operations Research & Management Science

Characterizations of optimal solution sets of convex infinite programs

T. Q. Son et al.

TOP (2008)

Add to Collection

Article Computer Science, Software Engineering

Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications

Wolfgang Achtziger et al.

MATHEMATICAL PROGRAMMING (2008)

Add to Collection

Article Management

The Karush-Kuhn-Tucker optimality conditions in an optimization problem with interval-valued objective function

Hsien-Chung Wu

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Add to Collection

Article Management

Characterizations of solution sets of convex vector minimization problems

V. Jeyakumar et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)

Add to Collection

Article Operations Research & Management Science

Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems

N. Dinh et al.

OPTIMIZATION (2006)

Add to Collection

Article Operations Research & Management Science

Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs

V Jeyakumar et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2004)

Add to Collection

Article Engineering, Multidisciplinary

Optimal Design of Trusses Under a Nonconvex Global Buckling Constraint

Aharon Ben-Tal et al.

OPTIMIZATION AND ENGINEERING (2000)

Add to Collection

© Peeref 2019-2024. All rights reserved.