نتایج جستجو برای: nonlinear multi objective programming

تعداد نتایج: 1459885  

Journal: :مهندسی صنایع 0
محمدمهدی نصیری استادیار دانشکدة مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران نادیا پورمحمد ضیا کارشناسی ارشد دانشکده مهندسی صنایع پردیس دانشکده های فنی دانشگاه تهران

performance of a supply chain highly depends on its suppliers and therefore, appropriate selection of them is of great importance. this paper presents an integrated model of an mcdm method and a mathematical programming in order to select suppliers and determine lot sizes in the supply chain. the proposed framework comprises two main sub-models; the qualitative sub-model seeks to evaluate the s...

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

Journal: :IOP Conference Series: Earth and Environmental Science 2020

2016
Ram U. Verma Youngsoo Seol

First a new notion of the random exponential Hanson-Antczak type [Formula: see text]-V-invexity is introduced, which generalizes most of the existing notions in the literature, second a random function [Formula: see text] of the second order is defined, and finally a class of asymptotically sufficient efficiency conditions in semi-infinite multi-objective fractional programming is established. ...

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

2008
I. AHMAD

A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید